./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f2969d4725852fd68e7759cdb7f1d1929ca0124c ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 22:25:23,727 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:25:23,729 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:25:23,740 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:25:23,740 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:25:23,742 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:25:23,743 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:25:23,745 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:25:23,747 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:25:23,748 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:25:23,749 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:25:23,750 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:25:23,751 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:25:23,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:25:23,753 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:25:23,754 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:25:23,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:25:23,756 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:25:23,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:25:23,759 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:25:23,766 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:25:23,768 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:25:23,771 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:25:23,774 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:25:23,776 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:25:23,779 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:25:23,779 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:25:23,780 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:25:23,782 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:25:23,783 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:25:23,784 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:25:23,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:25:23,786 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:25:23,787 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:25:23,788 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:25:23,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:25:23,791 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:25:23,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:25:23,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:25:23,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:25:23,793 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:25:23,795 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 22:25:23,813 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:25:23,814 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:25:23,815 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:25:23,815 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:25:23,816 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:25:23,816 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:25:23,816 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:25:23,816 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:25:23,817 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:25:23,817 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:25:23,818 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 22:25:23,818 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:25:23,818 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 22:25:23,819 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:25:23,819 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:25:23,819 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:25:23,819 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 22:25:23,820 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:25:23,820 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:25:23,820 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:25:23,820 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:25:23,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:25:23,821 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:25:23,821 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:25:23,821 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 22:25:23,821 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:25:23,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 22:25:23,822 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 22:25:23,822 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_96eb7743-e6d7-4f50-98a9-e46494a822f4/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f2969d4725852fd68e7759cdb7f1d1929ca0124c [2019-11-19 22:25:24,001 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:25:24,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:25:24,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:25:24,016 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:25:24,016 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:25:24,017 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/bin/uautomizer/../../sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2019-11-19 22:25:24,075 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/bin/uautomizer/data/db2e1d742/b73142ceb0f6431da5a685977a4e075a/FLAG0bcce5911 [2019-11-19 22:25:24,498 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:25:24,498 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/sv-benchmarks/c/seq-mthreaded/pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2019-11-19 22:25:24,507 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/bin/uautomizer/data/db2e1d742/b73142ceb0f6431da5a685977a4e075a/FLAG0bcce5911 [2019-11-19 22:25:24,807 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/bin/uautomizer/data/db2e1d742/b73142ceb0f6431da5a685977a4e075a [2019-11-19 22:25:24,810 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:25:24,811 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:25:24,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:25:24,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:25:24,819 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:25:24,820 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:25:24" (1/1) ... [2019-11-19 22:25:24,824 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b503d1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:25:24, skipping insertion in model container [2019-11-19 22:25:24,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:25:24" (1/1) ... [2019-11-19 22:25:24,832 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:25:24,881 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:25:25,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:25:25,169 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:25:25,208 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:25:25,225 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:25:25,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:25:25 WrapperNode [2019-11-19 22:25:25,226 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:25:25,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:25:25,227 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:25:25,227 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:25:25,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:25:25" (1/1) ... [2019-11-19 22:25:25,250 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:25:25" (1/1) ... [2019-11-19 22:25:25,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:25:25,282 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:25:25,282 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:25:25,282 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:25:25,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:25:25" (1/1) ... [2019-11-19 22:25:25,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:25:25" (1/1) ... [2019-11-19 22:25:25,295 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:25:25" (1/1) ... [2019-11-19 22:25:25,295 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:25:25" (1/1) ... [2019-11-19 22:25:25,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:25:25" (1/1) ... [2019-11-19 22:25:25,307 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:25:25" (1/1) ... [2019-11-19 22:25:25,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:25:25" (1/1) ... [2019-11-19 22:25:25,325 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:25:25,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:25:25,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:25:25,325 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:25:25,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:25:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/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-19 22:25:25,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:25:25,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:25:25,886 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:25:25,886 INFO L285 CfgBuilder]: Removed 17 assume(true) statements. [2019-11-19 22:25:25,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:25:25 BoogieIcfgContainer [2019-11-19 22:25:25,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:25:25,889 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:25:25,889 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:25:25,892 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:25:25,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:25:24" (1/3) ... [2019-11-19 22:25:25,893 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49745ab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:25:25, skipping insertion in model container [2019-11-19 22:25:25,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:25:25" (2/3) ... [2019-11-19 22:25:25,894 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49745ab2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:25:25, skipping insertion in model container [2019-11-19 22:25:25,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:25:25" (3/3) ... [2019-11-19 22:25:25,896 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.BOUNDED-6.pals.c [2019-11-19 22:25:25,906 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:25:25,913 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 22:25:25,924 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 22:25:25,948 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:25:25,949 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 22:25:25,949 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:25:25,949 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:25:25,949 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:25:25,949 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:25:25,950 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:25:25,950 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:25:25,966 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2019-11-19 22:25:25,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 22:25:25,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:25:25,975 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-19 22:25:25,975 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:25:25,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:25,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1524648029, now seen corresponding path program 1 times [2019-11-19 22:25:25,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:25,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318371881] [2019-11-19 22:25:25,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:26,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:26,198 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-19 22:25:26,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318371881] [2019-11-19 22:25:26,200 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:25:26,200 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 22:25:26,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660759365] [2019-11-19 22:25:26,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:25:26,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:25:26,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:25:26,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:25:26,223 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 4 states. [2019-11-19 22:25:26,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:25:26,331 INFO L93 Difference]: Finished difference Result 129 states and 206 transitions. [2019-11-19 22:25:26,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:25:26,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-19 22:25:26,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:25:26,350 INFO L225 Difference]: With dead ends: 129 [2019-11-19 22:25:26,350 INFO L226 Difference]: Without dead ends: 70 [2019-11-19 22:25:26,354 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-19 22:25:26,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-19 22:25:26,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-19 22:25:26,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-19 22:25:26,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2019-11-19 22:25:26,398 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 23 [2019-11-19 22:25:26,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:25:26,399 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2019-11-19 22:25:26,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:25:26,399 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2019-11-19 22:25:26,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-19 22:25:26,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:25:26,401 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-19 22:25:26,402 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:25:26,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:26,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1049597017, now seen corresponding path program 1 times [2019-11-19 22:25:26,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:26,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43187844] [2019-11-19 22:25:26,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:26,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:26,563 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-19 22:25:26,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43187844] [2019-11-19 22:25:26,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:25:26,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:25:26,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315618949] [2019-11-19 22:25:26,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:25:26,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:25:26,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:25:26,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:25:26,567 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand 3 states. [2019-11-19 22:25:26,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:25:26,592 INFO L93 Difference]: Finished difference Result 156 states and 232 transitions. [2019-11-19 22:25:26,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:25:26,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-19 22:25:26,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:25:26,595 INFO L225 Difference]: With dead ends: 156 [2019-11-19 22:25:26,595 INFO L226 Difference]: Without dead ends: 107 [2019-11-19 22:25:26,597 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-19 22:25:26,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-19 22:25:26,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2019-11-19 22:25:26,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-19 22:25:26,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2019-11-19 22:25:26,609 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 39 [2019-11-19 22:25:26,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:25:26,609 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2019-11-19 22:25:26,609 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:25:26,610 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2019-11-19 22:25:26,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-19 22:25:26,611 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:25:26,611 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-19 22:25:26,611 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:25:26,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:26,612 INFO L82 PathProgramCache]: Analyzing trace with hash -2018870194, now seen corresponding path program 1 times [2019-11-19 22:25:26,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:26,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619482188] [2019-11-19 22:25:26,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:26,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:26,703 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-19 22:25:26,704 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619482188] [2019-11-19 22:25:26,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:25:26,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:25:26,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101832476] [2019-11-19 22:25:26,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:25:26,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:25:26,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:25:26,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:25:26,706 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand 3 states. [2019-11-19 22:25:26,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:25:26,751 INFO L93 Difference]: Finished difference Result 249 states and 377 transitions. [2019-11-19 22:25:26,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:25:26,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-19 22:25:26,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:25:26,753 INFO L225 Difference]: With dead ends: 249 [2019-11-19 22:25:26,754 INFO L226 Difference]: Without dead ends: 165 [2019-11-19 22:25:26,754 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-19 22:25:26,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-19 22:25:26,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 163. [2019-11-19 22:25:26,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2019-11-19 22:25:26,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 242 transitions. [2019-11-19 22:25:26,772 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 242 transitions. Word has length 40 [2019-11-19 22:25:26,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:25:26,772 INFO L462 AbstractCegarLoop]: Abstraction has 163 states and 242 transitions. [2019-11-19 22:25:26,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:25:26,772 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 242 transitions. [2019-11-19 22:25:26,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-19 22:25:26,774 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:25:26,774 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-19 22:25:26,774 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:25:26,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:26,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1411558281, now seen corresponding path program 1 times [2019-11-19 22:25:26,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:26,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372746508] [2019-11-19 22:25:26,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:26,868 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-19 22:25:26,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372746508] [2019-11-19 22:25:26,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:25:26,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:25:26,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741500487] [2019-11-19 22:25:26,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:25:26,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:25:26,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:25:26,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:25:26,870 INFO L87 Difference]: Start difference. First operand 163 states and 242 transitions. Second operand 5 states. [2019-11-19 22:25:26,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:25:26,991 INFO L93 Difference]: Finished difference Result 731 states and 1126 transitions. [2019-11-19 22:25:26,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:25:26,992 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-11-19 22:25:26,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:25:26,998 INFO L225 Difference]: With dead ends: 731 [2019-11-19 22:25:26,999 INFO L226 Difference]: Without dead ends: 589 [2019-11-19 22:25:27,000 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-19 22:25:27,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-11-19 22:25:27,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 303. [2019-11-19 22:25:27,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-11-19 22:25:27,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 454 transitions. [2019-11-19 22:25:27,035 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 454 transitions. Word has length 41 [2019-11-19 22:25:27,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:25:27,036 INFO L462 AbstractCegarLoop]: Abstraction has 303 states and 454 transitions. [2019-11-19 22:25:27,036 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:25:27,036 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 454 transitions. [2019-11-19 22:25:27,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-19 22:25:27,038 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:25:27,038 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-19 22:25:27,038 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:25:27,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:27,038 INFO L82 PathProgramCache]: Analyzing trace with hash 425310312, now seen corresponding path program 1 times [2019-11-19 22:25:27,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:27,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583925184] [2019-11-19 22:25:27,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:27,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:27,183 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-19 22:25:27,184 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583925184] [2019-11-19 22:25:27,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:25:27,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:25:27,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212587522] [2019-11-19 22:25:27,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:25:27,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:25:27,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:25:27,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:25:27,186 INFO L87 Difference]: Start difference. First operand 303 states and 454 transitions. Second operand 5 states. [2019-11-19 22:25:27,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:25:27,304 INFO L93 Difference]: Finished difference Result 1077 states and 1629 transitions. [2019-11-19 22:25:27,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:25:27,304 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-11-19 22:25:27,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:25:27,310 INFO L225 Difference]: With dead ends: 1077 [2019-11-19 22:25:27,311 INFO L226 Difference]: Without dead ends: 795 [2019-11-19 22:25:27,313 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-19 22:25:27,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2019-11-19 22:25:27,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 791. [2019-11-19 22:25:27,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2019-11-19 22:25:27,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1186 transitions. [2019-11-19 22:25:27,360 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1186 transitions. Word has length 42 [2019-11-19 22:25:27,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:25:27,361 INFO L462 AbstractCegarLoop]: Abstraction has 791 states and 1186 transitions. [2019-11-19 22:25:27,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:25:27,361 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1186 transitions. [2019-11-19 22:25:27,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-19 22:25:27,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:25:27,364 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-19 22:25:27,364 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:25:27,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:27,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1864742082, now seen corresponding path program 1 times [2019-11-19 22:25:27,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:27,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297842087] [2019-11-19 22:25:27,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:27,440 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-19 22:25:27,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297842087] [2019-11-19 22:25:27,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:25:27,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:25:27,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138515687] [2019-11-19 22:25:27,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:25:27,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:25:27,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:25:27,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:25:27,444 INFO L87 Difference]: Start difference. First operand 791 states and 1186 transitions. Second operand 3 states. [2019-11-19 22:25:27,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:25:27,520 INFO L93 Difference]: Finished difference Result 2115 states and 3156 transitions. [2019-11-19 22:25:27,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:25:27,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-19 22:25:27,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:25:27,529 INFO L225 Difference]: With dead ends: 2115 [2019-11-19 22:25:27,530 INFO L226 Difference]: Without dead ends: 1345 [2019-11-19 22:25:27,531 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-19 22:25:27,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2019-11-19 22:25:27,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 1343. [2019-11-19 22:25:27,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1343 states. [2019-11-19 22:25:27,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 1966 transitions. [2019-11-19 22:25:27,600 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 1966 transitions. Word has length 42 [2019-11-19 22:25:27,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:25:27,601 INFO L462 AbstractCegarLoop]: Abstraction has 1343 states and 1966 transitions. [2019-11-19 22:25:27,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:25:27,602 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 1966 transitions. [2019-11-19 22:25:27,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-19 22:25:27,610 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:25:27,611 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-19 22:25:27,611 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:25:27,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:27,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1762112994, now seen corresponding path program 1 times [2019-11-19 22:25:27,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:27,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376770919] [2019-11-19 22:25:27,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:27,761 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-19 22:25:27,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376770919] [2019-11-19 22:25:27,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:25:27,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 22:25:27,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193758950] [2019-11-19 22:25:27,763 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:25:27,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:25:27,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:25:27,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:25:27,764 INFO L87 Difference]: Start difference. First operand 1343 states and 1966 transitions. Second operand 7 states. [2019-11-19 22:25:28,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:25:28,107 INFO L93 Difference]: Finished difference Result 2857 states and 4103 transitions. [2019-11-19 22:25:28,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:25:28,108 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 43 [2019-11-19 22:25:28,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:25:28,126 INFO L225 Difference]: With dead ends: 2857 [2019-11-19 22:25:28,126 INFO L226 Difference]: Without dead ends: 2855 [2019-11-19 22:25:28,128 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-19 22:25:28,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2855 states. [2019-11-19 22:25:28,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2855 to 1487. [2019-11-19 22:25:28,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1487 states. [2019-11-19 22:25:28,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1487 states to 1487 states and 2110 transitions. [2019-11-19 22:25:28,252 INFO L78 Accepts]: Start accepts. Automaton has 1487 states and 2110 transitions. Word has length 43 [2019-11-19 22:25:28,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:25:28,254 INFO L462 AbstractCegarLoop]: Abstraction has 1487 states and 2110 transitions. [2019-11-19 22:25:28,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:25:28,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1487 states and 2110 transitions. [2019-11-19 22:25:28,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-19 22:25:28,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:25:28,258 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-19 22:25:28,259 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:25:28,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:28,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1261650507, now seen corresponding path program 1 times [2019-11-19 22:25:28,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:28,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522475296] [2019-11-19 22:25:28,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:28,323 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-19 22:25:28,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522475296] [2019-11-19 22:25:28,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:25:28,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:25:28,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618769768] [2019-11-19 22:25:28,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:25:28,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:25:28,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:25:28,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:25:28,325 INFO L87 Difference]: Start difference. First operand 1487 states and 2110 transitions. Second operand 3 states. [2019-11-19 22:25:28,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:25:28,437 INFO L93 Difference]: Finished difference Result 3505 states and 4978 transitions. [2019-11-19 22:25:28,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:25:28,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-19 22:25:28,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:25:28,452 INFO L225 Difference]: With dead ends: 3505 [2019-11-19 22:25:28,452 INFO L226 Difference]: Without dead ends: 2039 [2019-11-19 22:25:28,455 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-19 22:25:28,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2039 states. [2019-11-19 22:25:28,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2039 to 2037. [2019-11-19 22:25:28,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2037 states. [2019-11-19 22:25:28,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2037 states to 2037 states and 2868 transitions. [2019-11-19 22:25:28,585 INFO L78 Accepts]: Start accepts. Automaton has 2037 states and 2868 transitions. Word has length 44 [2019-11-19 22:25:28,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:25:28,585 INFO L462 AbstractCegarLoop]: Abstraction has 2037 states and 2868 transitions. [2019-11-19 22:25:28,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:25:28,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2037 states and 2868 transitions. [2019-11-19 22:25:28,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-19 22:25:28,588 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:25:28,588 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] [2019-11-19 22:25:28,589 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:25:28,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:28,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1698932519, now seen corresponding path program 1 times [2019-11-19 22:25:28,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:28,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276901197] [2019-11-19 22:25:28,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:28,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:28,756 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-19 22:25:28,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276901197] [2019-11-19 22:25:28,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457009285] [2019-11-19 22:25:28,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/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-19 22:25:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:28,879 INFO L255 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-19 22:25:28,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:25:28,963 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-19 22:25:28,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:25:28,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6] total 7 [2019-11-19 22:25:28,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842789464] [2019-11-19 22:25:28,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:25:28,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:25:28,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:25:28,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:25:28,971 INFO L87 Difference]: Start difference. First operand 2037 states and 2868 transitions. Second operand 7 states. [2019-11-19 22:25:29,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:25:29,211 INFO L93 Difference]: Finished difference Result 5052 states and 7158 transitions. [2019-11-19 22:25:29,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:25:29,212 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-11-19 22:25:29,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:25:29,236 INFO L225 Difference]: With dead ends: 5052 [2019-11-19 22:25:29,236 INFO L226 Difference]: Without dead ends: 3586 [2019-11-19 22:25:29,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-11-19 22:25:29,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3586 states. [2019-11-19 22:25:29,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3586 to 3365. [2019-11-19 22:25:29,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3365 states. [2019-11-19 22:25:29,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3365 states to 3365 states and 4708 transitions. [2019-11-19 22:25:29,491 INFO L78 Accepts]: Start accepts. Automaton has 3365 states and 4708 transitions. Word has length 63 [2019-11-19 22:25:29,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:25:29,493 INFO L462 AbstractCegarLoop]: Abstraction has 3365 states and 4708 transitions. [2019-11-19 22:25:29,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:25:29,494 INFO L276 IsEmpty]: Start isEmpty. Operand 3365 states and 4708 transitions. [2019-11-19 22:25:29,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-19 22:25:29,497 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:25:29,497 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-19 22:25:29,701 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:25:29,701 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:25:29,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:29,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1752116912, now seen corresponding path program 1 times [2019-11-19 22:25:29,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:29,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839564189] [2019-11-19 22:25:29,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:29,846 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-19 22:25:29,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839564189] [2019-11-19 22:25:29,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286592076] [2019-11-19 22:25:29,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/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-19 22:25:29,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:29,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:25:29,958 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:25:30,066 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-19 22:25:30,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:25:30,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-19 22:25:30,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070681631] [2019-11-19 22:25:30,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 22:25:30,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:25:30,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 22:25:30,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:25:30,069 INFO L87 Difference]: Start difference. First operand 3365 states and 4708 transitions. Second operand 11 states. [2019-11-19 22:25:31,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:25:31,082 INFO L93 Difference]: Finished difference Result 11106 states and 15593 transitions. [2019-11-19 22:25:31,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 22:25:31,083 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-11-19 22:25:31,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:25:31,178 INFO L225 Difference]: With dead ends: 11106 [2019-11-19 22:25:31,178 INFO L226 Difference]: Without dead ends: 8752 [2019-11-19 22:25:31,183 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 60 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-19 22:25:31,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8752 states. [2019-11-19 22:25:31,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8752 to 4615. [2019-11-19 22:25:31,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4615 states. [2019-11-19 22:25:31,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4615 states to 4615 states and 6480 transitions. [2019-11-19 22:25:31,570 INFO L78 Accepts]: Start accepts. Automaton has 4615 states and 6480 transitions. Word has length 64 [2019-11-19 22:25:31,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:25:31,570 INFO L462 AbstractCegarLoop]: Abstraction has 4615 states and 6480 transitions. [2019-11-19 22:25:31,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 22:25:31,571 INFO L276 IsEmpty]: Start isEmpty. Operand 4615 states and 6480 transitions. [2019-11-19 22:25:31,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-19 22:25:31,573 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:25:31,574 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-19 22:25:31,778 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:25:31,778 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:25:31,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:31,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1324770848, now seen corresponding path program 1 times [2019-11-19 22:25:31,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:31,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120607565] [2019-11-19 22:25:31,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:31,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:31,838 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-19 22:25:31,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120607565] [2019-11-19 22:25:31,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:25:31,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:25:31,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890929029] [2019-11-19 22:25:31,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:25:31,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:25:31,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:25:31,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:25:31,841 INFO L87 Difference]: Start difference. First operand 4615 states and 6480 transitions. Second operand 3 states. [2019-11-19 22:25:32,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:25:32,122 INFO L93 Difference]: Finished difference Result 7507 states and 10507 transitions. [2019-11-19 22:25:32,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:25:32,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-19 22:25:32,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:25:32,170 INFO L225 Difference]: With dead ends: 7507 [2019-11-19 22:25:32,170 INFO L226 Difference]: Without dead ends: 4880 [2019-11-19 22:25:32,175 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-19 22:25:32,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4880 states. [2019-11-19 22:25:32,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4880 to 4683. [2019-11-19 22:25:32,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4683 states. [2019-11-19 22:25:32,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4683 states to 4683 states and 6431 transitions. [2019-11-19 22:25:32,525 INFO L78 Accepts]: Start accepts. Automaton has 4683 states and 6431 transitions. Word has length 64 [2019-11-19 22:25:32,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:25:32,526 INFO L462 AbstractCegarLoop]: Abstraction has 4683 states and 6431 transitions. [2019-11-19 22:25:32,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:25:32,526 INFO L276 IsEmpty]: Start isEmpty. Operand 4683 states and 6431 transitions. [2019-11-19 22:25:32,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-19 22:25:32,529 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:25:32,530 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] [2019-11-19 22:25:32,530 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:25:32,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:32,530 INFO L82 PathProgramCache]: Analyzing trace with hash -693070170, now seen corresponding path program 1 times [2019-11-19 22:25:32,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:32,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684943086] [2019-11-19 22:25:32,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:32,595 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-19 22:25:32,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684943086] [2019-11-19 22:25:32,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:25:32,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:25:32,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638866459] [2019-11-19 22:25:32,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:25:32,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:25:32,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:25:32,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:25:32,598 INFO L87 Difference]: Start difference. First operand 4683 states and 6431 transitions. Second operand 3 states. [2019-11-19 22:25:32,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:25:32,952 INFO L93 Difference]: Finished difference Result 9747 states and 13357 transitions. [2019-11-19 22:25:32,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:25:32,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-19 22:25:32,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:25:32,966 INFO L225 Difference]: With dead ends: 9747 [2019-11-19 22:25:32,967 INFO L226 Difference]: Without dead ends: 6169 [2019-11-19 22:25:32,973 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-19 22:25:32,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6169 states. [2019-11-19 22:25:33,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6169 to 6129. [2019-11-19 22:25:33,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6129 states. [2019-11-19 22:25:33,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6129 states to 6129 states and 8308 transitions. [2019-11-19 22:25:33,365 INFO L78 Accepts]: Start accepts. Automaton has 6129 states and 8308 transitions. Word has length 64 [2019-11-19 22:25:33,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:25:33,366 INFO L462 AbstractCegarLoop]: Abstraction has 6129 states and 8308 transitions. [2019-11-19 22:25:33,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:25:33,366 INFO L276 IsEmpty]: Start isEmpty. Operand 6129 states and 8308 transitions. [2019-11-19 22:25:33,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-19 22:25:33,376 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:25:33,376 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-19 22:25:33,376 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:25:33,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:33,377 INFO L82 PathProgramCache]: Analyzing trace with hash 809095304, now seen corresponding path program 1 times [2019-11-19 22:25:33,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:33,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121174431] [2019-11-19 22:25:33,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:33,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:33,566 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-19 22:25:33,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121174431] [2019-11-19 22:25:33,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772916166] [2019-11-19 22:25:33,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/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-19 22:25:33,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:33,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:25:33,689 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:25:33,825 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-19 22:25:33,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:25:33,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-11-19 22:25:33,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261844644] [2019-11-19 22:25:33,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-19 22:25:33,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:25:33,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-19 22:25:33,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:25:33,830 INFO L87 Difference]: Start difference. First operand 6129 states and 8308 transitions. Second operand 13 states. [2019-11-19 22:25:37,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:25:37,388 INFO L93 Difference]: Finished difference Result 32990 states and 44451 transitions. [2019-11-19 22:25:37,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-19 22:25:37,388 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 64 [2019-11-19 22:25:37,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:25:37,481 INFO L225 Difference]: With dead ends: 32990 [2019-11-19 22:25:37,481 INFO L226 Difference]: Without dead ends: 30416 [2019-11-19 22:25:37,498 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=585, Invalid=1577, Unknown=0, NotChecked=0, Total=2162 [2019-11-19 22:25:37,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30416 states. [2019-11-19 22:25:38,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30416 to 7321. [2019-11-19 22:25:38,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7321 states. [2019-11-19 22:25:38,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7321 states to 7321 states and 9951 transitions. [2019-11-19 22:25:38,326 INFO L78 Accepts]: Start accepts. Automaton has 7321 states and 9951 transitions. Word has length 64 [2019-11-19 22:25:38,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:25:38,326 INFO L462 AbstractCegarLoop]: Abstraction has 7321 states and 9951 transitions. [2019-11-19 22:25:38,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-19 22:25:38,326 INFO L276 IsEmpty]: Start isEmpty. Operand 7321 states and 9951 transitions. [2019-11-19 22:25:38,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-19 22:25:38,330 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:25:38,330 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-19 22:25:38,534 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:25:38,534 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:25:38,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:38,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1571663051, now seen corresponding path program 1 times [2019-11-19 22:25:38,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:38,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635231630] [2019-11-19 22:25:38,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:38,596 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-19 22:25:38,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635231630] [2019-11-19 22:25:38,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:25:38,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:25:38,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136628823] [2019-11-19 22:25:38,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:25:38,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:25:38,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:25:38,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:25:38,599 INFO L87 Difference]: Start difference. First operand 7321 states and 9951 transitions. Second operand 3 states. [2019-11-19 22:25:38,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:25:38,870 INFO L93 Difference]: Finished difference Result 9554 states and 12821 transitions. [2019-11-19 22:25:38,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:25:38,871 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-11-19 22:25:38,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:25:38,885 INFO L225 Difference]: With dead ends: 9554 [2019-11-19 22:25:38,885 INFO L226 Difference]: Without dead ends: 6443 [2019-11-19 22:25:38,890 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-19 22:25:38,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6443 states. [2019-11-19 22:25:39,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6443 to 6425. [2019-11-19 22:25:39,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6425 states. [2019-11-19 22:25:39,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6425 states to 6425 states and 8512 transitions. [2019-11-19 22:25:39,338 INFO L78 Accepts]: Start accepts. Automaton has 6425 states and 8512 transitions. Word has length 65 [2019-11-19 22:25:39,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:25:39,339 INFO L462 AbstractCegarLoop]: Abstraction has 6425 states and 8512 transitions. [2019-11-19 22:25:39,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:25:39,339 INFO L276 IsEmpty]: Start isEmpty. Operand 6425 states and 8512 transitions. [2019-11-19 22:25:39,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-19 22:25:39,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:25:39,342 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-19 22:25:39,342 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:25:39,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:39,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1664257503, now seen corresponding path program 1 times [2019-11-19 22:25:39,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:39,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512099957] [2019-11-19 22:25:39,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:39,462 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-19 22:25:39,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512099957] [2019-11-19 22:25:39,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273795208] [2019-11-19 22:25:39,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/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-19 22:25:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:39,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:25:39,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:25:39,641 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-19 22:25:39,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:25:39,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2019-11-19 22:25:39,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75398703] [2019-11-19 22:25:39,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 22:25:39,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:25:39,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 22:25:39,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:25:39,644 INFO L87 Difference]: Start difference. First operand 6425 states and 8512 transitions. Second operand 11 states. [2019-11-19 22:25:40,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:25:40,379 INFO L93 Difference]: Finished difference Result 13260 states and 17440 transitions. [2019-11-19 22:25:40,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 22:25:40,379 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-11-19 22:25:40,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:25:40,398 INFO L225 Difference]: With dead ends: 13260 [2019-11-19 22:25:40,399 INFO L226 Difference]: Without dead ends: 10002 [2019-11-19 22:25:40,405 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-11-19 22:25:40,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10002 states. [2019-11-19 22:25:40,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10002 to 6733. [2019-11-19 22:25:40,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6733 states. [2019-11-19 22:25:40,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6733 states to 6733 states and 8842 transitions. [2019-11-19 22:25:40,864 INFO L78 Accepts]: Start accepts. Automaton has 6733 states and 8842 transitions. Word has length 65 [2019-11-19 22:25:40,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:25:40,865 INFO L462 AbstractCegarLoop]: Abstraction has 6733 states and 8842 transitions. [2019-11-19 22:25:40,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 22:25:40,865 INFO L276 IsEmpty]: Start isEmpty. Operand 6733 states and 8842 transitions. [2019-11-19 22:25:40,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-19 22:25:40,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:25:40,875 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-19 22:25:41,078 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:25:41,079 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:25:41,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:41,079 INFO L82 PathProgramCache]: Analyzing trace with hash -1283872475, now seen corresponding path program 1 times [2019-11-19 22:25:41,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:41,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824973895] [2019-11-19 22:25:41,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:41,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:41,124 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-19 22:25:41,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824973895] [2019-11-19 22:25:41,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:25:41,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:25:41,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612620401] [2019-11-19 22:25:41,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:25:41,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:25:41,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:25:41,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:25:41,127 INFO L87 Difference]: Start difference. First operand 6733 states and 8842 transitions. Second operand 3 states. [2019-11-19 22:25:41,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:25:41,822 INFO L93 Difference]: Finished difference Result 13969 states and 18394 transitions. [2019-11-19 22:25:41,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:25:41,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-11-19 22:25:41,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:25:41,838 INFO L225 Difference]: With dead ends: 13969 [2019-11-19 22:25:41,838 INFO L226 Difference]: Without dead ends: 8983 [2019-11-19 22:25:41,844 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-19 22:25:41,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8983 states. [2019-11-19 22:25:42,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8983 to 8821. [2019-11-19 22:25:42,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8821 states. [2019-11-19 22:25:42,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8821 states to 8821 states and 11392 transitions. [2019-11-19 22:25:42,415 INFO L78 Accepts]: Start accepts. Automaton has 8821 states and 11392 transitions. Word has length 65 [2019-11-19 22:25:42,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:25:42,415 INFO L462 AbstractCegarLoop]: Abstraction has 8821 states and 11392 transitions. [2019-11-19 22:25:42,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:25:42,415 INFO L276 IsEmpty]: Start isEmpty. Operand 8821 states and 11392 transitions. [2019-11-19 22:25:42,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-19 22:25:42,420 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:25:42,420 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] [2019-11-19 22:25:42,420 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:25:42,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:42,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1516803518, now seen corresponding path program 1 times [2019-11-19 22:25:42,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:42,421 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325096228] [2019-11-19 22:25:42,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:42,490 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-19 22:25:42,491 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325096228] [2019-11-19 22:25:42,491 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:25:42,491 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:25:42,492 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115814296] [2019-11-19 22:25:42,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:25:42,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:25:42,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:25:42,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:25:42,493 INFO L87 Difference]: Start difference. First operand 8821 states and 11392 transitions. Second operand 6 states. [2019-11-19 22:25:43,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:25:43,486 INFO L93 Difference]: Finished difference Result 20417 states and 26304 transitions. [2019-11-19 22:25:43,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:25:43,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-11-19 22:25:43,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:25:43,499 INFO L225 Difference]: With dead ends: 20417 [2019-11-19 22:25:43,499 INFO L226 Difference]: Without dead ends: 11653 [2019-11-19 22:25:43,509 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-19 22:25:43,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11653 states. [2019-11-19 22:25:44,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11653 to 11469. [2019-11-19 22:25:44,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11469 states. [2019-11-19 22:25:44,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11469 states to 11469 states and 14643 transitions. [2019-11-19 22:25:44,191 INFO L78 Accepts]: Start accepts. Automaton has 11469 states and 14643 transitions. Word has length 65 [2019-11-19 22:25:44,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:25:44,191 INFO L462 AbstractCegarLoop]: Abstraction has 11469 states and 14643 transitions. [2019-11-19 22:25:44,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:25:44,191 INFO L276 IsEmpty]: Start isEmpty. Operand 11469 states and 14643 transitions. [2019-11-19 22:25:44,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-19 22:25:44,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:25:44,196 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] [2019-11-19 22:25:44,196 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:25:44,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:44,197 INFO L82 PathProgramCache]: Analyzing trace with hash 815203644, now seen corresponding path program 1 times [2019-11-19 22:25:44,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:44,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311483921] [2019-11-19 22:25:44,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:44,258 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-19 22:25:44,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311483921] [2019-11-19 22:25:44,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:25:44,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:25:44,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112828816] [2019-11-19 22:25:44,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:25:44,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:25:44,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:25:44,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:25:44,260 INFO L87 Difference]: Start difference. First operand 11469 states and 14643 transitions. Second operand 5 states. [2019-11-19 22:25:45,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:25:45,177 INFO L93 Difference]: Finished difference Result 17982 states and 23210 transitions. [2019-11-19 22:25:45,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:25:45,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-19 22:25:45,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:25:45,189 INFO L225 Difference]: With dead ends: 17982 [2019-11-19 22:25:45,189 INFO L226 Difference]: Without dead ends: 15048 [2019-11-19 22:25:45,194 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-19 22:25:45,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15048 states. [2019-11-19 22:25:45,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15048 to 12838. [2019-11-19 22:25:45,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12838 states. [2019-11-19 22:25:45,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12838 states to 12838 states and 16362 transitions. [2019-11-19 22:25:45,846 INFO L78 Accepts]: Start accepts. Automaton has 12838 states and 16362 transitions. Word has length 65 [2019-11-19 22:25:45,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:25:45,846 INFO L462 AbstractCegarLoop]: Abstraction has 12838 states and 16362 transitions. [2019-11-19 22:25:45,846 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:25:45,846 INFO L276 IsEmpty]: Start isEmpty. Operand 12838 states and 16362 transitions. [2019-11-19 22:25:45,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-19 22:25:45,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:25:45,851 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-19 22:25:45,851 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:25:45,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:45,851 INFO L82 PathProgramCache]: Analyzing trace with hash 352986821, now seen corresponding path program 1 times [2019-11-19 22:25:45,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:45,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213969334] [2019-11-19 22:25:45,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:45,928 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-19 22:25:45,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213969334] [2019-11-19 22:25:45,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:25:45,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:25:45,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445294519] [2019-11-19 22:25:45,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:25:45,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:25:45,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:25:45,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:25:45,930 INFO L87 Difference]: Start difference. First operand 12838 states and 16362 transitions. Second operand 5 states. [2019-11-19 22:25:46,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:25:46,718 INFO L93 Difference]: Finished difference Result 19312 states and 24919 transitions. [2019-11-19 22:25:46,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:25:46,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-19 22:25:46,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:25:46,734 INFO L225 Difference]: With dead ends: 19312 [2019-11-19 22:25:46,734 INFO L226 Difference]: Without dead ends: 16403 [2019-11-19 22:25:46,740 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-19 22:25:46,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16403 states. [2019-11-19 22:25:47,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16403 to 15212. [2019-11-19 22:25:47,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15212 states. [2019-11-19 22:25:47,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15212 states to 15212 states and 19402 transitions. [2019-11-19 22:25:47,611 INFO L78 Accepts]: Start accepts. Automaton has 15212 states and 19402 transitions. Word has length 66 [2019-11-19 22:25:47,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:25:47,611 INFO L462 AbstractCegarLoop]: Abstraction has 15212 states and 19402 transitions. [2019-11-19 22:25:47,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:25:47,612 INFO L276 IsEmpty]: Start isEmpty. Operand 15212 states and 19402 transitions. [2019-11-19 22:25:47,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-19 22:25:47,616 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:25:47,617 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-19 22:25:47,617 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:25:47,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:47,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1404868071, now seen corresponding path program 1 times [2019-11-19 22:25:47,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:47,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674848452] [2019-11-19 22:25:47,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:47,676 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-19 22:25:47,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674848452] [2019-11-19 22:25:47,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:25:47,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:25:47,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678648550] [2019-11-19 22:25:47,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 22:25:47,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:25:47,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 22:25:47,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:25:47,678 INFO L87 Difference]: Start difference. First operand 15212 states and 19402 transitions. Second operand 5 states. [2019-11-19 22:25:48,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:25:48,748 INFO L93 Difference]: Finished difference Result 21150 states and 27244 transitions. [2019-11-19 22:25:48,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:25:48,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-19 22:25:48,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:25:48,765 INFO L225 Difference]: With dead ends: 21150 [2019-11-19 22:25:48,765 INFO L226 Difference]: Without dead ends: 18424 [2019-11-19 22:25:48,771 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-19 22:25:48,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18424 states. [2019-11-19 22:25:49,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18424 to 17222. [2019-11-19 22:25:49,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17222 states. [2019-11-19 22:25:49,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17222 states to 17222 states and 21948 transitions. [2019-11-19 22:25:49,955 INFO L78 Accepts]: Start accepts. Automaton has 17222 states and 21948 transitions. Word has length 66 [2019-11-19 22:25:49,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:25:49,955 INFO L462 AbstractCegarLoop]: Abstraction has 17222 states and 21948 transitions. [2019-11-19 22:25:49,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 22:25:49,955 INFO L276 IsEmpty]: Start isEmpty. Operand 17222 states and 21948 transitions. [2019-11-19 22:25:49,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-19 22:25:49,960 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:25:49,961 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] [2019-11-19 22:25:49,961 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:25:49,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:25:49,962 INFO L82 PathProgramCache]: Analyzing trace with hash 1470846148, now seen corresponding path program 1 times [2019-11-19 22:25:49,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:25:49,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419542934] [2019-11-19 22:25:49,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:25:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:50,194 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-19 22:25:50,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419542934] [2019-11-19 22:25:50,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681677426] [2019-11-19 22:25:50,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/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-19 22:25:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:25:50,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-19 22:25:50,291 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:25:50,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:25:51,656 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-19 22:25:51,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:25:51,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 20 [2019-11-19 22:25:51,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699281790] [2019-11-19 22:25:51,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-19 22:25:51,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:25:51,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-19 22:25:51,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2019-11-19 22:25:51,659 INFO L87 Difference]: Start difference. First operand 17222 states and 21948 transitions. Second operand 20 states. [2019-11-19 22:25:52,196 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 61 [2019-11-19 22:25:52,433 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-11-19 22:25:52,830 WARN L191 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 71 [2019-11-19 22:25:53,166 WARN L191 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 77 [2019-11-19 22:25:53,455 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-11-19 22:25:54,001 WARN L191 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-11-19 22:25:54,399 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-11-19 22:25:54,667 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2019-11-19 22:25:55,035 WARN L191 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-11-19 22:25:55,400 WARN L191 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-11-19 22:25:55,787 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-11-19 22:25:56,127 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 70 [2019-11-19 22:25:56,588 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-11-19 22:25:56,937 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-11-19 22:25:57,346 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-11-19 22:25:57,674 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-11-19 22:25:58,027 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-11-19 22:25:58,446 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-11-19 22:25:58,771 WARN L191 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-11-19 22:25:59,073 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-11-19 22:25:59,466 WARN L191 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 73 [2019-11-19 22:25:59,748 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-11-19 22:26:00,036 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-11-19 22:26:00,372 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-11-19 22:26:00,694 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-11-19 22:26:01,097 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-11-19 22:26:01,536 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-11-19 22:26:01,842 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2019-11-19 22:26:02,302 WARN L191 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-11-19 22:26:02,577 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-11-19 22:26:02,914 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 73 [2019-11-19 22:26:03,658 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 77 [2019-11-19 22:26:04,004 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-11-19 22:26:04,340 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-11-19 22:26:05,251 WARN L191 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-11-19 22:26:05,648 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-11-19 22:26:06,044 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2019-11-19 22:26:06,394 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 78 [2019-11-19 22:26:06,797 WARN L191 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-11-19 22:26:07,145 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-11-19 22:26:07,573 WARN L191 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 73 [2019-11-19 22:26:07,963 WARN L191 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-11-19 22:26:08,360 WARN L191 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 83 [2019-11-19 22:26:08,725 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-11-19 22:26:08,957 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-11-19 22:26:09,375 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 80 [2019-11-19 22:26:09,710 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2019-11-19 22:26:10,052 WARN L191 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-11-19 22:26:10,516 WARN L191 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-11-19 22:26:10,710 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-11-19 22:26:11,086 WARN L191 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 76 [2019-11-19 22:26:11,432 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-11-19 22:26:11,747 WARN L191 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-11-19 22:26:12,101 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-11-19 22:26:12,500 WARN L191 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-11-19 22:26:12,819 WARN L191 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-11-19 22:26:13,078 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-11-19 22:26:13,554 WARN L191 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 83 [2019-11-19 22:26:13,937 WARN L191 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 80 [2019-11-19 22:26:14,209 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-11-19 22:26:14,412 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-11-19 22:26:14,616 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-19 22:26:14,828 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-11-19 22:26:15,269 WARN L191 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 79 [2019-11-19 22:26:15,598 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2019-11-19 22:26:16,016 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 75 [2019-11-19 22:26:16,404 WARN L191 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 79 [2019-11-19 22:26:16,907 WARN L191 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 75 [2019-11-19 22:26:17,196 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-11-19 22:26:17,436 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-11-19 22:26:17,687 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-19 22:26:18,081 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2019-11-19 22:26:18,403 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-11-19 22:26:18,597 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-11-19 22:26:18,800 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-11-19 22:26:19,396 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-11-19 22:26:19,618 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-11-19 22:26:19,838 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-11-19 22:26:20,130 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-11-19 22:26:20,362 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 66 [2019-11-19 22:26:20,565 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-11-19 22:26:21,033 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-11-19 22:26:21,270 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-11-19 22:26:21,504 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-11-19 22:26:22,088 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-11-19 22:26:22,404 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-11-19 22:26:22,603 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-11-19 22:26:22,840 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-11-19 22:26:23,088 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-19 22:26:23,327 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-11-19 22:26:23,564 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-11-19 22:26:23,834 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-19 22:26:24,630 WARN L191 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 76 [2019-11-19 22:26:25,092 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2019-11-19 22:26:25,309 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-11-19 22:26:25,615 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-11-19 22:26:25,918 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-19 22:26:26,183 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-11-19 22:26:26,514 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-11-19 22:26:26,699 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-11-19 22:26:27,124 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-11-19 22:26:27,547 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2019-11-19 22:26:27,760 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-11-19 22:26:27,932 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-11-19 22:26:28,419 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-11-19 22:26:28,780 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 75 [2019-11-19 22:26:29,010 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-11-19 22:26:29,626 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-11-19 22:26:29,947 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-11-19 22:26:30,390 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2019-11-19 22:26:30,762 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-11-19 22:26:30,970 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-11-19 22:26:31,171 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-11-19 22:26:31,388 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-11-19 22:26:31,582 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-19 22:26:31,780 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-11-19 22:26:32,259 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-11-19 22:26:32,450 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-11-19 22:26:32,690 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-11-19 22:26:34,568 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-19 22:26:36,529 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-11-19 22:26:36,957 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 60 [2019-11-19 22:26:38,012 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-11-19 22:26:38,387 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-19 22:26:39,357 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-11-19 22:26:39,768 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-11-19 22:26:40,206 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2019-11-19 22:26:40,621 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-11-19 22:26:40,807 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-11-19 22:26:41,412 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-11-19 22:26:41,798 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 55 [2019-11-19 22:26:42,209 WARN L191 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-11-19 22:26:42,488 WARN L191 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-11-19 22:26:43,076 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-11-19 22:26:43,342 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-11-19 22:26:43,507 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-19 22:26:46,940 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-11-19 22:26:47,115 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-11-19 22:26:47,557 WARN L191 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-11-19 22:26:47,787 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-11-19 22:26:48,148 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 66 [2019-11-19 22:26:48,482 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-11-19 22:26:48,718 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-11-19 22:26:49,077 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2019-11-19 22:26:49,251 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-19 22:26:49,455 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-19 22:26:49,718 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-11-19 22:26:49,997 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-11-19 22:26:50,374 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-11-19 22:26:50,621 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-11-19 22:26:50,907 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-11-19 22:26:51,138 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-11-19 22:26:51,386 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-11-19 22:26:51,808 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-11-19 22:26:52,097 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-11-19 22:26:52,487 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-19 22:26:52,851 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-11-19 22:26:53,662 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-11-19 22:26:55,129 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-11-19 22:26:55,462 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-19 22:26:56,073 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-11-19 22:26:56,482 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-11-19 22:26:56,820 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-11-19 22:26:57,161 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-19 22:26:57,864 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-11-19 22:26:58,288 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-11-19 22:26:58,602 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-11-19 22:26:58,886 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-11-19 22:26:59,533 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-11-19 22:26:59,811 WARN L191 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-11-19 22:27:00,003 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-11-19 22:27:00,262 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-11-19 22:27:00,556 WARN L191 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-11-19 22:27:00,749 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-11-19 22:27:01,561 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-11-19 22:27:01,787 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-11-19 22:27:02,092 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-11-19 22:27:02,262 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-11-19 22:27:02,989 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-11-19 22:27:03,188 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-11-19 22:27:03,732 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 76 [2019-11-19 22:27:03,876 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-19 22:27:04,093 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-11-19 22:27:04,391 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-11-19 22:27:04,660 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2019-11-19 22:27:04,909 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2019-11-19 22:27:05,124 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-11-19 22:27:05,393 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-11-19 22:27:05,854 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 64 [2019-11-19 22:27:06,010 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-11-19 22:27:06,312 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 73 [2019-11-19 22:27:06,569 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-11-19 22:27:06,824 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-11-19 22:27:07,013 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-11-19 22:27:07,359 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 67 [2019-11-19 22:27:07,538 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-11-19 22:27:07,881 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 76 [2019-11-19 22:27:08,177 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-11-19 22:27:08,422 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-11-19 22:27:08,593 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-11-19 22:27:09,093 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-11-19 22:27:09,318 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-11-19 22:27:09,488 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-11-19 22:27:10,188 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-11-19 22:27:11,888 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-11-19 22:27:12,128 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-11-19 22:27:13,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:27:13,699 INFO L93 Difference]: Finished difference Result 209813 states and 266157 transitions. [2019-11-19 22:27:13,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 293 states. [2019-11-19 22:27:13,700 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 70 [2019-11-19 22:27:13,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:27:13,897 INFO L225 Difference]: With dead ends: 209813 [2019-11-19 22:27:13,898 INFO L226 Difference]: Without dead ends: 194474 [2019-11-19 22:27:13,956 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 48 SyntacticMatches, 13 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46980 ImplicationChecksByTransitivity, 60.0s TimeCoverageRelationStatistics Valid=12763, Invalid=83647, Unknown=0, NotChecked=0, Total=96410 [2019-11-19 22:27:14,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194474 states. [2019-11-19 22:27:17,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194474 to 34972. [2019-11-19 22:27:17,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34972 states. [2019-11-19 22:27:18,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34972 states to 34972 states and 45212 transitions. [2019-11-19 22:27:18,012 INFO L78 Accepts]: Start accepts. Automaton has 34972 states and 45212 transitions. Word has length 70 [2019-11-19 22:27:18,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:27:18,013 INFO L462 AbstractCegarLoop]: Abstraction has 34972 states and 45212 transitions. [2019-11-19 22:27:18,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-19 22:27:18,013 INFO L276 IsEmpty]: Start isEmpty. Operand 34972 states and 45212 transitions. [2019-11-19 22:27:18,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-19 22:27:18,019 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:27:18,019 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] [2019-11-19 22:27:18,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:27:18,223 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:27:18,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:27:18,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1898192212, now seen corresponding path program 1 times [2019-11-19 22:27:18,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:27:18,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582928903] [2019-11-19 22:27:18,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:27:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:27:18,444 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-19 22:27:18,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582928903] [2019-11-19 22:27:18,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787692375] [2019-11-19 22:27:18,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/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-19 22:27:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:27:18,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 304 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-19 22:27:18,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:27:18,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:27:18,890 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-19 22:27:18,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:27:18,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2019-11-19 22:27:18,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301172903] [2019-11-19 22:27:18,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-19 22:27:18,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:27:18,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-19 22:27:18,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-11-19 22:27:18,892 INFO L87 Difference]: Start difference. First operand 34972 states and 45212 transitions. Second operand 17 states. [2019-11-19 22:27:29,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:27:29,267 INFO L93 Difference]: Finished difference Result 112109 states and 143079 transitions. [2019-11-19 22:27:29,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-19 22:27:29,267 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 70 [2019-11-19 22:27:29,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:27:29,343 INFO L225 Difference]: With dead ends: 112109 [2019-11-19 22:27:29,343 INFO L226 Difference]: Without dead ends: 81954 [2019-11-19 22:27:29,367 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=592, Invalid=1664, Unknown=0, NotChecked=0, Total=2256 [2019-11-19 22:27:29,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81954 states. [2019-11-19 22:27:34,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81954 to 44721. [2019-11-19 22:27:34,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44721 states. [2019-11-19 22:27:34,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44721 states to 44721 states and 57552 transitions. [2019-11-19 22:27:34,222 INFO L78 Accepts]: Start accepts. Automaton has 44721 states and 57552 transitions. Word has length 70 [2019-11-19 22:27:34,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:27:34,222 INFO L462 AbstractCegarLoop]: Abstraction has 44721 states and 57552 transitions. [2019-11-19 22:27:34,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-19 22:27:34,223 INFO L276 IsEmpty]: Start isEmpty. Operand 44721 states and 57552 transitions. [2019-11-19 22:27:34,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-19 22:27:34,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:27:34,228 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] [2019-11-19 22:27:34,431 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:27:34,432 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:27:34,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:27:34,432 INFO L82 PathProgramCache]: Analyzing trace with hash -468502382, now seen corresponding path program 1 times [2019-11-19 22:27:34,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:27:34,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605413810] [2019-11-19 22:27:34,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:27:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:27:34,485 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-19 22:27:34,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605413810] [2019-11-19 22:27:34,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:27:34,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:27:34,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26123729] [2019-11-19 22:27:34,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:27:34,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:27:34,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:27:34,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:27:34,486 INFO L87 Difference]: Start difference. First operand 44721 states and 57552 transitions. Second operand 6 states. [2019-11-19 22:27:38,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:27:38,455 INFO L93 Difference]: Finished difference Result 76554 states and 98343 transitions. [2019-11-19 22:27:38,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:27:38,455 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-11-19 22:27:38,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:27:38,489 INFO L225 Difference]: With dead ends: 76554 [2019-11-19 22:27:38,489 INFO L226 Difference]: Without dead ends: 36650 [2019-11-19 22:27:38,514 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-19 22:27:38,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36650 states. [2019-11-19 22:27:42,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36650 to 32812. [2019-11-19 22:27:42,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32812 states. [2019-11-19 22:27:42,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32812 states to 32812 states and 41394 transitions. [2019-11-19 22:27:42,102 INFO L78 Accepts]: Start accepts. Automaton has 32812 states and 41394 transitions. Word has length 70 [2019-11-19 22:27:42,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:27:42,102 INFO L462 AbstractCegarLoop]: Abstraction has 32812 states and 41394 transitions. [2019-11-19 22:27:42,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:27:42,103 INFO L276 IsEmpty]: Start isEmpty. Operand 32812 states and 41394 transitions. [2019-11-19 22:27:42,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-19 22:27:42,107 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:27:42,107 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-19 22:27:42,108 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:27:42,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:27:42,108 INFO L82 PathProgramCache]: Analyzing trace with hash 617046017, now seen corresponding path program 1 times [2019-11-19 22:27:42,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:27:42,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487635754] [2019-11-19 22:27:42,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:27:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:27:42,150 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-19 22:27:42,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487635754] [2019-11-19 22:27:42,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:27:42,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:27:42,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361327128] [2019-11-19 22:27:42,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:27:42,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:27:42,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:27:42,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:27:42,153 INFO L87 Difference]: Start difference. First operand 32812 states and 41394 transitions. Second operand 3 states. [2019-11-19 22:27:45,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:27:45,390 INFO L93 Difference]: Finished difference Result 39272 states and 49426 transitions. [2019-11-19 22:27:45,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:27:45,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-11-19 22:27:45,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:27:45,419 INFO L225 Difference]: With dead ends: 39272 [2019-11-19 22:27:45,419 INFO L226 Difference]: Without dead ends: 31511 [2019-11-19 22:27:45,429 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-19 22:27:45,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31511 states. [2019-11-19 22:27:48,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31511 to 31509. [2019-11-19 22:27:48,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31509 states. [2019-11-19 22:27:48,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31509 states to 31509 states and 39151 transitions. [2019-11-19 22:27:48,868 INFO L78 Accepts]: Start accepts. Automaton has 31509 states and 39151 transitions. Word has length 71 [2019-11-19 22:27:48,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:27:48,869 INFO L462 AbstractCegarLoop]: Abstraction has 31509 states and 39151 transitions. [2019-11-19 22:27:48,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:27:48,869 INFO L276 IsEmpty]: Start isEmpty. Operand 31509 states and 39151 transitions. [2019-11-19 22:27:48,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-19 22:27:48,873 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:27:48,873 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] [2019-11-19 22:27:48,874 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:27:48,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:27:48,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1402634332, now seen corresponding path program 1 times [2019-11-19 22:27:48,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:27:48,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014771581] [2019-11-19 22:27:48,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:27:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:27:49,493 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-19 22:27:49,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014771581] [2019-11-19 22:27:49,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1846209719] [2019-11-19 22:27:49,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/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-19 22:27:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:27:49,586 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 48 conjunts are in the unsatisfiable core [2019-11-19 22:27:49,588 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:27:51,094 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-19 22:27:51,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:27:51,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23] total 43 [2019-11-19 22:27:51,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13865066] [2019-11-19 22:27:51,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-11-19 22:27:51,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:27:51,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-11-19 22:27:51,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=1613, Unknown=0, NotChecked=0, Total=1806 [2019-11-19 22:27:51,096 INFO L87 Difference]: Start difference. First operand 31509 states and 39151 transitions. Second operand 43 states. [2019-11-19 22:27:51,245 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 69 [2019-11-19 22:27:54,530 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-11-19 22:28:04,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:28:04,768 INFO L93 Difference]: Finished difference Result 96759 states and 119901 transitions. [2019-11-19 22:28:04,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-19 22:28:04,768 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 72 [2019-11-19 22:28:04,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:28:04,830 INFO L225 Difference]: With dead ends: 96759 [2019-11-19 22:28:04,830 INFO L226 Difference]: Without dead ends: 69417 [2019-11-19 22:28:04,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=809, Invalid=4303, Unknown=0, NotChecked=0, Total=5112 [2019-11-19 22:28:04,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69417 states. [2019-11-19 22:28:09,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69417 to 41522. [2019-11-19 22:28:09,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41522 states. [2019-11-19 22:28:09,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41522 states to 41522 states and 51214 transitions. [2019-11-19 22:28:09,701 INFO L78 Accepts]: Start accepts. Automaton has 41522 states and 51214 transitions. Word has length 72 [2019-11-19 22:28:09,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:28:09,701 INFO L462 AbstractCegarLoop]: Abstraction has 41522 states and 51214 transitions. [2019-11-19 22:28:09,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-11-19 22:28:09,701 INFO L276 IsEmpty]: Start isEmpty. Operand 41522 states and 51214 transitions. [2019-11-19 22:28:09,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-19 22:28:09,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:28:09,706 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] [2019-11-19 22:28:09,906 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:28:09,907 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:28:09,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:28:09,907 INFO L82 PathProgramCache]: Analyzing trace with hash -340931127, now seen corresponding path program 1 times [2019-11-19 22:28:09,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:28:09,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450042924] [2019-11-19 22:28:09,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:28:09,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:28:09,960 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-19 22:28:09,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450042924] [2019-11-19 22:28:09,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:28:09,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:28:09,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505723877] [2019-11-19 22:28:09,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:28:09,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:28:09,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:28:09,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:28:09,965 INFO L87 Difference]: Start difference. First operand 41522 states and 51214 transitions. Second operand 3 states. [2019-11-19 22:28:14,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:28:14,458 INFO L93 Difference]: Finished difference Result 77860 states and 95719 transitions. [2019-11-19 22:28:14,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:28:14,458 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-19 22:28:14,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:28:14,490 INFO L225 Difference]: With dead ends: 77860 [2019-11-19 22:28:14,490 INFO L226 Difference]: Without dead ends: 36399 [2019-11-19 22:28:14,502 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-19 22:28:14,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36399 states. [2019-11-19 22:28:18,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36399 to 36346. [2019-11-19 22:28:18,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36346 states. [2019-11-19 22:28:18,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36346 states to 36346 states and 43615 transitions. [2019-11-19 22:28:18,759 INFO L78 Accepts]: Start accepts. Automaton has 36346 states and 43615 transitions. Word has length 72 [2019-11-19 22:28:18,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:28:18,759 INFO L462 AbstractCegarLoop]: Abstraction has 36346 states and 43615 transitions. [2019-11-19 22:28:18,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:28:18,760 INFO L276 IsEmpty]: Start isEmpty. Operand 36346 states and 43615 transitions. [2019-11-19 22:28:18,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-19 22:28:18,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:28:18,762 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] [2019-11-19 22:28:18,763 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:28:18,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:28:18,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1154487838, now seen corresponding path program 1 times [2019-11-19 22:28:18,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:28:18,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114823309] [2019-11-19 22:28:18,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:28:18,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:28:18,834 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-19 22:28:18,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114823309] [2019-11-19 22:28:18,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:28:18,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 22:28:18,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520336844] [2019-11-19 22:28:18,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:28:18,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:28:18,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:28:18,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:28:18,836 INFO L87 Difference]: Start difference. First operand 36346 states and 43615 transitions. Second operand 6 states. [2019-11-19 22:28:23,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:28:23,578 INFO L93 Difference]: Finished difference Result 71449 states and 85856 transitions. [2019-11-19 22:28:23,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:28:23,579 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-11-19 22:28:23,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:28:23,614 INFO L225 Difference]: With dead ends: 71449 [2019-11-19 22:28:23,615 INFO L226 Difference]: Without dead ends: 37444 [2019-11-19 22:28:23,632 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-19 22:28:23,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37444 states. [2019-11-19 22:28:27,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37444 to 35144. [2019-11-19 22:28:27,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35144 states. [2019-11-19 22:28:27,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35144 states to 35144 states and 41882 transitions. [2019-11-19 22:28:27,962 INFO L78 Accepts]: Start accepts. Automaton has 35144 states and 41882 transitions. Word has length 72 [2019-11-19 22:28:27,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:28:27,962 INFO L462 AbstractCegarLoop]: Abstraction has 35144 states and 41882 transitions. [2019-11-19 22:28:27,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:28:27,963 INFO L276 IsEmpty]: Start isEmpty. Operand 35144 states and 41882 transitions. [2019-11-19 22:28:27,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-19 22:28:27,965 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:28:27,965 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-19 22:28:27,965 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:28:27,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:28:27,965 INFO L82 PathProgramCache]: Analyzing trace with hash -988332999, now seen corresponding path program 1 times [2019-11-19 22:28:27,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:28:27,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490185138] [2019-11-19 22:28:27,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:28:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:28:28,549 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-19 22:28:28,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490185138] [2019-11-19 22:28:28,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234510439] [2019-11-19 22:28:28,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/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-19 22:28:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:28:28,631 INFO L255 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 34 conjunts are in the unsatisfiable core [2019-11-19 22:28:28,633 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:28:28,915 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:28:29,575 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-19 22:28:29,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:28:29,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 16] total 37 [2019-11-19 22:28:29,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631175503] [2019-11-19 22:28:29,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-19 22:28:29,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:28:29,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-19 22:28:29,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1231, Unknown=0, NotChecked=0, Total=1332 [2019-11-19 22:28:29,577 INFO L87 Difference]: Start difference. First operand 35144 states and 41882 transitions. Second operand 37 states. [2019-11-19 22:28:29,826 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 67 [2019-11-19 22:28:32,356 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 59 [2019-11-19 22:28:33,265 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-11-19 22:28:38,845 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 62 [2019-11-19 22:28:40,242 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-19 22:28:50,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:28:50,748 INFO L93 Difference]: Finished difference Result 74506 states and 88264 transitions. [2019-11-19 22:28:50,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2019-11-19 22:28:50,748 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 73 [2019-11-19 22:28:50,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:28:50,906 INFO L225 Difference]: With dead ends: 74506 [2019-11-19 22:28:50,907 INFO L226 Difference]: Without dead ends: 66042 [2019-11-19 22:28:50,916 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4327 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=2104, Invalid=13646, Unknown=0, NotChecked=0, Total=15750 [2019-11-19 22:28:50,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66042 states. [2019-11-19 22:28:55,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66042 to 38538. [2019-11-19 22:28:55,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38538 states. [2019-11-19 22:28:55,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38538 states to 38538 states and 46019 transitions. [2019-11-19 22:28:55,708 INFO L78 Accepts]: Start accepts. Automaton has 38538 states and 46019 transitions. Word has length 73 [2019-11-19 22:28:55,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:28:55,708 INFO L462 AbstractCegarLoop]: Abstraction has 38538 states and 46019 transitions. [2019-11-19 22:28:55,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-19 22:28:55,708 INFO L276 IsEmpty]: Start isEmpty. Operand 38538 states and 46019 transitions. [2019-11-19 22:28:55,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-19 22:28:55,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:28:55,719 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:28:55,919 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:28:55,919 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:28:55,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:28:55,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1817157587, now seen corresponding path program 1 times [2019-11-19 22:28:55,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:28:55,920 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650019351] [2019-11-19 22:28:55,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:28:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:28:56,330 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 56 proven. 13 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-19 22:28:56,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650019351] [2019-11-19 22:28:56,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451654323] [2019-11-19 22:28:56,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/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-19 22:28:56,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:28:56,413 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-19 22:28:56,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:28:56,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:28:56,690 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 35 proven. 23 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-19 22:28:56,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:28:56,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 20 [2019-11-19 22:28:56,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774983919] [2019-11-19 22:28:56,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-19 22:28:56,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:28:56,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-19 22:28:56,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-11-19 22:28:56,694 INFO L87 Difference]: Start difference. First operand 38538 states and 46019 transitions. Second operand 21 states. [2019-11-19 22:29:07,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:29:07,513 INFO L93 Difference]: Finished difference Result 86323 states and 102647 transitions. [2019-11-19 22:29:07,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-19 22:29:07,514 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 104 [2019-11-19 22:29:07,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:29:07,581 INFO L225 Difference]: With dead ends: 86323 [2019-11-19 22:29:07,581 INFO L226 Difference]: Without dead ends: 71452 [2019-11-19 22:29:07,595 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 335 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=396, Invalid=1164, Unknown=0, NotChecked=0, Total=1560 [2019-11-19 22:29:07,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71452 states. [2019-11-19 22:29:15,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71452 to 54453. [2019-11-19 22:29:15,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54453 states. [2019-11-19 22:29:15,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54453 states to 54453 states and 64852 transitions. [2019-11-19 22:29:15,067 INFO L78 Accepts]: Start accepts. Automaton has 54453 states and 64852 transitions. Word has length 104 [2019-11-19 22:29:15,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:29:15,068 INFO L462 AbstractCegarLoop]: Abstraction has 54453 states and 64852 transitions. [2019-11-19 22:29:15,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-19 22:29:15,068 INFO L276 IsEmpty]: Start isEmpty. Operand 54453 states and 64852 transitions. [2019-11-19 22:29:15,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-19 22:29:15,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:29:15,078 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:29:15,279 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:29:15,279 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:29:15,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:29:15,279 INFO L82 PathProgramCache]: Analyzing trace with hash -41072578, now seen corresponding path program 2 times [2019-11-19 22:29:15,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:29:15,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510717396] [2019-11-19 22:29:15,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:29:15,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:29:15,344 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-19 22:29:15,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510717396] [2019-11-19 22:29:15,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:29:15,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:29:15,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389761289] [2019-11-19 22:29:15,346 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:29:15,346 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:29:15,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:29:15,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:29:15,347 INFO L87 Difference]: Start difference. First operand 54453 states and 64852 transitions. Second operand 3 states. [2019-11-19 22:29:19,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:29:19,147 INFO L93 Difference]: Finished difference Result 80712 states and 96381 transitions. [2019-11-19 22:29:19,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:29:19,147 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-19 22:29:19,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:29:19,170 INFO L225 Difference]: With dead ends: 80712 [2019-11-19 22:29:19,171 INFO L226 Difference]: Without dead ends: 26311 [2019-11-19 22:29:19,186 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-19 22:29:19,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26311 states. [2019-11-19 22:29:22,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26311 to 24101. [2019-11-19 22:29:22,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24101 states. [2019-11-19 22:29:22,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24101 states to 24101 states and 28395 transitions. [2019-11-19 22:29:22,242 INFO L78 Accepts]: Start accepts. Automaton has 24101 states and 28395 transitions. Word has length 105 [2019-11-19 22:29:22,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:29:22,242 INFO L462 AbstractCegarLoop]: Abstraction has 24101 states and 28395 transitions. [2019-11-19 22:29:22,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:29:22,243 INFO L276 IsEmpty]: Start isEmpty. Operand 24101 states and 28395 transitions. [2019-11-19 22:29:22,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-19 22:29:22,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:29:22,250 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:29:22,250 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:29:22,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:29:22,250 INFO L82 PathProgramCache]: Analyzing trace with hash 2112863779, now seen corresponding path program 1 times [2019-11-19 22:29:22,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:29:22,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847081531] [2019-11-19 22:29:22,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:29:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:29:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 9 proven. 67 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-19 22:29:22,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847081531] [2019-11-19 22:29:22,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586838087] [2019-11-19 22:29:22,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/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-19 22:29:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:29:22,538 INFO L255 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-19 22:29:22,540 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:29:22,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:29:23,154 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 52 proven. 33 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-19 22:29:23,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:29:23,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11] total 14 [2019-11-19 22:29:23,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679322886] [2019-11-19 22:29:23,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-19 22:29:23,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:29:23,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-19 22:29:23,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-19 22:29:23,156 INFO L87 Difference]: Start difference. First operand 24101 states and 28395 transitions. Second operand 14 states. [2019-11-19 22:29:24,208 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-19 22:29:24,357 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-11-19 22:29:24,714 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-19 22:29:24,876 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-11-19 22:29:25,192 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-11-19 22:29:25,364 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-11-19 22:29:25,612 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-11-19 22:29:25,863 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-11-19 22:29:26,048 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-11-19 22:29:26,205 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-11-19 22:29:26,546 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-11-19 22:29:26,705 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 62 [2019-11-19 22:29:27,135 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-19 22:29:27,288 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-11-19 22:29:27,663 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-19 22:29:28,294 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-11-19 22:29:29,046 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-19 22:29:30,006 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-11-19 22:29:30,246 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-11-19 22:29:31,433 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-19 22:29:31,991 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2019-11-19 22:29:33,430 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-11-19 22:29:33,678 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 62 [2019-11-19 22:29:34,347 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-19 22:29:37,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:29:37,794 INFO L93 Difference]: Finished difference Result 65778 states and 77798 transitions. [2019-11-19 22:29:37,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-11-19 22:29:37,794 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 106 [2019-11-19 22:29:37,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:29:37,847 INFO L225 Difference]: With dead ends: 65778 [2019-11-19 22:29:37,847 INFO L226 Difference]: Without dead ends: 47608 [2019-11-19 22:29:37,859 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 93 SyntacticMatches, 6 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2298 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1112, Invalid=5208, Unknown=0, NotChecked=0, Total=6320 [2019-11-19 22:29:37,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47608 states. [2019-11-19 22:29:43,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47608 to 40342. [2019-11-19 22:29:43,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40342 states. [2019-11-19 22:29:43,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40342 states to 40342 states and 46976 transitions. [2019-11-19 22:29:43,376 INFO L78 Accepts]: Start accepts. Automaton has 40342 states and 46976 transitions. Word has length 106 [2019-11-19 22:29:43,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:29:43,377 INFO L462 AbstractCegarLoop]: Abstraction has 40342 states and 46976 transitions. [2019-11-19 22:29:43,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-19 22:29:43,377 INFO L276 IsEmpty]: Start isEmpty. Operand 40342 states and 46976 transitions. [2019-11-19 22:29:43,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-19 22:29:43,384 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:29:43,384 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:29:43,585 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:29:43,585 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:29:43,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:29:43,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1674846445, now seen corresponding path program 1 times [2019-11-19 22:29:43,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:29:43,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224553432] [2019-11-19 22:29:43,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:29:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:29:43,848 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 24 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:29:43,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224553432] [2019-11-19 22:29:43,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99648526] [2019-11-19 22:29:43,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/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-19 22:29:43,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:29:43,930 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-19 22:29:43,931 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:29:43,993 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:29:44,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:29:44,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:29:44,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:29:44,252 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 55 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-19 22:29:44,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:29:44,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2019-11-19 22:29:44,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761519707] [2019-11-19 22:29:44,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-19 22:29:44,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:29:44,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-19 22:29:44,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2019-11-19 22:29:44,253 INFO L87 Difference]: Start difference. First operand 40342 states and 46976 transitions. Second operand 22 states. [2019-11-19 22:29:48,901 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 46 [2019-11-19 22:29:52,926 WARN L191 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-11-19 22:30:01,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:30:01,999 INFO L93 Difference]: Finished difference Result 81906 states and 95358 transitions. [2019-11-19 22:30:01,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-11-19 22:30:01,999 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 117 [2019-11-19 22:30:01,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:30:02,053 INFO L225 Difference]: With dead ends: 81906 [2019-11-19 22:30:02,053 INFO L226 Difference]: Without dead ends: 61596 [2019-11-19 22:30:02,066 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 106 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2783 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=1814, Invalid=8286, Unknown=0, NotChecked=0, Total=10100 [2019-11-19 22:30:02,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61596 states. [2019-11-19 22:30:07,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61596 to 35453. [2019-11-19 22:30:07,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35453 states. [2019-11-19 22:30:07,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35453 states to 35453 states and 40862 transitions. [2019-11-19 22:30:07,644 INFO L78 Accepts]: Start accepts. Automaton has 35453 states and 40862 transitions. Word has length 117 [2019-11-19 22:30:07,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:30:07,644 INFO L462 AbstractCegarLoop]: Abstraction has 35453 states and 40862 transitions. [2019-11-19 22:30:07,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-19 22:30:07,645 INFO L276 IsEmpty]: Start isEmpty. Operand 35453 states and 40862 transitions. [2019-11-19 22:30:07,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-19 22:30:07,649 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:30:07,650 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:30:07,850 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:30:07,850 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:30:07,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:30:07,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1442700781, now seen corresponding path program 1 times [2019-11-19 22:30:07,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:30:07,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744001483] [2019-11-19 22:30:07,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:30:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:30:07,905 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 81 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-19 22:30:07,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744001483] [2019-11-19 22:30:07,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:30:07,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:30:07,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510680298] [2019-11-19 22:30:07,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:30:07,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:30:07,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:30:07,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:30:07,908 INFO L87 Difference]: Start difference. First operand 35453 states and 40862 transitions. Second operand 3 states. [2019-11-19 22:30:10,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:30:10,034 INFO L93 Difference]: Finished difference Result 47092 states and 54301 transitions. [2019-11-19 22:30:10,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:30:10,034 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-11-19 22:30:10,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:30:10,043 INFO L225 Difference]: With dead ends: 47092 [2019-11-19 22:30:10,043 INFO L226 Difference]: Without dead ends: 11707 [2019-11-19 22:30:10,052 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-19 22:30:10,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11707 states. [2019-11-19 22:30:11,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11707 to 11045. [2019-11-19 22:30:11,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11045 states. [2019-11-19 22:30:11,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11045 states to 11045 states and 12564 transitions. [2019-11-19 22:30:11,726 INFO L78 Accepts]: Start accepts. Automaton has 11045 states and 12564 transitions. Word has length 118 [2019-11-19 22:30:11,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:30:11,726 INFO L462 AbstractCegarLoop]: Abstraction has 11045 states and 12564 transitions. [2019-11-19 22:30:11,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:30:11,726 INFO L276 IsEmpty]: Start isEmpty. Operand 11045 states and 12564 transitions. [2019-11-19 22:30:11,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-19 22:30:11,728 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:30:11,728 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:30:11,728 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:30:11,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:30:11,729 INFO L82 PathProgramCache]: Analyzing trace with hash -1989910784, now seen corresponding path program 1 times [2019-11-19 22:30:11,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:30:11,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665539246] [2019-11-19 22:30:11,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:30:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:30:12,122 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 52 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-19 22:30:12,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665539246] [2019-11-19 22:30:12,122 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306518540] [2019-11-19 22:30:12,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/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-19 22:30:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:30:12,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-19 22:30:12,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:30:12,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:30:12,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:30:12,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:30:12,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:30:12,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:30:12,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:30:12,892 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 56 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-19 22:30:12,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:30:12,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2019-11-19 22:30:12,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303484993] [2019-11-19 22:30:12,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-19 22:30:12,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:30:12,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-19 22:30:12,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=482, Unknown=0, NotChecked=0, Total=552 [2019-11-19 22:30:12,894 INFO L87 Difference]: Start difference. First operand 11045 states and 12564 transitions. Second operand 24 states. [2019-11-19 22:30:17,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:30:17,703 INFO L93 Difference]: Finished difference Result 21890 states and 25015 transitions. [2019-11-19 22:30:17,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-11-19 22:30:17,703 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 118 [2019-11-19 22:30:17,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:30:17,717 INFO L225 Difference]: With dead ends: 21890 [2019-11-19 22:30:17,717 INFO L226 Difference]: Without dead ends: 18176 [2019-11-19 22:30:17,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=282, Invalid=1610, Unknown=0, NotChecked=0, Total=1892 [2019-11-19 22:30:17,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18176 states. [2019-11-19 22:30:20,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18176 to 13360. [2019-11-19 22:30:20,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13360 states. [2019-11-19 22:30:20,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13360 states to 13360 states and 15164 transitions. [2019-11-19 22:30:20,025 INFO L78 Accepts]: Start accepts. Automaton has 13360 states and 15164 transitions. Word has length 118 [2019-11-19 22:30:20,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:30:20,025 INFO L462 AbstractCegarLoop]: Abstraction has 13360 states and 15164 transitions. [2019-11-19 22:30:20,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-19 22:30:20,025 INFO L276 IsEmpty]: Start isEmpty. Operand 13360 states and 15164 transitions. [2019-11-19 22:30:20,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-19 22:30:20,027 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:30:20,027 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:30:20,228 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:30:20,228 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:30:20,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:30:20,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1120663307, now seen corresponding path program 2 times [2019-11-19 22:30:20,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:30:20,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187498576] [2019-11-19 22:30:20,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:30:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:30:21,200 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 16 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:30:21,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187498576] [2019-11-19 22:30:21,200 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138743897] [2019-11-19 22:30:21,201 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/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-19 22:30:21,298 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:30:21,298 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:30:21,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-19 22:30:21,302 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:30:21,781 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 54 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-19 22:30:21,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:30:21,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 12] total 29 [2019-11-19 22:30:21,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84586861] [2019-11-19 22:30:21,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-19 22:30:21,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:30:21,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-19 22:30:21,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=721, Unknown=0, NotChecked=0, Total=812 [2019-11-19 22:30:21,782 INFO L87 Difference]: Start difference. First operand 13360 states and 15164 transitions. Second operand 29 states. [2019-11-19 22:30:24,174 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-11-19 22:30:24,902 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-19 22:30:26,363 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 64 [2019-11-19 22:30:26,686 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-11-19 22:30:26,912 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 69 [2019-11-19 22:30:27,116 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2019-11-19 22:30:27,285 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-11-19 22:30:27,690 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-19 22:30:27,875 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-11-19 22:30:28,019 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-19 22:30:28,235 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-11-19 22:30:28,930 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 66 [2019-11-19 22:30:29,159 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 70 [2019-11-19 22:30:29,373 WARN L191 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-11-19 22:30:29,541 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 63 [2019-11-19 22:30:29,735 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-11-19 22:30:30,005 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 75 [2019-11-19 22:30:30,241 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-11-19 22:30:30,482 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 75 [2019-11-19 22:30:30,650 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-11-19 22:30:30,991 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-11-19 22:30:31,170 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-11-19 22:30:31,479 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-11-19 22:30:31,730 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-11-19 22:30:31,917 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 61 [2019-11-19 22:30:32,562 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2019-11-19 22:30:33,248 WARN L191 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 72 [2019-11-19 22:30:33,492 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-11-19 22:30:33,796 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 71 [2019-11-19 22:30:33,964 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-11-19 22:30:34,126 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-11-19 22:30:34,442 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-11-19 22:30:34,607 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-11-19 22:30:34,969 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2019-11-19 22:30:35,227 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-11-19 22:30:35,378 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-11-19 22:30:35,555 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-11-19 22:30:35,939 WARN L191 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-11-19 22:30:36,115 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-11-19 22:30:36,662 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-11-19 22:30:37,029 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 65 [2019-11-19 22:30:37,462 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-11-19 22:30:37,631 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-11-19 22:30:38,115 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-11-19 22:30:38,384 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 38 [2019-11-19 22:30:38,562 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-11-19 22:30:39,089 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-11-19 22:30:39,428 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2019-11-19 22:30:39,832 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-11-19 22:30:41,221 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-11-19 22:30:41,504 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-11-19 22:30:41,722 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 72 [2019-11-19 22:30:42,137 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-11-19 22:30:42,558 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 69 [2019-11-19 22:30:42,723 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-11-19 22:30:42,928 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-11-19 22:30:43,375 WARN L191 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-11-19 22:30:43,583 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 64 [2019-11-19 22:30:43,957 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-11-19 22:30:44,125 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-11-19 22:30:44,356 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 69 [2019-11-19 22:30:44,601 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-11-19 22:30:44,773 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-11-19 22:30:45,459 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-11-19 22:30:45,780 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 71 [2019-11-19 22:30:45,993 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 69 [2019-11-19 22:30:46,289 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-11-19 22:30:46,560 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-11-19 22:30:46,902 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-11-19 22:30:47,402 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-19 22:30:47,642 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 65 [2019-11-19 22:30:47,886 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-11-19 22:30:48,341 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-11-19 22:30:49,788 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 67 [2019-11-19 22:30:50,203 WARN L191 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 72 [2019-11-19 22:30:50,520 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-11-19 22:30:50,828 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 58 [2019-11-19 22:30:51,546 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-11-19 22:30:51,990 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 69 [2019-11-19 22:30:52,286 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 68 [2019-11-19 22:30:54,052 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-11-19 22:30:54,911 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 64 [2019-11-19 22:30:55,164 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-11-19 22:30:55,390 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-11-19 22:30:55,818 WARN L191 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2019-11-19 22:30:56,045 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-11-19 22:30:57,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:30:57,065 INFO L93 Difference]: Finished difference Result 33924 states and 38472 transitions. [2019-11-19 22:30:57,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 208 states. [2019-11-19 22:30:57,065 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 119 [2019-11-19 22:30:57,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:30:57,091 INFO L225 Difference]: With dead ends: 33924 [2019-11-19 22:30:57,091 INFO L226 Difference]: Without dead ends: 29428 [2019-11-19 22:30:57,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 110 SyntacticMatches, 1 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20819 ImplicationChecksByTransitivity, 27.0s TimeCoverageRelationStatistics Valid=5784, Invalid=47808, Unknown=0, NotChecked=0, Total=53592 [2019-11-19 22:30:57,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29428 states. [2019-11-19 22:30:59,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29428 to 15032. [2019-11-19 22:30:59,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15032 states. [2019-11-19 22:30:59,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15032 states to 15032 states and 17076 transitions. [2019-11-19 22:30:59,989 INFO L78 Accepts]: Start accepts. Automaton has 15032 states and 17076 transitions. Word has length 119 [2019-11-19 22:30:59,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:30:59,990 INFO L462 AbstractCegarLoop]: Abstraction has 15032 states and 17076 transitions. [2019-11-19 22:30:59,990 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-19 22:30:59,990 INFO L276 IsEmpty]: Start isEmpty. Operand 15032 states and 17076 transitions. [2019-11-19 22:30:59,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-19 22:30:59,992 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:30:59,992 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:31:00,192 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:31:00,193 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:31:00,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:31:00,193 INFO L82 PathProgramCache]: Analyzing trace with hash -597801272, now seen corresponding path program 1 times [2019-11-19 22:31:00,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:31:00,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441983309] [2019-11-19 22:31:00,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:31:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:31:00,808 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 37 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:31:00,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441983309] [2019-11-19 22:31:00,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086869857] [2019-11-19 22:31:00,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/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-19 22:31:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:31:00,910 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 42 conjunts are in the unsatisfiable core [2019-11-19 22:31:00,913 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:31:01,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:31:01,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:31:01,435 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:31:01,823 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:31:02,323 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 37 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:31:02,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:31:02,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22] total 38 [2019-11-19 22:31:02,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912226168] [2019-11-19 22:31:02,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 38 states [2019-11-19 22:31:02,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:31:02,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2019-11-19 22:31:02,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=1223, Unknown=0, NotChecked=0, Total=1406 [2019-11-19 22:31:02,327 INFO L87 Difference]: Start difference. First operand 15032 states and 17076 transitions. Second operand 38 states. [2019-11-19 22:31:11,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:31:11,969 INFO L93 Difference]: Finished difference Result 25432 states and 28885 transitions. [2019-11-19 22:31:11,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-11-19 22:31:11,970 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 123 [2019-11-19 22:31:11,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:31:11,986 INFO L225 Difference]: With dead ends: 25432 [2019-11-19 22:31:11,986 INFO L226 Difference]: Without dead ends: 21629 [2019-11-19 22:31:11,990 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1817 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=733, Invalid=5747, Unknown=0, NotChecked=0, Total=6480 [2019-11-19 22:31:12,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21629 states. [2019-11-19 22:31:15,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21629 to 18548. [2019-11-19 22:31:15,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18548 states. [2019-11-19 22:31:15,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18548 states to 18548 states and 21057 transitions. [2019-11-19 22:31:15,411 INFO L78 Accepts]: Start accepts. Automaton has 18548 states and 21057 transitions. Word has length 123 [2019-11-19 22:31:15,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:31:15,411 INFO L462 AbstractCegarLoop]: Abstraction has 18548 states and 21057 transitions. [2019-11-19 22:31:15,411 INFO L463 AbstractCegarLoop]: Interpolant automaton has 38 states. [2019-11-19 22:31:15,411 INFO L276 IsEmpty]: Start isEmpty. Operand 18548 states and 21057 transitions. [2019-11-19 22:31:15,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-19 22:31:15,413 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:31:15,414 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:31:15,614 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:31:15,614 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:31:15,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:31:15,615 INFO L82 PathProgramCache]: Analyzing trace with hash -714291388, now seen corresponding path program 1 times [2019-11-19 22:31:15,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:31:15,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302050872] [2019-11-19 22:31:15,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:31:15,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:31:16,288 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 16 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:31:16,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302050872] [2019-11-19 22:31:16,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1318882556] [2019-11-19 22:31:16,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/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-19 22:31:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:31:16,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-19 22:31:16,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:31:16,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:31:17,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:31:17,827 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 27 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:31:17,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:31:17,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2019-11-19 22:31:17,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984822301] [2019-11-19 22:31:17,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-11-19 22:31:17,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:31:17,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-11-19 22:31:17,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1520, Unknown=0, NotChecked=0, Total=1640 [2019-11-19 22:31:17,828 INFO L87 Difference]: Start difference. First operand 18548 states and 21057 transitions. Second operand 41 states. [2019-11-19 22:31:19,128 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 48 [2019-11-19 22:31:19,464 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-11-19 22:31:19,722 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-11-19 22:31:43,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:31:43,069 INFO L93 Difference]: Finished difference Result 23572 states and 26750 transitions. [2019-11-19 22:31:43,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-11-19 22:31:43,069 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 123 [2019-11-19 22:31:43,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:31:43,086 INFO L225 Difference]: With dead ends: 23572 [2019-11-19 22:31:43,087 INFO L226 Difference]: Without dead ends: 18844 [2019-11-19 22:31:43,093 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 103 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1572 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=593, Invalid=7063, Unknown=0, NotChecked=0, Total=7656 [2019-11-19 22:31:43,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18844 states. [2019-11-19 22:31:46,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18844 to 17780. [2019-11-19 22:31:46,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17780 states. [2019-11-19 22:31:46,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17780 states to 17780 states and 20179 transitions. [2019-11-19 22:31:46,014 INFO L78 Accepts]: Start accepts. Automaton has 17780 states and 20179 transitions. Word has length 123 [2019-11-19 22:31:46,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:31:46,015 INFO L462 AbstractCegarLoop]: Abstraction has 17780 states and 20179 transitions. [2019-11-19 22:31:46,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-11-19 22:31:46,015 INFO L276 IsEmpty]: Start isEmpty. Operand 17780 states and 20179 transitions. [2019-11-19 22:31:46,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-19 22:31:46,016 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:31:46,017 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:31:46,219 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:31:46,219 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:31:46,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:31:46,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1776651436, now seen corresponding path program 1 times [2019-11-19 22:31:46,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:31:46,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658740136] [2019-11-19 22:31:46,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:31:46,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:31:46,681 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 36 proven. 61 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:31:46,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658740136] [2019-11-19 22:31:46,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [83542034] [2019-11-19 22:31:46,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/bin/uautomizer/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:31:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:31:46,769 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 31 conjunts are in the unsatisfiable core [2019-11-19 22:31:46,771 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:31:47,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:31:47,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:31:47,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:31:47,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:31:48,003 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 16 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:31:48,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:31:48,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2019-11-19 22:31:48,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401004133] [2019-11-19 22:31:48,004 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-11-19 22:31:48,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:31:48,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-11-19 22:31:48,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1161, Unknown=0, NotChecked=0, Total=1260 [2019-11-19 22:31:48,004 INFO L87 Difference]: Start difference. First operand 17780 states and 20179 transitions. Second operand 36 states. [2019-11-19 22:31:48,288 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2019-11-19 22:32:04,163 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-11-19 22:32:14,365 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2019-11-19 22:32:27,254 WARN L191 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 41 [2019-11-19 22:32:30,038 WARN L191 SmtUtils]: Spent 2.11 s on a formula simplification that was a NOOP. DAG size: 53 [2019-11-19 22:32:42,386 WARN L191 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2019-11-19 22:32:46,839 WARN L191 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 50 [2019-11-19 22:32:58,429 WARN L191 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 46 [2019-11-19 22:33:01,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:33:01,778 INFO L93 Difference]: Finished difference Result 28989 states and 32777 transitions. [2019-11-19 22:33:01,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2019-11-19 22:33:01,778 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 123 [2019-11-19 22:33:01,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:33:01,798 INFO L225 Difference]: With dead ends: 28989 [2019-11-19 22:33:01,798 INFO L226 Difference]: Without dead ends: 23775 [2019-11-19 22:33:01,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 101 SyntacticMatches, 8 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3799 ImplicationChecksByTransitivity, 53.3s TimeCoverageRelationStatistics Valid=1168, Invalid=12158, Unknown=14, NotChecked=0, Total=13340 [2019-11-19 22:33:01,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23775 states. [2019-11-19 22:33:05,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23775 to 19684. [2019-11-19 22:33:05,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19684 states. [2019-11-19 22:33:05,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19684 states to 19684 states and 22299 transitions. [2019-11-19 22:33:05,857 INFO L78 Accepts]: Start accepts. Automaton has 19684 states and 22299 transitions. Word has length 123 [2019-11-19 22:33:05,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:33:05,857 INFO L462 AbstractCegarLoop]: Abstraction has 19684 states and 22299 transitions. [2019-11-19 22:33:05,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-11-19 22:33:05,858 INFO L276 IsEmpty]: Start isEmpty. Operand 19684 states and 22299 transitions. [2019-11-19 22:33:05,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-19 22:33:05,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:33:05,861 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:33:06,064 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:33:06,065 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:33:06,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:33:06,066 INFO L82 PathProgramCache]: Analyzing trace with hash -2044509292, now seen corresponding path program 1 times [2019-11-19 22:33:06,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:33:06,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605680586] [2019-11-19 22:33:06,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:33:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:33:06,192 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:33:06,193 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 22:33:06,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:33:06 BoogieIcfgContainer [2019-11-19 22:33:06,415 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 22:33:06,415 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:33:06,415 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:33:06,416 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:33:06,416 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:25:25" (3/4) ... [2019-11-19 22:33:06,419 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 22:33:06,653 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_96eb7743-e6d7-4f50-98a9-e46494a822f4/bin/uautomizer/witness.graphml [2019-11-19 22:33:06,654 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:33:06,655 INFO L168 Benchmark]: Toolchain (without parser) took 461844.09 ms. Allocated memory was 1.0 GB in the beginning and 5.5 GB in the end (delta: 4.4 GB). Free memory was 950.1 MB in the beginning and 2.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-11-19 22:33:06,655 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:33:06,656 INFO L168 Benchmark]: CACSL2BoogieTranslator took 410.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-11-19 22:33:06,657 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.10 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-19 22:33:06,657 INFO L168 Benchmark]: Boogie Preprocessor took 43.17 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-19 22:33:06,657 INFO L168 Benchmark]: RCFGBuilder took 562.87 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-19 22:33:06,667 INFO L168 Benchmark]: TraceAbstraction took 460525.96 ms. Allocated memory was 1.2 GB in the beginning and 5.5 GB in the end (delta: 4.3 GB). Free memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2019-11-19 22:33:06,670 INFO L168 Benchmark]: Witness Printer took 238.56 ms. Allocated memory is still 5.5 GB. Free memory was 2.9 GB in the beginning and 2.9 GB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:33:06,672 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 410.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -178.0 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.10 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 43.17 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 562.87 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 460525.96 ms. Allocated memory was 1.2 GB in the beginning and 5.5 GB in the end (delta: 4.3 GB). Free memory was 1.1 GB in the beginning and 2.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. * Witness Printer took 238.56 ms. Allocated memory is still 5.5 GB. Free memory was 2.9 GB in the beginning and 2.9 GB in the end (delta: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 352]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L70] msg_t nomsg = (msg_t )-1; [L71] char r1 ; [L72] port_t p1 ; [L73] char p1_old ; [L74] char p1_new ; [L75] char id1 ; [L76] char st1 ; [L77] msg_t send1 ; [L78] _Bool mode1 ; [L79] _Bool alive1 ; [L80] port_t p2 ; [L81] char p2_old ; [L82] char p2_new ; [L83] char id2 ; [L84] char st2 ; [L85] msg_t send2 ; [L86] _Bool mode2 ; [L87] _Bool alive2 ; [L88] port_t p3 ; [L89] char p3_old ; [L90] char p3_new ; [L91] char id3 ; [L92] char st3 ; [L93] msg_t send3 ; [L94] _Bool mode3 ; [L95] _Bool alive3 ; [L196] void (*nodes[3])(void) = { & node1, & node2, & node3}; VAL [alive1=0, alive2=0, alive3=0, id1=0, id2=0, id3=0, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=0, send3=0, st1=0, st2=0, st3=0] [L296] int c1 ; [L297] int i2 ; [L300] c1 = 0 [L301] r1 = __VERIFIER_nondet_char() [L302] id1 = __VERIFIER_nondet_char() [L303] st1 = __VERIFIER_nondet_char() [L304] send1 = __VERIFIER_nondet_char() [L305] mode1 = __VERIFIER_nondet_bool() [L306] alive1 = __VERIFIER_nondet_bool() [L307] id2 = __VERIFIER_nondet_char() [L308] st2 = __VERIFIER_nondet_char() [L309] send2 = __VERIFIER_nondet_char() [L310] mode2 = __VERIFIER_nondet_bool() [L311] alive2 = __VERIFIER_nondet_bool() [L312] id3 = __VERIFIER_nondet_char() [L313] st3 = __VERIFIER_nondet_char() [L314] send3 = __VERIFIER_nondet_char() [L315] mode3 = __VERIFIER_nondet_bool() [L316] alive3 = __VERIFIER_nondet_bool() [L199] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L202] COND TRUE (int )r1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L203] COND TRUE ((int )alive1 + (int )alive2) + (int )alive3 >= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L204] COND TRUE (int )id1 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L205] COND TRUE (int )st1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L206] COND TRUE (int )send1 == (int )id1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L207] COND TRUE (int )mode1 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L208] COND TRUE (int )id2 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L209] COND TRUE (int )st2 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L210] COND TRUE (int )send2 == (int )id2 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L211] COND TRUE (int )mode2 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L212] COND TRUE (int )id3 >= 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L213] COND TRUE (int )st3 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L214] COND TRUE (int )send3 == (int )id3 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L215] COND TRUE (int )mode3 == 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L216] COND TRUE (int )id1 != (int )id2 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L217] COND TRUE (int )id1 != (int )id3 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L218] COND TRUE (int )id2 != (int )id3 [L219] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L271] return (tmp); VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=0, p1_old=0, p2=0, p2_new=0, p2_old=0, p3=0, p3_new=0, p3_old=0, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L317] i2 = init() [L319] p1_old = nomsg [L320] p1_new = nomsg [L321] p2_old = nomsg [L322] p2_new = nomsg [L323] p3_old = nomsg [L324] p3_new = nomsg [L325] i2 = 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L98] msg_t m1 ; [L101] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L102] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L120] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L123] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L130] msg_t m2 ; [L133] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L151] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L154] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L157] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L164] msg_t m3 ; [L167] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L168] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L185] COND TRUE \read(alive3) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L186] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L186] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L191] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L276] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L291] return (tmp); VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L337] c1 = check() [L350] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L339] i2 ++ VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L98] msg_t m1 ; [L101] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=0, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L102] COND TRUE \read(mode1) [L103] r1 = (char )((int )r1 + 1) [L104] m1 = p3_old [L105] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L106] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=0, send2=1, send3=127, st1=0, st2=0, st3=0] [L107] COND FALSE !(\read(alive1)) [L115] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L118] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L130] msg_t m2 ; [L133] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND TRUE \read(mode2) [L135] m2 = p1_old [L136] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L137] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L149] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L164] msg_t m3 ; [L167] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L168] COND TRUE \read(mode3) [L169] m3 = p2_old [L170] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L171] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L183] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L276] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L291] return (tmp); VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L337] c1 = check() [L350] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L339] i2 ++ VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L98] msg_t m1 ; [L101] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L102] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L120] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L123] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L130] msg_t m2 ; [L133] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L151] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L154] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L157] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L164] msg_t m3 ; [L167] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L168] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L185] COND TRUE \read(alive3) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L186] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L186] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L191] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L276] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L291] return (tmp); VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L337] c1 = check() [L350] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L339] i2 ++ VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L98] msg_t m1 ; [L101] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=1, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L102] COND TRUE \read(mode1) [L103] r1 = (char )((int )r1 + 1) [L104] m1 = p3_old [L105] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L106] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L107] COND FALSE !(\read(alive1)) [L115] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L118] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L130] msg_t m2 ; [L133] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND TRUE \read(mode2) [L135] m2 = p1_old [L136] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L137] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L149] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L164] msg_t m3 ; [L167] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L168] COND TRUE \read(mode3) [L169] m3 = p2_old [L170] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L171] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L183] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L276] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L291] return (tmp); VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L337] c1 = check() [L350] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L339] i2 ++ VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L98] msg_t m1 ; [L101] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L102] COND FALSE !(\read(mode1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L120] COND FALSE !(\read(alive1)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L123] mode1 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L130] msg_t m2 ; [L133] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND FALSE !(\read(mode2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L151] COND FALSE !(\read(alive2)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L154] COND FALSE !((int )send2 != (int )id2) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L157] mode2 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L164] msg_t m3 ; [L167] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L168] COND FALSE !(\read(mode3)) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L185] COND TRUE \read(alive3) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L186] EXPR send3 != nomsg && p3_new == nomsg ? send3 : p3_new VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L186] p3_new = send3 != nomsg && p3_new == nomsg ? send3 : p3_new [L191] mode3 = (_Bool)1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=127, p3_old=-1, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L276] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L280] COND TRUE (int )r1 < 3 [L281] tmp = 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L291] return (tmp); VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L337] c1 = check() [L350] COND FALSE !(! arg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L339] i2 ++ VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L326] COND TRUE i2 < 6 [L98] msg_t m1 ; [L101] m1 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=127, r1=2, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L102] COND TRUE \read(mode1) [L103] r1 = (char )((int )r1 + 1) [L104] m1 = p3_old [L105] p3_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L106] COND TRUE (int )m1 != (int )nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L107] COND FALSE !(\read(alive1)) [L115] send1 = m1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=1, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L118] mode1 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L130] msg_t m2 ; [L133] m2 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L134] COND TRUE \read(mode2) [L135] m2 = p1_old [L136] p1_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L137] COND FALSE !((int )m2 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=1, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L149] mode2 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L164] msg_t m3 ; [L167] m3 = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L168] COND TRUE \read(mode3) [L169] m3 = p2_old [L170] p2_old = nomsg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L171] COND FALSE !((int )m3 != (int )nomsg) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=1, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L183] mode3 = (_Bool)0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L331] p1_old = p1_new [L332] p1_new = nomsg [L333] p2_old = p2_new [L334] p2_new = nomsg [L335] p3_old = p3_new [L336] p3_new = nomsg [L276] int tmp ; VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L279] COND TRUE ((int )st1 + (int )st2) + (int )st3 <= 1 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L280] COND FALSE !((int )r1 < 3) VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L283] COND FALSE !(((int )st1 + (int )st2) + (int )st3 == 1) [L286] tmp = 0 VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L291] return (tmp); VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L337] c1 = check() [L350] COND TRUE ! arg VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] [L352] __VERIFIER_error() VAL [alive1=0, alive2=0, alive3=1, id1=0, id2=1, id3=127, mode1=0, mode2=0, mode3=0, nomsg=-1, p1=0, p1_new=-1, p1_old=-1, p2=0, p2_new=-1, p2_old=-1, p3=0, p3_new=-1, p3_old=-1, r1=3, send1=127, send2=1, send3=127, st1=0, st2=0, st3=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 74 locations, 1 error locations. Result: UNSAFE, OverallTime: 460.4s, OverallIterations: 39, TraceHistogramMax: 6, AutomataDifference: 355.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6505 SDtfs, 35870 SDslu, 61504 SDs, 0 SdLazy, 27895 SolverSat, 1918 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 58.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2835 GetRequests, 1332 SyntacticMatches, 35 SemanticMatches, 1468 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87312 ImplicationChecksByTransitivity, 183.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54453occurred in iteration=29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 80.5s AutomataMinimizationTime, 38 MinimizatonAttempts, 376647 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 17.3s InterpolantComputationTime, 4438 NumberOfCodeBlocks, 4438 NumberOfCodeBlocksAsserted, 56 NumberOfCheckSat, 4236 ConstructedInterpolants, 326 QuantifiedInterpolants, 5032398 SizeOfPredicates, 83 NumberOfNonLiveVariables, 5895 ConjunctsInSsa, 365 ConjunctsInUnsatCore, 54 InterpolantComputations, 22 PerfectInterpolantSequences, 1137/2016 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...