./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ea833a61-ea57-4621-8f11-d4acb052e7a9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ea833a61-ea57-4621-8f11-d4acb052e7a9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ea833a61-ea57-4621-8f11-d4acb052e7a9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ea833a61-ea57-4621-8f11-d4acb052e7a9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ea833a61-ea57-4621-8f11-d4acb052e7a9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ea833a61-ea57-4621-8f11-d4acb052e7a9/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 d52e74df0654e1f032e9591db582096a56c19f5c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 08:11:44,496 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 08:11:44,498 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 08:11:44,514 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 08:11:44,515 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 08:11:44,516 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 08:11:44,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 08:11:44,520 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 08:11:44,533 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 08:11:44,534 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 08:11:44,535 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 08:11:44,536 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 08:11:44,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 08:11:44,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 08:11:44,539 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 08:11:44,540 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 08:11:44,541 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 08:11:44,542 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 08:11:44,544 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 08:11:44,548 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 08:11:44,553 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 08:11:44,556 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 08:11:44,560 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 08:11:44,560 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 08:11:44,567 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 08:11:44,567 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 08:11:44,568 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 08:11:44,570 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 08:11:44,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 08:11:44,572 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 08:11:44,572 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 08:11:44,573 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 08:11:44,573 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 08:11:44,574 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 08:11:44,575 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 08:11:44,575 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 08:11:44,576 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 08:11:44,576 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 08:11:44,576 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 08:11:44,578 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 08:11:44,579 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 08:11:44,579 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ea833a61-ea57-4621-8f11-d4acb052e7a9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 08:11:44,607 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 08:11:44,608 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 08:11:44,609 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 08:11:44,609 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 08:11:44,609 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 08:11:44,609 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 08:11:44,609 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 08:11:44,609 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 08:11:44,610 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 08:11:44,610 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 08:11:44,610 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 08:11:44,610 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 08:11:44,610 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 08:11:44,611 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 08:11:44,611 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 08:11:44,611 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 08:11:44,611 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 08:11:44,611 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 08:11:44,612 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 08:11:44,612 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 08:11:44,612 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 08:11:44,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 08:11:44,612 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 08:11:44,613 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 08:11:44,613 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 08:11:44,613 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 08:11:44,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 08:11:44,613 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 08:11:44,614 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_ea833a61-ea57-4621-8f11-d4acb052e7a9/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 -> d52e74df0654e1f032e9591db582096a56c19f5c [2019-11-20 08:11:44,779 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 08:11:44,793 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 08:11:44,797 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 08:11:44,804 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 08:11:44,804 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 08:11:44,806 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ea833a61-ea57-4621-8f11-d4acb052e7a9/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c [2019-11-20 08:11:44,873 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ea833a61-ea57-4621-8f11-d4acb052e7a9/bin/uautomizer/data/9a7fdcea1/4a91f629431a46e78a8ec8a64b7ffc83/FLAGfeedc7820 [2019-11-20 08:11:45,344 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 08:11:45,345 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ea833a61-ea57-4621-8f11-d4acb052e7a9/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c [2019-11-20 08:11:45,360 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ea833a61-ea57-4621-8f11-d4acb052e7a9/bin/uautomizer/data/9a7fdcea1/4a91f629431a46e78a8ec8a64b7ffc83/FLAGfeedc7820 [2019-11-20 08:11:45,707 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ea833a61-ea57-4621-8f11-d4acb052e7a9/bin/uautomizer/data/9a7fdcea1/4a91f629431a46e78a8ec8a64b7ffc83 [2019-11-20 08:11:45,709 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 08:11:45,710 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 08:11:45,711 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 08:11:45,711 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 08:11:45,715 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 08:11:45,715 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:11:45" (1/1) ... [2019-11-20 08:11:45,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@487c6bda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:45, skipping insertion in model container [2019-11-20 08:11:45,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:11:45" (1/1) ... [2019-11-20 08:11:45,726 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 08:11:45,776 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 08:11:46,071 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 08:11:46,080 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 08:11:46,130 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 08:11:46,148 INFO L192 MainTranslator]: Completed translation [2019-11-20 08:11:46,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:46 WrapperNode [2019-11-20 08:11:46,149 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 08:11:46,150 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 08:11:46,150 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 08:11:46,151 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 08:11:46,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:46" (1/1) ... [2019-11-20 08:11:46,166 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:46" (1/1) ... [2019-11-20 08:11:46,204 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 08:11:46,205 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 08:11:46,205 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 08:11:46,205 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 08:11:46,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:46" (1/1) ... [2019-11-20 08:11:46,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:46" (1/1) ... [2019-11-20 08:11:46,219 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:46" (1/1) ... [2019-11-20 08:11:46,219 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:46" (1/1) ... [2019-11-20 08:11:46,228 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:46" (1/1) ... [2019-11-20 08:11:46,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:46" (1/1) ... [2019-11-20 08:11:46,240 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:46" (1/1) ... [2019-11-20 08:11:46,245 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 08:11:46,245 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 08:11:46,245 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 08:11:46,245 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 08:11:46,246 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea833a61-ea57-4621-8f11-d4acb052e7a9/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 08:11:46,362 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 08:11:46,363 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 08:11:46,995 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 08:11:46,995 INFO L285 CfgBuilder]: Removed 17 assume(true) statements. [2019-11-20 08:11:46,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:11:46 BoogieIcfgContainer [2019-11-20 08:11:46,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 08:11:46,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 08:11:46,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 08:11:47,000 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 08:11:47,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:11:45" (1/3) ... [2019-11-20 08:11:47,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2a9593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:11:47, skipping insertion in model container [2019-11-20 08:11:47,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:11:46" (2/3) ... [2019-11-20 08:11:47,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2a9593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:11:47, skipping insertion in model container [2019-11-20 08:11:47,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:11:46" (3/3) ... [2019-11-20 08:11:47,003 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c [2019-11-20 08:11:47,013 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 08:11:47,028 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 08:11:47,050 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 08:11:47,085 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 08:11:47,086 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 08:11:47,086 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 08:11:47,086 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 08:11:47,086 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 08:11:47,086 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 08:11:47,086 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 08:11:47,087 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 08:11:47,105 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states. [2019-11-20 08:11:47,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 08:11:47,114 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:47,115 INFO L410 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-20 08:11:47,115 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:11:47,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:47,122 INFO L82 PathProgramCache]: Analyzing trace with hash -2043629398, now seen corresponding path program 1 times [2019-11-20 08:11:47,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:47,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251595513] [2019-11-20 08:11:47,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:47,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:47,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251595513] [2019-11-20 08:11:47,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:47,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 08:11:47,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438518324] [2019-11-20 08:11:47,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 08:11:47,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:11:47,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 08:11:47,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 08:11:47,376 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 4 states. [2019-11-20 08:11:47,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:47,480 INFO L93 Difference]: Finished difference Result 127 states and 207 transitions. [2019-11-20 08:11:47,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 08:11:47,482 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-20 08:11:47,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:47,493 INFO L225 Difference]: With dead ends: 127 [2019-11-20 08:11:47,493 INFO L226 Difference]: Without dead ends: 71 [2019-11-20 08:11:47,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:11:47,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-20 08:11:47,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2019-11-20 08:11:47,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-11-20 08:11:47,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 100 transitions. [2019-11-20 08:11:47,541 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 100 transitions. Word has length 23 [2019-11-20 08:11:47,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:47,542 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 100 transitions. [2019-11-20 08:11:47,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 08:11:47,542 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 100 transitions. [2019-11-20 08:11:47,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-20 08:11:47,544 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:47,544 INFO L410 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-20 08:11:47,545 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:11:47,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:47,547 INFO L82 PathProgramCache]: Analyzing trace with hash 530615648, now seen corresponding path program 1 times [2019-11-20 08:11:47,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:47,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50885015] [2019-11-20 08:11:47,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:47,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:47,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50885015] [2019-11-20 08:11:47,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:47,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:11:47,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073652841] [2019-11-20 08:11:47,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:11:47,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:11:47,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:11:47,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:11:47,689 INFO L87 Difference]: Start difference. First operand 71 states and 100 transitions. Second operand 3 states. [2019-11-20 08:11:47,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:47,722 INFO L93 Difference]: Finished difference Result 159 states and 238 transitions. [2019-11-20 08:11:47,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:11:47,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-20 08:11:47,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:47,725 INFO L225 Difference]: With dead ends: 159 [2019-11-20 08:11:47,726 INFO L226 Difference]: Without dead ends: 109 [2019-11-20 08:11:47,727 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:11:47,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-20 08:11:47,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2019-11-20 08:11:47,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-20 08:11:47,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 157 transitions. [2019-11-20 08:11:47,741 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 157 transitions. Word has length 39 [2019-11-20 08:11:47,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:47,742 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 157 transitions. [2019-11-20 08:11:47,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:11:47,742 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 157 transitions. [2019-11-20 08:11:47,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-20 08:11:47,744 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:47,744 INFO L410 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-20 08:11:47,744 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:11:47,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:47,745 INFO L82 PathProgramCache]: Analyzing trace with hash -927423442, now seen corresponding path program 1 times [2019-11-20 08:11:47,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:47,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804388631] [2019-11-20 08:11:47,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:47,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:47,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:47,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804388631] [2019-11-20 08:11:47,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:47,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:11:47,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997092422] [2019-11-20 08:11:47,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:11:47,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:11:47,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:11:47,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:11:47,855 INFO L87 Difference]: Start difference. First operand 107 states and 157 transitions. Second operand 3 states. [2019-11-20 08:11:47,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:47,915 INFO L93 Difference]: Finished difference Result 255 states and 389 transitions. [2019-11-20 08:11:47,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:11:47,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-20 08:11:47,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:47,919 INFO L225 Difference]: With dead ends: 255 [2019-11-20 08:11:47,919 INFO L226 Difference]: Without dead ends: 169 [2019-11-20 08:11:47,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:11:47,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-11-20 08:11:47,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2019-11-20 08:11:47,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2019-11-20 08:11:47,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 250 transitions. [2019-11-20 08:11:47,938 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 250 transitions. Word has length 40 [2019-11-20 08:11:47,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:47,939 INFO L462 AbstractCegarLoop]: Abstraction has 167 states and 250 transitions. [2019-11-20 08:11:47,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:11:47,939 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 250 transitions. [2019-11-20 08:11:47,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-20 08:11:47,941 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:47,941 INFO L410 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-20 08:11:47,941 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:11:47,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:47,942 INFO L82 PathProgramCache]: Analyzing trace with hash 886669232, now seen corresponding path program 1 times [2019-11-20 08:11:47,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:47,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257546555] [2019-11-20 08:11:47,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:47,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:48,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:48,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257546555] [2019-11-20 08:11:48,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:48,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 08:11:48,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517565647] [2019-11-20 08:11:48,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 08:11:48,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:11:48,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 08:11:48,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:11:48,040 INFO L87 Difference]: Start difference. First operand 167 states and 250 transitions. Second operand 5 states. [2019-11-20 08:11:48,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:48,217 INFO L93 Difference]: Finished difference Result 751 states and 1166 transitions. [2019-11-20 08:11:48,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 08:11:48,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-20 08:11:48,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:48,233 INFO L225 Difference]: With dead ends: 751 [2019-11-20 08:11:48,233 INFO L226 Difference]: Without dead ends: 605 [2019-11-20 08:11:48,238 INFO L630 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-20 08:11:48,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2019-11-20 08:11:48,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 311. [2019-11-20 08:11:48,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2019-11-20 08:11:48,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 470 transitions. [2019-11-20 08:11:48,320 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 470 transitions. Word has length 41 [2019-11-20 08:11:48,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:48,321 INFO L462 AbstractCegarLoop]: Abstraction has 311 states and 470 transitions. [2019-11-20 08:11:48,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 08:11:48,321 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 470 transitions. [2019-11-20 08:11:48,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-20 08:11:48,326 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:48,326 INFO L410 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-20 08:11:48,326 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:11:48,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:48,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1333618984, now seen corresponding path program 1 times [2019-11-20 08:11:48,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:48,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776268924] [2019-11-20 08:11:48,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:48,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:48,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:48,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776268924] [2019-11-20 08:11:48,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:48,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 08:11:48,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146946901] [2019-11-20 08:11:48,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 08:11:48,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:11:48,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 08:11:48,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:11:48,498 INFO L87 Difference]: Start difference. First operand 311 states and 470 transitions. Second operand 5 states. [2019-11-20 08:11:48,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:48,610 INFO L93 Difference]: Finished difference Result 1109 states and 1693 transitions. [2019-11-20 08:11:48,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 08:11:48,611 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-11-20 08:11:48,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:48,619 INFO L225 Difference]: With dead ends: 1109 [2019-11-20 08:11:48,619 INFO L226 Difference]: Without dead ends: 819 [2019-11-20 08:11:48,623 INFO L630 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-20 08:11:48,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2019-11-20 08:11:48,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 815. [2019-11-20 08:11:48,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2019-11-20 08:11:48,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1234 transitions. [2019-11-20 08:11:48,686 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1234 transitions. Word has length 42 [2019-11-20 08:11:48,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:48,687 INFO L462 AbstractCegarLoop]: Abstraction has 815 states and 1234 transitions. [2019-11-20 08:11:48,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 08:11:48,687 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1234 transitions. [2019-11-20 08:11:48,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-20 08:11:48,694 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:48,694 INFO L410 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-20 08:11:48,694 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:11:48,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:48,695 INFO L82 PathProgramCache]: Analyzing trace with hash 378912639, now seen corresponding path program 1 times [2019-11-20 08:11:48,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:48,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247163565] [2019-11-20 08:11:48,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:48,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:48,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:48,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247163565] [2019-11-20 08:11:48,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:48,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 08:11:48,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684009118] [2019-11-20 08:11:48,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 08:11:48,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:11:48,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 08:11:48,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-20 08:11:48,851 INFO L87 Difference]: Start difference. First operand 815 states and 1234 transitions. Second operand 7 states. [2019-11-20 08:11:49,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:49,082 INFO L93 Difference]: Finished difference Result 1705 states and 2543 transitions. [2019-11-20 08:11:49,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 08:11:49,083 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-11-20 08:11:49,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:49,094 INFO L225 Difference]: With dead ends: 1705 [2019-11-20 08:11:49,095 INFO L226 Difference]: Without dead ends: 1703 [2019-11-20 08:11:49,097 INFO L630 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-20 08:11:49,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2019-11-20 08:11:49,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 887. [2019-11-20 08:11:49,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2019-11-20 08:11:49,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1306 transitions. [2019-11-20 08:11:49,163 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1306 transitions. Word has length 43 [2019-11-20 08:11:49,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:49,165 INFO L462 AbstractCegarLoop]: Abstraction has 887 states and 1306 transitions. [2019-11-20 08:11:49,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 08:11:49,166 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1306 transitions. [2019-11-20 08:11:49,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-20 08:11:49,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:49,169 INFO L410 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-20 08:11:49,170 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:11:49,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:49,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1086031599, now seen corresponding path program 1 times [2019-11-20 08:11:49,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:49,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444387172] [2019-11-20 08:11:49,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:49,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:49,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:49,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444387172] [2019-11-20 08:11:49,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:49,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:11:49,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747561474] [2019-11-20 08:11:49,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:11:49,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:11:49,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:11:49,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:11:49,277 INFO L87 Difference]: Start difference. First operand 887 states and 1306 transitions. Second operand 3 states. [2019-11-20 08:11:49,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:49,435 INFO L93 Difference]: Finished difference Result 2323 states and 3408 transitions. [2019-11-20 08:11:49,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:11:49,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-20 08:11:49,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:49,446 INFO L225 Difference]: With dead ends: 2323 [2019-11-20 08:11:49,447 INFO L226 Difference]: Without dead ends: 1457 [2019-11-20 08:11:49,448 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:11:49,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2019-11-20 08:11:49,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 1435. [2019-11-20 08:11:49,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1435 states. [2019-11-20 08:11:49,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435 states to 1435 states and 2062 transitions. [2019-11-20 08:11:49,527 INFO L78 Accepts]: Start accepts. Automaton has 1435 states and 2062 transitions. Word has length 44 [2019-11-20 08:11:49,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:49,527 INFO L462 AbstractCegarLoop]: Abstraction has 1435 states and 2062 transitions. [2019-11-20 08:11:49,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:11:49,527 INFO L276 IsEmpty]: Start isEmpty. Operand 1435 states and 2062 transitions. [2019-11-20 08:11:49,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-20 08:11:49,528 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:49,529 INFO L410 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, 1] [2019-11-20 08:11:49,529 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:11:49,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:49,530 INFO L82 PathProgramCache]: Analyzing trace with hash -360236119, now seen corresponding path program 1 times [2019-11-20 08:11:49,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:49,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472933163] [2019-11-20 08:11:49,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:49,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:49,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:49,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472933163] [2019-11-20 08:11:49,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:49,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:11:49,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915627930] [2019-11-20 08:11:49,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:11:49,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:11:49,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:11:49,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:11:49,570 INFO L87 Difference]: Start difference. First operand 1435 states and 2062 transitions. Second operand 3 states. [2019-11-20 08:11:49,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:49,677 INFO L93 Difference]: Finished difference Result 2906 states and 4204 transitions. [2019-11-20 08:11:49,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:11:49,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-11-20 08:11:49,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:49,692 INFO L225 Difference]: With dead ends: 2906 [2019-11-20 08:11:49,692 INFO L226 Difference]: Without dead ends: 2039 [2019-11-20 08:11:49,694 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:11:49,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2019-11-20 08:11:49,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 2037. [2019-11-20 08:11:49,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2037 states. [2019-11-20 08:11:49,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 2892 transitions. [2019-11-20 08:11:49,806 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 2892 transitions. Word has length 45 [2019-11-20 08:11:49,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:49,807 INFO L462 AbstractCegarLoop]: Abstraction has 2037 states and 2892 transitions. [2019-11-20 08:11:49,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:11:49,807 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 2892 transitions. [2019-11-20 08:11:49,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-20 08:11:49,810 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:49,810 INFO L410 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] [2019-11-20 08:11:49,810 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:11:49,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:49,811 INFO L82 PathProgramCache]: Analyzing trace with hash 746076034, now seen corresponding path program 1 times [2019-11-20 08:11:49,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:49,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544800743] [2019-11-20 08:11:49,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:49,939 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-20 08:11:49,940 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544800743] [2019-11-20 08:11:49,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273181634] [2019-11-20 08:11:49,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea833a61-ea57-4621-8f11-d4acb052e7a9/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:11:50,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:50,064 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 08:11:50,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:50,186 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-20 08:11:50,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:11:50,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-20 08:11:50,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125809413] [2019-11-20 08:11:50,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 08:11:50,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:11:50,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 08:11:50,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-20 08:11:50,189 INFO L87 Difference]: Start difference. First operand 2037 states and 2892 transitions. Second operand 11 states. [2019-11-20 08:11:50,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:50,799 INFO L93 Difference]: Finished difference Result 5625 states and 7996 transitions. [2019-11-20 08:11:50,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 08:11:50,800 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-11-20 08:11:50,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:50,829 INFO L225 Difference]: With dead ends: 5625 [2019-11-20 08:11:50,829 INFO L226 Difference]: Without dead ends: 4879 [2019-11-20 08:11:50,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-11-20 08:11:50,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4879 states. [2019-11-20 08:11:51,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4879 to 2726. [2019-11-20 08:11:51,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2726 states. [2019-11-20 08:11:51,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 3902 transitions. [2019-11-20 08:11:51,033 INFO L78 Accepts]: Start accepts. Automaton has 2726 states and 3902 transitions. Word has length 63 [2019-11-20 08:11:51,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:51,033 INFO L462 AbstractCegarLoop]: Abstraction has 2726 states and 3902 transitions. [2019-11-20 08:11:51,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 08:11:51,033 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 3902 transitions. [2019-11-20 08:11:51,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-20 08:11:51,036 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:51,036 INFO L410 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] [2019-11-20 08:11:51,250 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:11:51,251 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:11:51,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:51,251 INFO L82 PathProgramCache]: Analyzing trace with hash 318729970, now seen corresponding path program 1 times [2019-11-20 08:11:51,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:51,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666637598] [2019-11-20 08:11:51,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:51,295 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-20 08:11:51,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666637598] [2019-11-20 08:11:51,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:51,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:11:51,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732620190] [2019-11-20 08:11:51,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:11:51,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:11:51,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:11:51,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:11:51,298 INFO L87 Difference]: Start difference. First operand 2726 states and 3902 transitions. Second operand 3 states. [2019-11-20 08:11:51,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:51,527 INFO L93 Difference]: Finished difference Result 5600 states and 7961 transitions. [2019-11-20 08:11:51,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:11:51,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-20 08:11:51,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:51,551 INFO L225 Difference]: With dead ends: 5600 [2019-11-20 08:11:51,552 INFO L226 Difference]: Without dead ends: 3737 [2019-11-20 08:11:51,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:11:51,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3737 states. [2019-11-20 08:11:51,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3737 to 3509. [2019-11-20 08:11:51,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3509 states. [2019-11-20 08:11:51,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3509 states to 3509 states and 4912 transitions. [2019-11-20 08:11:51,780 INFO L78 Accepts]: Start accepts. Automaton has 3509 states and 4912 transitions. Word has length 63 [2019-11-20 08:11:51,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:51,781 INFO L462 AbstractCegarLoop]: Abstraction has 3509 states and 4912 transitions. [2019-11-20 08:11:51,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:11:51,781 INFO L276 IsEmpty]: Start isEmpty. Operand 3509 states and 4912 transitions. [2019-11-20 08:11:51,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-20 08:11:51,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:51,785 INFO L410 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] [2019-11-20 08:11:51,785 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:11:51,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:51,786 INFO L82 PathProgramCache]: Analyzing trace with hash 699873896, now seen corresponding path program 1 times [2019-11-20 08:11:51,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:51,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072319191] [2019-11-20 08:11:51,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:51,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:51,847 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-20 08:11:51,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072319191] [2019-11-20 08:11:51,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:51,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:11:51,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854308269] [2019-11-20 08:11:51,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:11:51,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:11:51,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:11:51,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:11:51,850 INFO L87 Difference]: Start difference. First operand 3509 states and 4912 transitions. Second operand 3 states. [2019-11-20 08:11:52,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:52,135 INFO L93 Difference]: Finished difference Result 5954 states and 8237 transitions. [2019-11-20 08:11:52,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:11:52,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-20 08:11:52,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:52,161 INFO L225 Difference]: With dead ends: 5954 [2019-11-20 08:11:52,161 INFO L226 Difference]: Without dead ends: 3848 [2019-11-20 08:11:52,165 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:11:52,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3848 states. [2019-11-20 08:11:52,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3848 to 3311. [2019-11-20 08:11:52,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3311 states. [2019-11-20 08:11:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3311 states to 3311 states and 4505 transitions. [2019-11-20 08:11:52,379 INFO L78 Accepts]: Start accepts. Automaton has 3311 states and 4505 transitions. Word has length 63 [2019-11-20 08:11:52,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:52,379 INFO L462 AbstractCegarLoop]: Abstraction has 3311 states and 4505 transitions. [2019-11-20 08:11:52,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:11:52,379 INFO L276 IsEmpty]: Start isEmpty. Operand 3311 states and 4505 transitions. [2019-11-20 08:11:52,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-20 08:11:52,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:52,383 INFO L410 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] [2019-11-20 08:11:52,383 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:11:52,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:52,384 INFO L82 PathProgramCache]: Analyzing trace with hash 272527832, now seen corresponding path program 1 times [2019-11-20 08:11:52,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:52,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361728245] [2019-11-20 08:11:52,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:52,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:52,503 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-20 08:11:52,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361728245] [2019-11-20 08:11:52,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979155816] [2019-11-20 08:11:52,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea833a61-ea57-4621-8f11-d4acb052e7a9/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:11:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:52,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 08:11:52,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:52,711 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-20 08:11:52,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:11:52,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-20 08:11:52,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767942370] [2019-11-20 08:11:52,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 08:11:52,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:11:52,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 08:11:52,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-20 08:11:52,715 INFO L87 Difference]: Start difference. First operand 3311 states and 4505 transitions. Second operand 11 states. [2019-11-20 08:11:53,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:53,652 INFO L93 Difference]: Finished difference Result 11516 states and 15648 transitions. [2019-11-20 08:11:53,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 08:11:53,653 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 63 [2019-11-20 08:11:53,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:53,715 INFO L225 Difference]: With dead ends: 11516 [2019-11-20 08:11:53,715 INFO L226 Difference]: Without dead ends: 9007 [2019-11-20 08:11:53,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-11-20 08:11:53,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9007 states. [2019-11-20 08:11:54,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9007 to 4109. [2019-11-20 08:11:54,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4109 states. [2019-11-20 08:11:54,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4109 states to 4109 states and 5601 transitions. [2019-11-20 08:11:54,070 INFO L78 Accepts]: Start accepts. Automaton has 4109 states and 5601 transitions. Word has length 63 [2019-11-20 08:11:54,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:54,071 INFO L462 AbstractCegarLoop]: Abstraction has 4109 states and 5601 transitions. [2019-11-20 08:11:54,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 08:11:54,071 INFO L276 IsEmpty]: Start isEmpty. Operand 4109 states and 5601 transitions. [2019-11-20 08:11:54,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-20 08:11:54,074 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:54,074 INFO L410 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, 1] [2019-11-20 08:11:54,277 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:11:54,278 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:11:54,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:54,278 INFO L82 PathProgramCache]: Analyzing trace with hash -454670631, now seen corresponding path program 1 times [2019-11-20 08:11:54,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:54,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245630410] [2019-11-20 08:11:54,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:54,576 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:11:54,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245630410] [2019-11-20 08:11:54,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952987768] [2019-11-20 08:11:54,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea833a61-ea57-4621-8f11-d4acb052e7a9/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:11:54,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:54,686 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 08:11:54,700 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:11:54,814 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-20 08:11:54,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:11:54,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4] total 12 [2019-11-20 08:11:54,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291254075] [2019-11-20 08:11:54,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 08:11:54,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:11:54,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 08:11:54,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-11-20 08:11:54,820 INFO L87 Difference]: Start difference. First operand 4109 states and 5601 transitions. Second operand 12 states. [2019-11-20 08:11:58,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:11:58,120 INFO L93 Difference]: Finished difference Result 22194 states and 30041 transitions. [2019-11-20 08:11:58,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-20 08:11:58,121 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 64 [2019-11-20 08:11:58,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:11:58,155 INFO L225 Difference]: With dead ends: 22194 [2019-11-20 08:11:58,155 INFO L226 Difference]: Without dead ends: 19244 [2019-11-20 08:11:58,164 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=441, Invalid=1815, Unknown=0, NotChecked=0, Total=2256 [2019-11-20 08:11:58,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19244 states. [2019-11-20 08:11:58,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19244 to 10666. [2019-11-20 08:11:58,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10666 states. [2019-11-20 08:11:59,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10666 states to 10666 states and 14401 transitions. [2019-11-20 08:11:59,011 INFO L78 Accepts]: Start accepts. Automaton has 10666 states and 14401 transitions. Word has length 64 [2019-11-20 08:11:59,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:11:59,012 INFO L462 AbstractCegarLoop]: Abstraction has 10666 states and 14401 transitions. [2019-11-20 08:11:59,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 08:11:59,012 INFO L276 IsEmpty]: Start isEmpty. Operand 10666 states and 14401 transitions. [2019-11-20 08:11:59,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-20 08:11:59,018 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:11:59,019 INFO L410 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-20 08:11:59,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:11:59,231 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:11:59,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:11:59,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1826265243, now seen corresponding path program 1 times [2019-11-20 08:11:59,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:11:59,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981950087] [2019-11-20 08:11:59,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:11:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:11:59,385 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-20 08:11:59,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981950087] [2019-11-20 08:11:59,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:11:59,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 08:11:59,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355522334] [2019-11-20 08:11:59,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 08:11:59,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:11:59,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 08:11:59,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:11:59,388 INFO L87 Difference]: Start difference. First operand 10666 states and 14401 transitions. Second operand 5 states. [2019-11-20 08:12:00,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:12:00,246 INFO L93 Difference]: Finished difference Result 21932 states and 29918 transitions. [2019-11-20 08:12:00,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 08:12:00,247 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 64 [2019-11-20 08:12:00,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:12:00,279 INFO L225 Difference]: With dead ends: 21932 [2019-11-20 08:12:00,280 INFO L226 Difference]: Without dead ends: 18008 [2019-11-20 08:12:00,290 INFO L630 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-20 08:12:00,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18008 states. [2019-11-20 08:12:01,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18008 to 14366. [2019-11-20 08:12:01,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14366 states. [2019-11-20 08:12:01,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14366 states to 14366 states and 19391 transitions. [2019-11-20 08:12:01,084 INFO L78 Accepts]: Start accepts. Automaton has 14366 states and 19391 transitions. Word has length 64 [2019-11-20 08:12:01,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:12:01,085 INFO L462 AbstractCegarLoop]: Abstraction has 14366 states and 19391 transitions. [2019-11-20 08:12:01,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 08:12:01,085 INFO L276 IsEmpty]: Start isEmpty. Operand 14366 states and 19391 transitions. [2019-11-20 08:12:01,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-20 08:12:01,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:12:01,090 INFO L410 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-20 08:12:01,090 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:12:01,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:12:01,090 INFO L82 PathProgramCache]: Analyzing trace with hash -775657299, now seen corresponding path program 1 times [2019-11-20 08:12:01,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:12:01,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473044556] [2019-11-20 08:12:01,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:12:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:12:01,138 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-20 08:12:01,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473044556] [2019-11-20 08:12:01,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:12:01,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:12:01,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277560011] [2019-11-20 08:12:01,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:12:01,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:12:01,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:12:01,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:12:01,140 INFO L87 Difference]: Start difference. First operand 14366 states and 19391 transitions. Second operand 3 states. [2019-11-20 08:12:02,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:12:02,216 INFO L93 Difference]: Finished difference Result 35526 states and 47809 transitions. [2019-11-20 08:12:02,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:12:02,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-11-20 08:12:02,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:12:02,254 INFO L225 Difference]: With dead ends: 35526 [2019-11-20 08:12:02,254 INFO L226 Difference]: Without dead ends: 22397 [2019-11-20 08:12:02,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:12:02,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22397 states. [2019-11-20 08:12:03,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22397 to 22357. [2019-11-20 08:12:03,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22357 states. [2019-11-20 08:12:03,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22357 states to 22357 states and 29671 transitions. [2019-11-20 08:12:03,522 INFO L78 Accepts]: Start accepts. Automaton has 22357 states and 29671 transitions. Word has length 65 [2019-11-20 08:12:03,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:12:03,522 INFO L462 AbstractCegarLoop]: Abstraction has 22357 states and 29671 transitions. [2019-11-20 08:12:03,522 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:12:03,522 INFO L276 IsEmpty]: Start isEmpty. Operand 22357 states and 29671 transitions. [2019-11-20 08:12:03,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-20 08:12:03,525 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:12:03,526 INFO L410 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-20 08:12:03,526 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:12:03,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:12:03,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1693263233, now seen corresponding path program 1 times [2019-11-20 08:12:03,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:12:03,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083145310] [2019-11-20 08:12:03,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:12:03,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:12:03,565 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-20 08:12:03,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083145310] [2019-11-20 08:12:03,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:12:03,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:12:03,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372142182] [2019-11-20 08:12:03,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:12:03,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:12:03,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:12:03,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:12:03,567 INFO L87 Difference]: Start difference. First operand 22357 states and 29671 transitions. Second operand 3 states. [2019-11-20 08:12:04,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:12:04,521 INFO L93 Difference]: Finished difference Result 28615 states and 37571 transitions. [2019-11-20 08:12:04,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:12:04,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-11-20 08:12:04,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:12:04,547 INFO L225 Difference]: With dead ends: 28615 [2019-11-20 08:12:04,548 INFO L226 Difference]: Without dead ends: 18022 [2019-11-20 08:12:04,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:12:04,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18022 states. [2019-11-20 08:12:05,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18022 to 18004. [2019-11-20 08:12:05,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18004 states. [2019-11-20 08:12:05,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18004 states to 18004 states and 23411 transitions. [2019-11-20 08:12:05,733 INFO L78 Accepts]: Start accepts. Automaton has 18004 states and 23411 transitions. Word has length 65 [2019-11-20 08:12:05,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:12:05,733 INFO L462 AbstractCegarLoop]: Abstraction has 18004 states and 23411 transitions. [2019-11-20 08:12:05,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:12:05,733 INFO L276 IsEmpty]: Start isEmpty. Operand 18004 states and 23411 transitions. [2019-11-20 08:12:05,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-20 08:12:05,737 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:12:05,738 INFO L410 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-20 08:12:05,738 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:12:05,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:12:05,738 INFO L82 PathProgramCache]: Analyzing trace with hash -603051569, now seen corresponding path program 1 times [2019-11-20 08:12:05,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:12:05,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265574334] [2019-11-20 08:12:05,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:12:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:12:05,847 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-20 08:12:05,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265574334] [2019-11-20 08:12:05,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789247284] [2019-11-20 08:12:05,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea833a61-ea57-4621-8f11-d4acb052e7a9/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:12:05,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:12:05,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 08:12:05,943 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:12:06,034 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-20 08:12:06,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:12:06,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-11-20 08:12:06,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518787591] [2019-11-20 08:12:06,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 08:12:06,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:12:06,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 08:12:06,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-11-20 08:12:06,036 INFO L87 Difference]: Start difference. First operand 18004 states and 23411 transitions. Second operand 13 states. [2019-11-20 08:12:09,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:12:09,275 INFO L93 Difference]: Finished difference Result 51203 states and 66234 transitions. [2019-11-20 08:12:09,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-20 08:12:09,276 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 66 [2019-11-20 08:12:09,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:12:09,317 INFO L225 Difference]: With dead ends: 51203 [2019-11-20 08:12:09,318 INFO L226 Difference]: Without dead ends: 42802 [2019-11-20 08:12:09,337 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=511, Invalid=1211, Unknown=0, NotChecked=0, Total=1722 [2019-11-20 08:12:09,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42802 states. [2019-11-20 08:12:10,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42802 to 18326. [2019-11-20 08:12:10,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18326 states. [2019-11-20 08:12:10,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18326 states to 18326 states and 23685 transitions. [2019-11-20 08:12:10,859 INFO L78 Accepts]: Start accepts. Automaton has 18326 states and 23685 transitions. Word has length 66 [2019-11-20 08:12:10,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:12:10,859 INFO L462 AbstractCegarLoop]: Abstraction has 18326 states and 23685 transitions. [2019-11-20 08:12:10,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 08:12:10,859 INFO L276 IsEmpty]: Start isEmpty. Operand 18326 states and 23685 transitions. [2019-11-20 08:12:10,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-20 08:12:10,863 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:12:10,863 INFO L410 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] [2019-11-20 08:12:11,066 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:12:11,067 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:12:11,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:12:11,067 INFO L82 PathProgramCache]: Analyzing trace with hash -115260524, now seen corresponding path program 1 times [2019-11-20 08:12:11,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:12:11,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631208986] [2019-11-20 08:12:11,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:12:11,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:12:11,138 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-20 08:12:11,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631208986] [2019-11-20 08:12:11,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:12:11,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 08:12:11,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245326435] [2019-11-20 08:12:11,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 08:12:11,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:12:11,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 08:12:11,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-20 08:12:11,141 INFO L87 Difference]: Start difference. First operand 18326 states and 23685 transitions. Second operand 6 states. [2019-11-20 08:12:12,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:12:12,540 INFO L93 Difference]: Finished difference Result 35337 states and 45741 transitions. [2019-11-20 08:12:12,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 08:12:12,541 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-11-20 08:12:12,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:12:12,559 INFO L225 Difference]: With dead ends: 35337 [2019-11-20 08:12:12,560 INFO L226 Difference]: Without dead ends: 23246 [2019-11-20 08:12:12,572 INFO L630 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-20 08:12:12,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23246 states. [2019-11-20 08:12:13,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23246 to 18326. [2019-11-20 08:12:13,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18326 states. [2019-11-20 08:12:13,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18326 states to 18326 states and 23446 transitions. [2019-11-20 08:12:13,832 INFO L78 Accepts]: Start accepts. Automaton has 18326 states and 23446 transitions. Word has length 67 [2019-11-20 08:12:13,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:12:13,832 INFO L462 AbstractCegarLoop]: Abstraction has 18326 states and 23446 transitions. [2019-11-20 08:12:13,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 08:12:13,833 INFO L276 IsEmpty]: Start isEmpty. Operand 18326 states and 23446 transitions. [2019-11-20 08:12:13,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-20 08:12:13,836 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:12:13,837 INFO L410 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] [2019-11-20 08:12:13,837 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:12:13,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:12:13,837 INFO L82 PathProgramCache]: Analyzing trace with hash 782132754, now seen corresponding path program 1 times [2019-11-20 08:12:13,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:12:13,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272471626] [2019-11-20 08:12:13,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:12:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:12:13,894 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-20 08:12:13,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272471626] [2019-11-20 08:12:13,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:12:13,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 08:12:13,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569726331] [2019-11-20 08:12:13,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 08:12:13,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:12:13,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 08:12:13,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:12:13,897 INFO L87 Difference]: Start difference. First operand 18326 states and 23446 transitions. Second operand 5 states. [2019-11-20 08:12:15,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:12:15,328 INFO L93 Difference]: Finished difference Result 26712 states and 34559 transitions. [2019-11-20 08:12:15,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 08:12:15,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-20 08:12:15,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:12:15,347 INFO L225 Difference]: With dead ends: 26712 [2019-11-20 08:12:15,348 INFO L226 Difference]: Without dead ends: 23637 [2019-11-20 08:12:15,355 INFO L630 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-20 08:12:15,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23637 states. [2019-11-20 08:12:16,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23637 to 21145. [2019-11-20 08:12:16,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21145 states. [2019-11-20 08:12:16,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21145 states to 21145 states and 27061 transitions. [2019-11-20 08:12:16,890 INFO L78 Accepts]: Start accepts. Automaton has 21145 states and 27061 transitions. Word has length 67 [2019-11-20 08:12:16,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:12:16,890 INFO L462 AbstractCegarLoop]: Abstraction has 21145 states and 27061 transitions. [2019-11-20 08:12:16,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 08:12:16,891 INFO L276 IsEmpty]: Start isEmpty. Operand 21145 states and 27061 transitions. [2019-11-20 08:12:16,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-20 08:12:16,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:12:16,894 INFO L410 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] [2019-11-20 08:12:16,894 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:12:16,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:12:16,894 INFO L82 PathProgramCache]: Analyzing trace with hash -288063876, now seen corresponding path program 1 times [2019-11-20 08:12:16,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:12:16,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66054968] [2019-11-20 08:12:16,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:12:16,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:12:16,955 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-20 08:12:16,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66054968] [2019-11-20 08:12:16,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:12:16,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 08:12:16,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793494894] [2019-11-20 08:12:16,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 08:12:16,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:12:16,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 08:12:16,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:12:16,957 INFO L87 Difference]: Start difference. First operand 21145 states and 27061 transitions. Second operand 5 states. [2019-11-20 08:12:18,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:12:18,684 INFO L93 Difference]: Finished difference Result 31305 states and 40467 transitions. [2019-11-20 08:12:18,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 08:12:18,684 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-11-20 08:12:18,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:12:18,708 INFO L225 Difference]: With dead ends: 31305 [2019-11-20 08:12:18,708 INFO L226 Difference]: Without dead ends: 27242 [2019-11-20 08:12:18,716 INFO L630 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-20 08:12:18,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27242 states. [2019-11-20 08:12:20,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27242 to 24739. [2019-11-20 08:12:20,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24739 states. [2019-11-20 08:12:20,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24739 states to 24739 states and 31664 transitions. [2019-11-20 08:12:20,273 INFO L78 Accepts]: Start accepts. Automaton has 24739 states and 31664 transitions. Word has length 67 [2019-11-20 08:12:20,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:12:20,273 INFO L462 AbstractCegarLoop]: Abstraction has 24739 states and 31664 transitions. [2019-11-20 08:12:20,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 08:12:20,274 INFO L276 IsEmpty]: Start isEmpty. Operand 24739 states and 31664 transitions. [2019-11-20 08:12:20,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-20 08:12:20,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:12:20,279 INFO L410 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-20 08:12:20,279 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:12:20,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:12:20,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1835762487, now seen corresponding path program 1 times [2019-11-20 08:12:20,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:12:20,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056882789] [2019-11-20 08:12:20,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:12:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:12:20,468 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-20 08:12:20,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056882789] [2019-11-20 08:12:20,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [978645769] [2019-11-20 08:12:20,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea833a61-ea57-4621-8f11-d4acb052e7a9/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:12:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:12:20,565 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 08:12:20,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:12:20,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:12:20,895 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-20 08:12:20,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:12:20,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-20 08:12:20,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236016440] [2019-11-20 08:12:20,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-20 08:12:20,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:12:20,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-20 08:12:20,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-11-20 08:12:20,897 INFO L87 Difference]: Start difference. First operand 24739 states and 31664 transitions. Second operand 17 states. [2019-11-20 08:12:26,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:12:26,680 INFO L93 Difference]: Finished difference Result 82359 states and 104948 transitions. [2019-11-20 08:12:26,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-20 08:12:26,680 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 71 [2019-11-20 08:12:26,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:12:26,737 INFO L225 Difference]: With dead ends: 82359 [2019-11-20 08:12:26,737 INFO L226 Difference]: Without dead ends: 63877 [2019-11-20 08:12:26,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 63 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 324 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=441, Invalid=1199, Unknown=0, NotChecked=0, Total=1640 [2019-11-20 08:12:26,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63877 states. [2019-11-20 08:12:29,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63877 to 38537. [2019-11-20 08:12:29,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38537 states. [2019-11-20 08:12:29,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38537 states to 38537 states and 49263 transitions. [2019-11-20 08:12:29,443 INFO L78 Accepts]: Start accepts. Automaton has 38537 states and 49263 transitions. Word has length 71 [2019-11-20 08:12:29,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:12:29,444 INFO L462 AbstractCegarLoop]: Abstraction has 38537 states and 49263 transitions. [2019-11-20 08:12:29,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-20 08:12:29,444 INFO L276 IsEmpty]: Start isEmpty. Operand 38537 states and 49263 transitions. [2019-11-20 08:12:29,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-20 08:12:29,449 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:12:29,449 INFO L410 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-20 08:12:29,653 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:12:29,653 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:12:29,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:12:29,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1408416423, now seen corresponding path program 1 times [2019-11-20 08:12:29,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:12:29,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328316518] [2019-11-20 08:12:29,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:12:29,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:12:29,812 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-20 08:12:29,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328316518] [2019-11-20 08:12:29,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864655827] [2019-11-20 08:12:29,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea833a61-ea57-4621-8f11-d4acb052e7a9/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:12:29,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:12:29,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-20 08:12:29,902 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:12:30,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:12:30,967 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-20 08:12:30,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:12:30,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 20 [2019-11-20 08:12:30,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556706473] [2019-11-20 08:12:30,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-20 08:12:30,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:12:30,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-20 08:12:30,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2019-11-20 08:12:30,969 INFO L87 Difference]: Start difference. First operand 38537 states and 49263 transitions. Second operand 20 states. [2019-11-20 08:12:31,435 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-11-20 08:12:31,639 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-11-20 08:12:31,908 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-11-20 08:12:32,237 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 78 [2019-11-20 08:12:32,477 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-11-20 08:12:32,896 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-11-20 08:12:33,361 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-11-20 08:12:33,607 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-11-20 08:12:33,882 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-11-20 08:12:34,126 WARN L191 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-11-20 08:12:34,394 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-11-20 08:12:34,708 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2019-11-20 08:12:35,019 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-11-20 08:12:35,351 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2019-11-20 08:12:35,667 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-11-20 08:12:35,940 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-11-20 08:12:36,211 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-11-20 08:12:36,446 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-11-20 08:12:36,868 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-11-20 08:12:37,188 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-11-20 08:12:37,531 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2019-11-20 08:12:37,785 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-11-20 08:12:38,089 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-11-20 08:12:38,353 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-11-20 08:12:38,636 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-11-20 08:12:38,896 WARN L191 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-11-20 08:12:39,226 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-11-20 08:12:39,605 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-11-20 08:12:40,079 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-11-20 08:12:40,403 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-11-20 08:12:40,859 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-11-20 08:12:41,179 WARN L191 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-11-20 08:12:41,718 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-11-20 08:12:41,988 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-11-20 08:12:43,022 WARN L191 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2019-11-20 08:12:43,513 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-11-20 08:12:43,833 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-11-20 08:12:44,134 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-11-20 08:12:44,440 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-11-20 08:12:44,775 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 81 [2019-11-20 08:12:45,118 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2019-11-20 08:12:45,403 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-11-20 08:12:45,849 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-11-20 08:12:46,244 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-11-20 08:12:46,557 WARN L191 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 81 [2019-11-20 08:12:46,961 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 84 [2019-11-20 08:12:47,274 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-11-20 08:12:47,580 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-11-20 08:12:47,903 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-11-20 08:12:48,209 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2019-11-20 08:12:48,444 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-20 08:12:48,601 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-11-20 08:12:49,013 WARN L191 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-11-20 08:12:49,522 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2019-11-20 08:12:49,816 WARN L191 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 77 [2019-11-20 08:12:50,039 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-20 08:12:50,238 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-11-20 08:12:50,406 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-20 08:12:50,658 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-11-20 08:12:50,838 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-11-20 08:12:51,349 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-11-20 08:12:51,600 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-11-20 08:12:51,797 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-11-20 08:12:51,976 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-11-20 08:12:52,361 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-11-20 08:12:52,595 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-11-20 08:12:53,127 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-11-20 08:12:53,366 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-11-20 08:12:53,537 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-11-20 08:12:53,719 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-20 08:12:53,901 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-11-20 08:12:54,127 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-11-20 08:12:54,479 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 70 [2019-11-20 08:12:54,665 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 67 [2019-11-20 08:12:54,847 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-11-20 08:12:55,047 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-11-20 08:12:55,568 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-11-20 08:12:55,818 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2019-11-20 08:12:56,003 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-11-20 08:12:56,283 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-11-20 08:12:56,564 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-11-20 08:12:56,886 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-20 08:12:57,081 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-11-20 08:12:57,442 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-11-20 08:12:58,046 WARN L191 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2019-11-20 08:12:58,476 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2019-11-20 08:12:59,771 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-11-20 08:13:00,639 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-11-20 08:13:01,168 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-11-20 08:13:01,438 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-11-20 08:13:01,738 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-11-20 08:13:02,228 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-11-20 08:13:02,606 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-11-20 08:13:02,760 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-11-20 08:13:02,938 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-20 08:13:03,223 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-11-20 08:13:03,536 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-11-20 08:13:04,023 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-11-20 08:13:04,383 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-11-20 08:13:04,531 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-11-20 08:13:04,871 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-11-20 08:13:05,075 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-11-20 08:13:06,050 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-11-20 08:13:06,262 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-11-20 08:13:06,403 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-11-20 08:13:06,844 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-11-20 08:13:09,523 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 42 [2019-11-20 08:13:11,171 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-11-20 08:13:11,703 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-11-20 08:13:12,329 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-11-20 08:13:12,603 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-20 08:13:12,989 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-11-20 08:13:13,157 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-11-20 08:13:14,731 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-11-20 08:13:15,274 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-11-20 08:13:15,949 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-11-20 08:13:16,371 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-11-20 08:13:18,186 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-11-20 08:13:18,467 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-11-20 08:13:18,794 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-20 08:13:19,085 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-11-20 08:13:19,707 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-11-20 08:13:20,155 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-11-20 08:13:20,425 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-11-20 08:13:20,714 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-11-20 08:13:25,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:13:25,452 INFO L93 Difference]: Finished difference Result 186776 states and 235916 transitions. [2019-11-20 08:13:25,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2019-11-20 08:13:25,454 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 71 [2019-11-20 08:13:25,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:13:25,590 INFO L225 Difference]: With dead ends: 186776 [2019-11-20 08:13:25,590 INFO L226 Difference]: Without dead ends: 150086 [2019-11-20 08:13:25,632 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 49 SyntacticMatches, 13 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18429 ImplicationChecksByTransitivity, 34.5s TimeCoverageRelationStatistics Valid=6752, Invalid=31860, Unknown=0, NotChecked=0, Total=38612 [2019-11-20 08:13:25,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150086 states. [2019-11-20 08:13:30,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150086 to 45843. [2019-11-20 08:13:30,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45843 states. [2019-11-20 08:13:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45843 states to 45843 states and 58976 transitions. [2019-11-20 08:13:30,896 INFO L78 Accepts]: Start accepts. Automaton has 45843 states and 58976 transitions. Word has length 71 [2019-11-20 08:13:30,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:13:30,897 INFO L462 AbstractCegarLoop]: Abstraction has 45843 states and 58976 transitions. [2019-11-20 08:13:30,897 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-20 08:13:30,897 INFO L276 IsEmpty]: Start isEmpty. Operand 45843 states and 58976 transitions. [2019-11-20 08:13:30,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-20 08:13:30,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:13:30,902 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:13:31,102 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:13:31,102 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:13:31,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:13:31,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1332904799, now seen corresponding path program 1 times [2019-11-20 08:13:31,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:13:31,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690928471] [2019-11-20 08:13:31,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:13:31,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:13:31,147 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-20 08:13:31,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690928471] [2019-11-20 08:13:31,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:13:31,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:13:31,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196076648] [2019-11-20 08:13:31,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:13:31,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:13:31,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:13:31,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:13:31,149 INFO L87 Difference]: Start difference. First operand 45843 states and 58976 transitions. Second operand 3 states. [2019-11-20 08:13:35,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:13:35,628 INFO L93 Difference]: Finished difference Result 59658 states and 76466 transitions. [2019-11-20 08:13:35,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:13:35,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-20 08:13:35,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:13:35,662 INFO L225 Difference]: With dead ends: 59658 [2019-11-20 08:13:35,662 INFO L226 Difference]: Without dead ends: 43140 [2019-11-20 08:13:35,676 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:13:35,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43140 states. [2019-11-20 08:13:40,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43140 to 43138. [2019-11-20 08:13:40,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43138 states. [2019-11-20 08:13:40,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43138 states to 43138 states and 54503 transitions. [2019-11-20 08:13:40,238 INFO L78 Accepts]: Start accepts. Automaton has 43138 states and 54503 transitions. Word has length 72 [2019-11-20 08:13:40,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:13:40,238 INFO L462 AbstractCegarLoop]: Abstraction has 43138 states and 54503 transitions. [2019-11-20 08:13:40,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:13:40,238 INFO L276 IsEmpty]: Start isEmpty. Operand 43138 states and 54503 transitions. [2019-11-20 08:13:40,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 08:13:40,243 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:13:40,243 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:13:40,243 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:13:40,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:13:40,243 INFO L82 PathProgramCache]: Analyzing trace with hash 352856353, now seen corresponding path program 1 times [2019-11-20 08:13:40,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:13:40,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145707093] [2019-11-20 08:13:40,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:13:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:13:40,276 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 08:13:40,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145707093] [2019-11-20 08:13:40,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:13:40,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:13:40,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431906676] [2019-11-20 08:13:40,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:13:40,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:13:40,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:13:40,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:13:40,278 INFO L87 Difference]: Start difference. First operand 43138 states and 54503 transitions. Second operand 3 states. [2019-11-20 08:13:48,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:13:48,505 INFO L93 Difference]: Finished difference Result 83640 states and 105561 transitions. [2019-11-20 08:13:48,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:13:48,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-20 08:13:48,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:13:48,563 INFO L225 Difference]: With dead ends: 83640 [2019-11-20 08:13:48,564 INFO L226 Difference]: Without dead ends: 67935 [2019-11-20 08:13:48,577 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:13:48,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67935 states. [2019-11-20 08:13:53,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67935 to 50308. [2019-11-20 08:13:53,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50308 states. [2019-11-20 08:13:54,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50308 states to 50308 states and 63327 transitions. [2019-11-20 08:13:54,011 INFO L78 Accepts]: Start accepts. Automaton has 50308 states and 63327 transitions. Word has length 73 [2019-11-20 08:13:54,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:13:54,011 INFO L462 AbstractCegarLoop]: Abstraction has 50308 states and 63327 transitions. [2019-11-20 08:13:54,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:13:54,011 INFO L276 IsEmpty]: Start isEmpty. Operand 50308 states and 63327 transitions. [2019-11-20 08:13:54,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 08:13:54,015 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:13:54,016 INFO L410 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, 1] [2019-11-20 08:13:54,016 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:13:54,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:13:54,016 INFO L82 PathProgramCache]: Analyzing trace with hash -206354484, now seen corresponding path program 1 times [2019-11-20 08:13:54,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:13:54,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733545153] [2019-11-20 08:13:54,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:13:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:13:54,064 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-20 08:13:54,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733545153] [2019-11-20 08:13:54,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:13:54,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:13:54,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351843067] [2019-11-20 08:13:54,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:13:54,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:13:54,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:13:54,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:13:54,067 INFO L87 Difference]: Start difference. First operand 50308 states and 63327 transitions. Second operand 3 states. [2019-11-20 08:13:58,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:13:58,949 INFO L93 Difference]: Finished difference Result 96302 states and 120522 transitions. [2019-11-20 08:13:58,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:13:58,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-20 08:13:58,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:13:59,003 INFO L225 Difference]: With dead ends: 96302 [2019-11-20 08:13:59,003 INFO L226 Difference]: Without dead ends: 46055 [2019-11-20 08:13:59,024 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:13:59,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46055 states. [2019-11-20 08:14:04,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46055 to 45150. [2019-11-20 08:14:04,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45150 states. [2019-11-20 08:14:04,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45150 states to 45150 states and 55173 transitions. [2019-11-20 08:14:04,727 INFO L78 Accepts]: Start accepts. Automaton has 45150 states and 55173 transitions. Word has length 73 [2019-11-20 08:14:04,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:14:04,728 INFO L462 AbstractCegarLoop]: Abstraction has 45150 states and 55173 transitions. [2019-11-20 08:14:04,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:14:04,728 INFO L276 IsEmpty]: Start isEmpty. Operand 45150 states and 55173 transitions. [2019-11-20 08:14:04,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 08:14:04,731 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:14:04,731 INFO L410 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-20 08:14:04,732 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:14:04,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:14:04,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1268057689, now seen corresponding path program 1 times [2019-11-20 08:14:04,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:14:04,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705745986] [2019-11-20 08:14:04,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:14:04,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:14:05,328 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-20 08:14:05,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705745986] [2019-11-20 08:14:05,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725752939] [2019-11-20 08:14:05,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea833a61-ea57-4621-8f11-d4acb052e7a9/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:14:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:14:05,432 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-20 08:14:05,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:14:07,004 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-20 08:14:07,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:14:07,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43 [2019-11-20 08:14:07,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943711517] [2019-11-20 08:14:07,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-20 08:14:07,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:14:07,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-20 08:14:07,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1612, Unknown=0, NotChecked=0, Total=1806 [2019-11-20 08:14:07,006 INFO L87 Difference]: Start difference. First operand 45150 states and 55173 transitions. Second operand 43 states. [2019-11-20 08:14:07,155 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 69 [2019-11-20 08:14:26,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:14:26,218 INFO L93 Difference]: Finished difference Result 139429 states and 170741 transitions. [2019-11-20 08:14:26,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-11-20 08:14:26,219 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 73 [2019-11-20 08:14:26,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:14:26,311 INFO L225 Difference]: With dead ends: 139429 [2019-11-20 08:14:26,311 INFO L226 Difference]: Without dead ends: 122575 [2019-11-20 08:14:26,325 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1689 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1021, Invalid=5459, Unknown=0, NotChecked=0, Total=6480 [2019-11-20 08:14:26,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122575 states. [2019-11-20 08:14:32,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122575 to 52406. [2019-11-20 08:14:32,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52406 states. [2019-11-20 08:14:32,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52406 states to 52406 states and 63822 transitions. [2019-11-20 08:14:32,270 INFO L78 Accepts]: Start accepts. Automaton has 52406 states and 63822 transitions. Word has length 73 [2019-11-20 08:14:32,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:14:32,270 INFO L462 AbstractCegarLoop]: Abstraction has 52406 states and 63822 transitions. [2019-11-20 08:14:32,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-20 08:14:32,270 INFO L276 IsEmpty]: Start isEmpty. Operand 52406 states and 63822 transitions. [2019-11-20 08:14:32,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 08:14:32,273 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:14:32,273 INFO L410 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-20 08:14:32,473 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:14:32,474 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:14:32,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:14:32,474 INFO L82 PathProgramCache]: Analyzing trace with hash -608526167, now seen corresponding path program 1 times [2019-11-20 08:14:32,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:14:32,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835968061] [2019-11-20 08:14:32,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:14:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:14:32,554 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-20 08:14:32,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835968061] [2019-11-20 08:14:32,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:14:32,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 08:14:32,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914043766] [2019-11-20 08:14:32,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-20 08:14:32,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:14:32,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-20 08:14:32,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-20 08:14:32,556 INFO L87 Difference]: Start difference. First operand 52406 states and 63822 transitions. Second operand 7 states. [2019-11-20 08:14:42,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:14:42,021 INFO L93 Difference]: Finished difference Result 138473 states and 168372 transitions. [2019-11-20 08:14:42,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 08:14:42,021 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-11-20 08:14:42,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:14:42,086 INFO L225 Difference]: With dead ends: 138473 [2019-11-20 08:14:42,086 INFO L226 Difference]: Without dead ends: 86129 [2019-11-20 08:14:42,103 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-11-20 08:14:42,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86129 states. [2019-11-20 08:14:51,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86129 to 85389. [2019-11-20 08:14:51,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85389 states. [2019-11-20 08:14:51,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85389 states to 85389 states and 103031 transitions. [2019-11-20 08:14:51,675 INFO L78 Accepts]: Start accepts. Automaton has 85389 states and 103031 transitions. Word has length 73 [2019-11-20 08:14:51,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:14:51,676 INFO L462 AbstractCegarLoop]: Abstraction has 85389 states and 103031 transitions. [2019-11-20 08:14:51,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-20 08:14:51,676 INFO L276 IsEmpty]: Start isEmpty. Operand 85389 states and 103031 transitions. [2019-11-20 08:14:51,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-20 08:14:51,678 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:14:51,678 INFO L410 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-20 08:14:51,678 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:14:51,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:14:51,679 INFO L82 PathProgramCache]: Analyzing trace with hash 2129516329, now seen corresponding path program 1 times [2019-11-20 08:14:51,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:14:51,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266642024] [2019-11-20 08:14:51,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:14:51,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:14:51,742 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-20 08:14:51,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266642024] [2019-11-20 08:14:51,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:14:51,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 08:14:51,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997961066] [2019-11-20 08:14:51,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 08:14:51,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:14:51,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 08:14:51,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-20 08:14:51,744 INFO L87 Difference]: Start difference. First operand 85389 states and 103031 transitions. Second operand 6 states. [2019-11-20 08:15:00,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:15:00,507 INFO L93 Difference]: Finished difference Result 128976 states and 155640 transitions. [2019-11-20 08:15:00,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 08:15:00,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 73 [2019-11-20 08:15:00,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:15:00,568 INFO L225 Difference]: With dead ends: 128976 [2019-11-20 08:15:00,568 INFO L226 Difference]: Without dead ends: 75946 [2019-11-20 08:15:00,584 INFO L630 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-20 08:15:00,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75946 states. [2019-11-20 08:15:08,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75946 to 71784. [2019-11-20 08:15:08,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71784 states. [2019-11-20 08:15:08,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71784 states to 71784 states and 86076 transitions. [2019-11-20 08:15:08,822 INFO L78 Accepts]: Start accepts. Automaton has 71784 states and 86076 transitions. Word has length 73 [2019-11-20 08:15:08,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:15:08,822 INFO L462 AbstractCegarLoop]: Abstraction has 71784 states and 86076 transitions. [2019-11-20 08:15:08,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 08:15:08,822 INFO L276 IsEmpty]: Start isEmpty. Operand 71784 states and 86076 transitions. [2019-11-20 08:15:08,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-20 08:15:08,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:15:08,825 INFO L410 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, 1] [2019-11-20 08:15:08,825 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:15:08,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:15:08,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1111424355, now seen corresponding path program 1 times [2019-11-20 08:15:08,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:15:08,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327682951] [2019-11-20 08:15:08,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:15:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:15:09,726 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-20 08:15:09,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327682951] [2019-11-20 08:15:09,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701222772] [2019-11-20 08:15:09,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea833a61-ea57-4621-8f11-d4acb052e7a9/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:15:09,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:15:09,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 43 conjunts are in the unsatisfiable core [2019-11-20 08:15:09,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:15:10,700 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-20 08:15:10,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:15:10,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 35 [2019-11-20 08:15:10,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944069098] [2019-11-20 08:15:10,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-11-20 08:15:10,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:15:10,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-11-20 08:15:10,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=1051, Unknown=0, NotChecked=0, Total=1190 [2019-11-20 08:15:10,701 INFO L87 Difference]: Start difference. First operand 71784 states and 86076 transitions. Second operand 35 states. [2019-11-20 08:15:13,014 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 46 [2019-11-20 08:15:17,060 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 51 [2019-11-20 08:15:17,705 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2019-11-20 08:15:17,926 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 58 [2019-11-20 08:15:18,430 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 55 [2019-11-20 08:15:23,559 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-11-20 08:15:23,823 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 44 [2019-11-20 08:15:25,174 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 50 [2019-11-20 08:15:27,331 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2019-11-20 08:15:27,490 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 47 [2019-11-20 08:15:28,808 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 48 [2019-11-20 08:15:45,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:15:45,089 INFO L93 Difference]: Finished difference Result 168753 states and 202210 transitions. [2019-11-20 08:15:45,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-11-20 08:15:45,089 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 74 [2019-11-20 08:15:45,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:15:45,216 INFO L225 Difference]: With dead ends: 168753 [2019-11-20 08:15:45,216 INFO L226 Difference]: Without dead ends: 156340 [2019-11-20 08:15:45,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7786 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=4055, Invalid=21385, Unknown=0, NotChecked=0, Total=25440 [2019-11-20 08:15:45,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156340 states. [2019-11-20 08:15:55,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156340 to 80967. [2019-11-20 08:15:55,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80967 states. [2019-11-20 08:15:55,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80967 states to 80967 states and 97221 transitions. [2019-11-20 08:15:55,177 INFO L78 Accepts]: Start accepts. Automaton has 80967 states and 97221 transitions. Word has length 74 [2019-11-20 08:15:55,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:15:55,177 INFO L462 AbstractCegarLoop]: Abstraction has 80967 states and 97221 transitions. [2019-11-20 08:15:55,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-11-20 08:15:55,177 INFO L276 IsEmpty]: Start isEmpty. Operand 80967 states and 97221 transitions. [2019-11-20 08:15:55,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-20 08:15:55,187 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:15:55,188 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:15:55,390 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:15:55,391 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:15:55,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:15:55,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1752017977, now seen corresponding path program 1 times [2019-11-20 08:15:55,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:15:55,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980559899] [2019-11-20 08:15:55,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:15:55,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:15:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 08:15:55,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980559899] [2019-11-20 08:15:55,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:15:55,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:15:55,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102243927] [2019-11-20 08:15:55,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:15:55,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:15:55,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:15:55,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:15:55,450 INFO L87 Difference]: Start difference. First operand 80967 states and 97221 transitions. Second operand 3 states. [2019-11-20 08:15:59,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:15:59,941 INFO L93 Difference]: Finished difference Result 119219 states and 143565 transitions. [2019-11-20 08:15:59,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:15:59,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-20 08:15:59,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:15:59,972 INFO L225 Difference]: With dead ends: 119219 [2019-11-20 08:15:59,972 INFO L226 Difference]: Without dead ends: 38304 [2019-11-20 08:15:59,997 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:16:00,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38304 states. [2019-11-20 08:16:04,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38304 to 35625. [2019-11-20 08:16:04,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35625 states. [2019-11-20 08:16:04,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35625 states to 35625 states and 42378 transitions. [2019-11-20 08:16:04,243 INFO L78 Accepts]: Start accepts. Automaton has 35625 states and 42378 transitions. Word has length 106 [2019-11-20 08:16:04,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:16:04,243 INFO L462 AbstractCegarLoop]: Abstraction has 35625 states and 42378 transitions. [2019-11-20 08:16:04,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:16:04,244 INFO L276 IsEmpty]: Start isEmpty. Operand 35625 states and 42378 transitions. [2019-11-20 08:16:04,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-20 08:16:04,248 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:16:04,248 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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, 1, 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-20 08:16:04,248 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:16:04,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:16:04,248 INFO L82 PathProgramCache]: Analyzing trace with hash -644127003, now seen corresponding path program 1 times [2019-11-20 08:16:04,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:16:04,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123939722] [2019-11-20 08:16:04,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:16:04,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:16:04,366 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 9 proven. 67 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-20 08:16:04,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123939722] [2019-11-20 08:16:04,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333754998] [2019-11-20 08:16:04,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea833a61-ea57-4621-8f11-d4acb052e7a9/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:16:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:16:04,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 409 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 08:16:04,465 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:16:04,541 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 9 proven. 67 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-20 08:16:04,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:16:04,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 8 [2019-11-20 08:16:04,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380140062] [2019-11-20 08:16:04,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 08:16:04,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:16:04,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 08:16:04,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-20 08:16:04,544 INFO L87 Difference]: Start difference. First operand 35625 states and 42378 transitions. Second operand 8 states. [2019-11-20 08:16:12,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:16:12,533 INFO L93 Difference]: Finished difference Result 89878 states and 107665 transitions. [2019-11-20 08:16:12,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 08:16:12,534 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 107 [2019-11-20 08:16:12,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:16:12,581 INFO L225 Difference]: With dead ends: 89878 [2019-11-20 08:16:12,581 INFO L226 Difference]: Without dead ends: 66914 [2019-11-20 08:16:12,590 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-20 08:16:12,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66914 states. [2019-11-20 08:16:18,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66914 to 54316. [2019-11-20 08:16:18,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54316 states. [2019-11-20 08:16:18,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54316 states to 54316 states and 63835 transitions. [2019-11-20 08:16:18,999 INFO L78 Accepts]: Start accepts. Automaton has 54316 states and 63835 transitions. Word has length 107 [2019-11-20 08:16:18,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:16:18,999 INFO L462 AbstractCegarLoop]: Abstraction has 54316 states and 63835 transitions. [2019-11-20 08:16:18,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 08:16:19,000 INFO L276 IsEmpty]: Start isEmpty. Operand 54316 states and 63835 transitions. [2019-11-20 08:16:19,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-20 08:16:19,007 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:16:19,008 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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, 1, 1] [2019-11-20 08:16:19,209 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:16:19,210 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:16:19,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:16:19,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1039674402, now seen corresponding path program 1 times [2019-11-20 08:16:19,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:16:19,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264201883] [2019-11-20 08:16:19,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:16:19,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:16:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-20 08:16:19,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264201883] [2019-11-20 08:16:19,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:16:19,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 08:16:19,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082792013] [2019-11-20 08:16:19,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 08:16:19,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:16:19,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 08:16:19,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:16:19,262 INFO L87 Difference]: Start difference. First operand 54316 states and 63835 transitions. Second operand 3 states. [2019-11-20 08:16:21,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:16:21,732 INFO L93 Difference]: Finished difference Result 72117 states and 84972 transitions. [2019-11-20 08:16:21,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 08:16:21,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-11-20 08:16:21,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:16:21,746 INFO L225 Difference]: With dead ends: 72117 [2019-11-20 08:16:21,746 INFO L226 Difference]: Without dead ends: 17855 [2019-11-20 08:16:21,764 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 08:16:21,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17855 states. [2019-11-20 08:16:24,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17855 to 17853. [2019-11-20 08:16:24,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17853 states. [2019-11-20 08:16:24,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17853 states to 17853 states and 20797 transitions. [2019-11-20 08:16:24,099 INFO L78 Accepts]: Start accepts. Automaton has 17853 states and 20797 transitions. Word has length 117 [2019-11-20 08:16:24,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:16:24,100 INFO L462 AbstractCegarLoop]: Abstraction has 17853 states and 20797 transitions. [2019-11-20 08:16:24,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 08:16:24,100 INFO L276 IsEmpty]: Start isEmpty. Operand 17853 states and 20797 transitions. [2019-11-20 08:16:24,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-20 08:16:24,103 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:16:24,103 INFO L410 BasicCegarLoop]: trace histogram [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, 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-20 08:16:24,103 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:16:24,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:16:24,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1598565810, now seen corresponding path program 1 times [2019-11-20 08:16:24,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:16:24,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712723121] [2019-11-20 08:16:24,104 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:16:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:16:24,454 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 24 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:16:24,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712723121] [2019-11-20 08:16:24,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077542069] [2019-11-20 08:16:24,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea833a61-ea57-4621-8f11-d4acb052e7a9/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:16:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:16:24,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 08:16:24,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:16:24,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:16:24,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:16:24,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:16:24,738 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:16:24,943 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 55 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 08:16:24,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:16:24,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 26 [2019-11-20 08:16:24,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646050403] [2019-11-20 08:16:24,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-20 08:16:24,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:16:24,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-20 08:16:24,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=584, Unknown=0, NotChecked=0, Total=650 [2019-11-20 08:16:24,946 INFO L87 Difference]: Start difference. First operand 17853 states and 20797 transitions. Second operand 26 states. [2019-11-20 08:16:37,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:16:37,591 INFO L93 Difference]: Finished difference Result 30953 states and 36156 transitions. [2019-11-20 08:16:37,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2019-11-20 08:16:37,591 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 118 [2019-11-20 08:16:37,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:16:37,607 INFO L225 Difference]: With dead ends: 30953 [2019-11-20 08:16:37,607 INFO L226 Difference]: Without dead ends: 21125 [2019-11-20 08:16:37,614 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3189 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=2098, Invalid=9458, Unknown=0, NotChecked=0, Total=11556 [2019-11-20 08:16:37,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21125 states. [2019-11-20 08:16:39,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21125 to 13908. [2019-11-20 08:16:39,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13908 states. [2019-11-20 08:16:39,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13908 states to 13908 states and 16040 transitions. [2019-11-20 08:16:39,598 INFO L78 Accepts]: Start accepts. Automaton has 13908 states and 16040 transitions. Word has length 118 [2019-11-20 08:16:39,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:16:39,599 INFO L462 AbstractCegarLoop]: Abstraction has 13908 states and 16040 transitions. [2019-11-20 08:16:39,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-20 08:16:39,599 INFO L276 IsEmpty]: Start isEmpty. Operand 13908 states and 16040 transitions. [2019-11-20 08:16:39,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-20 08:16:39,600 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:16:39,600 INFO L410 BasicCegarLoop]: trace histogram [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, 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-20 08:16:39,801 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:16:39,801 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:16:39,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:16:39,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1902876434, now seen corresponding path program 1 times [2019-11-20 08:16:39,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:16:39,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432542130] [2019-11-20 08:16:39,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:16:39,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:16:40,166 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 52 proven. 35 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 08:16:40,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432542130] [2019-11-20 08:16:40,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [596646809] [2019-11-20 08:16:40,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea833a61-ea57-4621-8f11-d4acb052e7a9/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:16:40,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:16:40,263 INFO L255 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 08:16:40,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:16:40,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:16:40,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:16:40,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:16:40,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:16:40,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:16:40,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:16:40,704 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 56 proven. 31 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 08:16:40,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:16:40,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2019-11-20 08:16:40,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81364694] [2019-11-20 08:16:40,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-20 08:16:40,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:16:40,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-20 08:16:40,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2019-11-20 08:16:40,705 INFO L87 Difference]: Start difference. First operand 13908 states and 16040 transitions. Second operand 24 states. [2019-11-20 08:16:45,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:16:45,152 INFO L93 Difference]: Finished difference Result 26008 states and 30140 transitions. [2019-11-20 08:16:45,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-20 08:16:45,153 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 119 [2019-11-20 08:16:45,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:16:45,168 INFO L225 Difference]: With dead ends: 26008 [2019-11-20 08:16:45,168 INFO L226 Difference]: Without dead ends: 20419 [2019-11-20 08:16:45,174 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 309 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=282, Invalid=1610, Unknown=0, NotChecked=0, Total=1892 [2019-11-20 08:16:45,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20419 states. [2019-11-20 08:16:47,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20419 to 16196. [2019-11-20 08:16:47,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16196 states. [2019-11-20 08:16:47,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16196 states to 16196 states and 18628 transitions. [2019-11-20 08:16:47,659 INFO L78 Accepts]: Start accepts. Automaton has 16196 states and 18628 transitions. Word has length 119 [2019-11-20 08:16:47,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:16:47,659 INFO L462 AbstractCegarLoop]: Abstraction has 16196 states and 18628 transitions. [2019-11-20 08:16:47,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-20 08:16:47,659 INFO L276 IsEmpty]: Start isEmpty. Operand 16196 states and 18628 transitions. [2019-11-20 08:16:47,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-20 08:16:47,661 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:16:47,661 INFO L410 BasicCegarLoop]: trace histogram [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, 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-20 08:16:47,861 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:16:47,861 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:16:47,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:16:47,862 INFO L82 PathProgramCache]: Analyzing trace with hash -476239132, now seen corresponding path program 2 times [2019-11-20 08:16:47,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:16:47,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361318156] [2019-11-20 08:16:47,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:16:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:16:48,790 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 16 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:16:48,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361318156] [2019-11-20 08:16:48,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [962659357] [2019-11-20 08:16:48,790 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea833a61-ea57-4621-8f11-d4acb052e7a9/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:16:48,875 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-20 08:16:48,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-20 08:16:48,877 INFO L255 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-20 08:16:48,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:16:49,367 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-20 08:16:49,368 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 08:16:49,368 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [19] total 30 [2019-11-20 08:16:49,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911809484] [2019-11-20 08:16:49,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-20 08:16:49,369 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:16:49,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-20 08:16:49,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2019-11-20 08:16:49,370 INFO L87 Difference]: Start difference. First operand 16196 states and 18628 transitions. Second operand 13 states. [2019-11-20 08:16:53,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:16:53,235 INFO L93 Difference]: Finished difference Result 26416 states and 30453 transitions. [2019-11-20 08:16:53,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-20 08:16:53,235 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 120 [2019-11-20 08:16:53,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:16:53,251 INFO L225 Difference]: With dead ends: 26416 [2019-11-20 08:16:53,251 INFO L226 Difference]: Without dead ends: 20721 [2019-11-20 08:16:53,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=271, Invalid=1621, Unknown=0, NotChecked=0, Total=1892 [2019-11-20 08:16:53,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20721 states. [2019-11-20 08:16:55,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20721 to 15375. [2019-11-20 08:16:55,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15375 states. [2019-11-20 08:16:55,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15375 states to 15375 states and 17657 transitions. [2019-11-20 08:16:55,659 INFO L78 Accepts]: Start accepts. Automaton has 15375 states and 17657 transitions. Word has length 120 [2019-11-20 08:16:55,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:16:55,659 INFO L462 AbstractCegarLoop]: Abstraction has 15375 states and 17657 transitions. [2019-11-20 08:16:55,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-20 08:16:55,659 INFO L276 IsEmpty]: Start isEmpty. Operand 15375 states and 17657 transitions. [2019-11-20 08:16:55,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-20 08:16:55,661 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:16:55,661 INFO L410 BasicCegarLoop]: trace histogram [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, 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-20 08:16:55,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:16:55,862 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:16:55,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:16:55,862 INFO L82 PathProgramCache]: Analyzing trace with hash -961342137, now seen corresponding path program 1 times [2019-11-20 08:16:55,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:16:55,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992704995] [2019-11-20 08:16:55,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:16:55,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:16:56,588 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 16 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:16:56,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992704995] [2019-11-20 08:16:56,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [986147007] [2019-11-20 08:16:56,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea833a61-ea57-4621-8f11-d4acb052e7a9/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:16:56,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:16:56,675 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 26 conjunts are in the unsatisfiable core [2019-11-20 08:16:56,677 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:16:57,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:16:57,134 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:16:57,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:16:57,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:16:58,093 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 27 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:16:58,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:16:58,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 17] total 37 [2019-11-20 08:16:58,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523379258] [2019-11-20 08:16:58,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-20 08:16:58,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:16:58,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-20 08:16:58,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1233, Unknown=0, NotChecked=0, Total=1332 [2019-11-20 08:16:58,095 INFO L87 Difference]: Start difference. First operand 15375 states and 17657 transitions. Second operand 37 states. [2019-11-20 08:16:58,510 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 91 [2019-11-20 08:16:59,950 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-11-20 08:17:00,248 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2019-11-20 08:17:00,975 WARN L191 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-11-20 08:17:01,259 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-11-20 08:17:01,733 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 62 [2019-11-20 08:17:05,796 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-11-20 08:17:08,334 WARN L191 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-11-20 08:17:09,682 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-11-20 08:17:10,327 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-20 08:17:13,136 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-20 08:17:15,588 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-11-20 08:17:26,471 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-11-20 08:17:33,680 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2019-11-20 08:17:34,330 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-11-20 08:17:38,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:17:38,265 INFO L93 Difference]: Finished difference Result 43302 states and 49875 transitions. [2019-11-20 08:17:38,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2019-11-20 08:17:38,265 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 124 [2019-11-20 08:17:38,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:17:38,293 INFO L225 Difference]: With dead ends: 43302 [2019-11-20 08:17:38,293 INFO L226 Difference]: Without dead ends: 38026 [2019-11-20 08:17:38,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 108 SyntacticMatches, 2 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3200 ImplicationChecksByTransitivity, 17.0s TimeCoverageRelationStatistics Valid=1003, Invalid=11207, Unknown=0, NotChecked=0, Total=12210 [2019-11-20 08:17:38,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38026 states. [2019-11-20 08:17:41,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38026 to 18258. [2019-11-20 08:17:41,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18258 states. [2019-11-20 08:17:41,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18258 states to 18258 states and 20930 transitions. [2019-11-20 08:17:41,801 INFO L78 Accepts]: Start accepts. Automaton has 18258 states and 20930 transitions. Word has length 124 [2019-11-20 08:17:41,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:17:41,801 INFO L462 AbstractCegarLoop]: Abstraction has 18258 states and 20930 transitions. [2019-11-20 08:17:41,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-20 08:17:41,801 INFO L276 IsEmpty]: Start isEmpty. Operand 18258 states and 20930 transitions. [2019-11-20 08:17:41,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-20 08:17:41,803 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:17:41,803 INFO L410 BasicCegarLoop]: trace histogram [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, 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-20 08:17:42,004 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:17:42,004 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:17:42,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:17:42,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1842401595, now seen corresponding path program 1 times [2019-11-20 08:17:42,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:17:42,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943055170] [2019-11-20 08:17:42,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:17:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:17:42,610 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 36 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:17:42,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943055170] [2019-11-20 08:17:42,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [153735666] [2019-11-20 08:17:42,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea833a61-ea57-4621-8f11-d4acb052e7a9/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:17:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:17:42,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-20 08:17:42,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:17:42,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:17:42,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:17:42,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:17:42,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:17:43,179 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 34 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:17:43,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:17:43,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 28 [2019-11-20 08:17:43,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113916513] [2019-11-20 08:17:43,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-20 08:17:43,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:17:43,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-20 08:17:43,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2019-11-20 08:17:43,182 INFO L87 Difference]: Start difference. First operand 18258 states and 20930 transitions. Second operand 28 states. [2019-11-20 08:17:58,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:17:58,698 INFO L93 Difference]: Finished difference Result 48216 states and 55297 transitions. [2019-11-20 08:17:58,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2019-11-20 08:17:58,698 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 124 [2019-11-20 08:17:58,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:17:58,728 INFO L225 Difference]: With dead ends: 48216 [2019-11-20 08:17:58,729 INFO L226 Difference]: Without dead ends: 37820 [2019-11-20 08:17:58,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 114 SyntacticMatches, 2 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4442 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1360, Invalid=13160, Unknown=0, NotChecked=0, Total=14520 [2019-11-20 08:17:58,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37820 states. [2019-11-20 08:18:03,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37820 to 24929. [2019-11-20 08:18:03,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24929 states. [2019-11-20 08:18:03,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24929 states to 24929 states and 28686 transitions. [2019-11-20 08:18:03,940 INFO L78 Accepts]: Start accepts. Automaton has 24929 states and 28686 transitions. Word has length 124 [2019-11-20 08:18:03,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:18:03,940 INFO L462 AbstractCegarLoop]: Abstraction has 24929 states and 28686 transitions. [2019-11-20 08:18:03,940 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-20 08:18:03,940 INFO L276 IsEmpty]: Start isEmpty. Operand 24929 states and 28686 transitions. [2019-11-20 08:18:03,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-20 08:18:03,942 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:18:03,943 INFO L410 BasicCegarLoop]: trace histogram [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, 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] [2019-11-20 08:18:04,143 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:18:04,143 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:18:04,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:18:04,144 INFO L82 PathProgramCache]: Analyzing trace with hash -185320499, now seen corresponding path program 1 times [2019-11-20 08:18:04,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:18:04,144 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232700125] [2019-11-20 08:18:04,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:18:04,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:18:04,231 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 08:18:04,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232700125] [2019-11-20 08:18:04,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 08:18:04,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 08:18:04,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828674546] [2019-11-20 08:18:04,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 08:18:04,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:18:04,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 08:18:04,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-20 08:18:04,238 INFO L87 Difference]: Start difference. First operand 24929 states and 28686 transitions. Second operand 5 states. [2019-11-20 08:18:09,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:18:09,412 INFO L93 Difference]: Finished difference Result 43135 states and 49428 transitions. [2019-11-20 08:18:09,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 08:18:09,413 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2019-11-20 08:18:09,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:18:09,430 INFO L225 Difference]: With dead ends: 43135 [2019-11-20 08:18:09,430 INFO L226 Difference]: Without dead ends: 22066 [2019-11-20 08:18:09,435 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-20 08:18:09,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22066 states. [2019-11-20 08:18:13,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22066 to 17273. [2019-11-20 08:18:13,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17273 states. [2019-11-20 08:18:13,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17273 states to 17273 states and 19603 transitions. [2019-11-20 08:18:13,059 INFO L78 Accepts]: Start accepts. Automaton has 17273 states and 19603 transitions. Word has length 124 [2019-11-20 08:18:13,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:18:13,059 INFO L462 AbstractCegarLoop]: Abstraction has 17273 states and 19603 transitions. [2019-11-20 08:18:13,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 08:18:13,060 INFO L276 IsEmpty]: Start isEmpty. Operand 17273 states and 19603 transitions. [2019-11-20 08:18:13,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-20 08:18:13,062 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:18:13,062 INFO L410 BasicCegarLoop]: trace histogram [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, 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-20 08:18:13,062 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:18:13,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:18:13,062 INFO L82 PathProgramCache]: Analyzing trace with hash -2023702185, now seen corresponding path program 1 times [2019-11-20 08:18:13,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:18:13,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778411544] [2019-11-20 08:18:13,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:18:13,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:18:13,776 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 36 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:18:13,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778411544] [2019-11-20 08:18:13,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [973352190] [2019-11-20 08:18:13,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ea833a61-ea57-4621-8f11-d4acb052e7a9/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:18:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 08:18:13,923 INFO L255 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-20 08:18:13,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 08:18:14,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:18:14,748 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:18:14,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:18:15,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 08:18:15,634 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 16 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 08:18:15,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 08:18:15,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 19] total 38 [2019-11-20 08:18:15,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78211182] [2019-11-20 08:18:15,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-20 08:18:15,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 08:18:15,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-20 08:18:15,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1287, Unknown=0, NotChecked=0, Total=1406 [2019-11-20 08:18:15,636 INFO L87 Difference]: Start difference. First operand 17273 states and 19603 transitions. Second operand 38 states. [2019-11-20 08:18:17,305 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-11-20 08:18:17,979 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-11-20 08:18:18,335 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-11-20 08:18:18,645 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-11-20 08:18:19,052 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-11-20 08:18:23,915 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-11-20 08:18:29,444 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-11-20 08:18:37,625 WARN L191 SmtUtils]: Spent 712.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2019-11-20 08:18:38,891 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-11-20 08:18:49,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 08:18:49,078 INFO L93 Difference]: Finished difference Result 37223 states and 42204 transitions. [2019-11-20 08:18:49,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2019-11-20 08:18:49,078 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 124 [2019-11-20 08:18:49,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 08:18:49,102 INFO L225 Difference]: With dead ends: 37223 [2019-11-20 08:18:49,102 INFO L226 Difference]: Without dead ends: 29261 [2019-11-20 08:18:49,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 100 SyntacticMatches, 8 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4197 ImplicationChecksByTransitivity, 20.0s TimeCoverageRelationStatistics Valid=1493, Invalid=13513, Unknown=0, NotChecked=0, Total=15006 [2019-11-20 08:18:49,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29261 states. [2019-11-20 08:18:53,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29261 to 18525. [2019-11-20 08:18:53,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18525 states. [2019-11-20 08:18:53,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18525 states to 18525 states and 20995 transitions. [2019-11-20 08:18:53,176 INFO L78 Accepts]: Start accepts. Automaton has 18525 states and 20995 transitions. Word has length 124 [2019-11-20 08:18:53,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 08:18:53,177 INFO L462 AbstractCegarLoop]: Abstraction has 18525 states and 20995 transitions. [2019-11-20 08:18:53,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-20 08:18:53,177 INFO L276 IsEmpty]: Start isEmpty. Operand 18525 states and 20995 transitions. [2019-11-20 08:18:53,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 08:18:53,180 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 08:18:53,180 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 08:18:53,380 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 08:18:53,381 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 08:18:53,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 08:18:53,381 INFO L82 PathProgramCache]: Analyzing trace with hash -44454481, now seen corresponding path program 2 times [2019-11-20 08:18:53,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 08:18:53,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255987697] [2019-11-20 08:18:53,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 08:18:53,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:18:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 08:18:53,557 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 08:18:53,557 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 08:18:53,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:18:53 BoogieIcfgContainer [2019-11-20 08:18:53,787 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 08:18:53,788 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 08:18:53,788 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 08:18:53,788 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 08:18:53,790 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:11:46" (3/4) ... [2019-11-20 08:18:53,793 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 08:18:54,031 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ea833a61-ea57-4621-8f11-d4acb052e7a9/bin/uautomizer/witness.graphml [2019-11-20 08:18:54,031 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 08:18:54,033 INFO L168 Benchmark]: Toolchain (without parser) took 428322.81 ms. Allocated memory was 1.0 GB in the beginning and 5.8 GB in the end (delta: 4.8 GB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -153.1 MB). Peak memory consumption was 4.7 GB. Max. memory is 11.5 GB. [2019-11-20 08:18:54,033 INFO L168 Benchmark]: CDTParser took 0.22 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-20 08:18:54,034 INFO L168 Benchmark]: CACSL2BoogieTranslator took 438.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -178.9 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2019-11-20 08:18:54,034 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 08:18:54,034 INFO L168 Benchmark]: Boogie Preprocessor took 39.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 08:18:54,035 INFO L168 Benchmark]: RCFGBuilder took 751.75 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.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. [2019-11-20 08:18:54,035 INFO L168 Benchmark]: TraceAbstraction took 426790.00 ms. Allocated memory was 1.2 GB in the beginning and 5.8 GB in the end (delta: 4.7 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -40.1 MB). Peak memory consumption was 4.6 GB. Max. memory is 11.5 GB. [2019-11-20 08:18:54,036 INFO L168 Benchmark]: Witness Printer took 243.58 ms. Allocated memory is still 5.8 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-11-20 08:18:54,047 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 438.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -178.9 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 54.42 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 39.92 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 751.75 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.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 426790.00 ms. Allocated memory was 1.2 GB in the beginning and 5.8 GB in the end (delta: 4.7 GB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -40.1 MB). Peak memory consumption was 4.6 GB. Max. memory is 11.5 GB. * Witness Printer took 243.58 ms. Allocated memory is still 5.8 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 354]: 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] unsigned 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 ; [L199] 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] [L299] int c1 ; [L300] int i2 ; [L303] c1 = 0 [L304] r1 = __VERIFIER_nondet_uchar() [L305] id1 = __VERIFIER_nondet_char() [L306] st1 = __VERIFIER_nondet_char() [L307] send1 = __VERIFIER_nondet_char() [L308] mode1 = __VERIFIER_nondet_bool() [L309] alive1 = __VERIFIER_nondet_bool() [L310] id2 = __VERIFIER_nondet_char() [L311] st2 = __VERIFIER_nondet_char() [L312] send2 = __VERIFIER_nondet_char() [L313] mode2 = __VERIFIER_nondet_bool() [L314] alive2 = __VERIFIER_nondet_bool() [L315] id3 = __VERIFIER_nondet_char() [L316] st3 = __VERIFIER_nondet_char() [L317] send3 = __VERIFIER_nondet_char() [L318] mode3 = __VERIFIER_nondet_bool() [L319] alive3 = __VERIFIER_nondet_bool() [L202] 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] [L205] 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] [L206] 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] [L207] 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] [L208] 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] [L209] 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] [L210] 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] [L211] 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] [L212] 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] [L213] 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] [L214] 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] [L215] 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] [L216] 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] [L217] 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] [L218] 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] [L219] 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] [L220] 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] [L221] COND TRUE (int )id2 != (int )id3 [L222] 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] [L274] 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] [L320] i2 = init() [L322] p1_old = nomsg [L323] p1_new = nomsg [L324] p2_old = nomsg [L325] p2_new = nomsg [L326] p3_old = nomsg [L327] p3_new = nomsg [L328] 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] [L329] COND TRUE 1 [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] [L123] 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] [L126] 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] [L133] msg_t m2 ; [L136] 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] [L137] 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] [L154] 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] [L157] 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] [L160] 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] [L167] msg_t m3 ; [L170] 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] [L171] 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] [L188] 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] [L189] 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] [L189] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L194] 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] [L334] p1_old = p1_new [L335] p1_new = nomsg [L336] p2_old = p2_new [L337] p2_new = nomsg [L338] p3_old = p3_new [L339] p3_new = nomsg [L279] 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] [L282] 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] [L283] COND TRUE (int )r1 < 3 [L284] 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] [L294] 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] [L340] c1 = check() [L352] 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] [L329] COND TRUE 1 [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) 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] [L103] COND FALSE !(r1 == 255) 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] [L106] r1 = r1 + 1 [L107] m1 = p3_old [L108] 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] [L109] 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] [L110] COND FALSE !(\read(alive1)) [L118] 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] [L121] 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] [L133] msg_t m2 ; [L136] 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] [L137] COND TRUE \read(mode2) [L138] m2 = p1_old [L139] 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] [L140] 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] [L152] 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] [L167] msg_t m3 ; [L170] 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] [L171] COND TRUE \read(mode3) [L172] m3 = p2_old [L173] 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] [L174] 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] [L186] 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] [L334] p1_old = p1_new [L335] p1_new = nomsg [L336] p2_old = p2_new [L337] p2_new = nomsg [L338] p3_old = p3_new [L339] p3_new = nomsg [L279] 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] [L282] 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] [L283] COND TRUE (int )r1 < 3 [L284] 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] [L294] 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] [L340] c1 = check() [L352] 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] [L329] COND TRUE 1 [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] [L123] 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] [L126] 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] [L133] msg_t m2 ; [L136] 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] [L137] 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] [L154] 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] [L157] 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] [L160] 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] [L167] msg_t m3 ; [L170] 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] [L171] 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] [L188] 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] [L189] 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] [L189] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L194] 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] [L334] p1_old = p1_new [L335] p1_new = nomsg [L336] p2_old = p2_new [L337] p2_new = nomsg [L338] p3_old = p3_new [L339] p3_new = nomsg [L279] 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] [L282] 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] [L283] COND TRUE (int )r1 < 3 [L284] 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] [L294] 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] [L340] c1 = check() [L352] 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] [L329] COND TRUE 1 [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) 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] [L103] COND FALSE !(r1 == 255) 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] [L106] r1 = r1 + 1 [L107] m1 = p3_old [L108] 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] [L109] 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] [L110] COND FALSE !(\read(alive1)) [L118] 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] [L121] 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] [L133] msg_t m2 ; [L136] 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] [L137] COND TRUE \read(mode2) [L138] m2 = p1_old [L139] 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] [L140] 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] [L152] 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] [L167] msg_t m3 ; [L170] 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] [L171] COND TRUE \read(mode3) [L172] m3 = p2_old [L173] 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] [L174] 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] [L186] 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] [L334] p1_old = p1_new [L335] p1_new = nomsg [L336] p2_old = p2_new [L337] p2_new = nomsg [L338] p3_old = p3_new [L339] p3_new = nomsg [L279] 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] [L282] 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] [L283] COND TRUE (int )r1 < 3 [L284] 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] [L294] 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] [L340] c1 = check() [L352] 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] [L329] COND TRUE 1 [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] [L123] 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] [L126] 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] [L133] msg_t m2 ; [L136] 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] [L137] 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] [L154] 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] [L157] 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] [L160] 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] [L167] msg_t m3 ; [L170] 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] [L171] 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] [L188] 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] [L189] 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] [L189] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L194] 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] [L334] p1_old = p1_new [L335] p1_new = nomsg [L336] p2_old = p2_new [L337] p2_new = nomsg [L338] p3_old = p3_new [L339] p3_new = nomsg [L279] 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] [L282] 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] [L283] COND TRUE (int )r1 < 3 [L284] 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] [L294] 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] [L340] c1 = check() [L352] 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] [L329] COND TRUE 1 [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) 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] [L103] COND FALSE !(r1 == 255) 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] [L106] r1 = r1 + 1 [L107] m1 = p3_old [L108] 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] [L109] 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] [L110] COND FALSE !(\read(alive1)) [L118] 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] [L121] 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] [L133] msg_t m2 ; [L136] 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] [L137] COND TRUE \read(mode2) [L138] m2 = p1_old [L139] 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] [L140] 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] [L152] 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] [L167] msg_t m3 ; [L170] 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] [L171] COND TRUE \read(mode3) [L172] m3 = p2_old [L173] 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] [L174] 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] [L186] 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] [L334] p1_old = p1_new [L335] p1_new = nomsg [L336] p2_old = p2_new [L337] p2_new = nomsg [L338] p3_old = p3_new [L339] p3_new = nomsg [L279] 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] [L282] 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] [L283] 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] [L286] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 1) [L289] 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] [L294] 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] [L340] c1 = check() [L352] 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] [L354] __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, 75 locations, 1 error locations. Result: UNSAFE, OverallTime: 426.6s, OverallIterations: 40, TraceHistogramMax: 6, AutomataDifference: 298.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6526 SDtfs, 32681 SDslu, 60426 SDs, 0 SdLazy, 26456 SolverSat, 1547 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 44.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2515 GetRequests, 1271 SyntacticMatches, 32 SemanticMatches, 1212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45061 ImplicationChecksByTransitivity, 111.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85389occurred in iteration=27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 104.9s AutomataMinimizationTime, 39 MinimizatonAttempts, 434441 StatesRemovedByMinimization, 38 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 15.9s InterpolantComputationTime, 4460 NumberOfCodeBlocks, 4460 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 4257 ConstructedInterpolants, 327 QuantifiedInterpolants, 4816488 SizeOfPredicates, 64 NumberOfNonLiveVariables, 5370 ConjunctsInSsa, 305 ConjunctsInUnsatCore, 54 InterpolantComputations, 25 PerfectInterpolantSequences, 1067/1928 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...