./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label44.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ba4d86db-0fe8-4195-a141-ef5096ee5d4b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ba4d86db-0fe8-4195-a141-ef5096ee5d4b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ba4d86db-0fe8-4195-a141-ef5096ee5d4b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ba4d86db-0fe8-4195-a141-ef5096ee5d4b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label44.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ba4d86db-0fe8-4195-a141-ef5096ee5d4b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ba4d86db-0fe8-4195-a141-ef5096ee5d4b/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 003d8b9b18d0283d5817b74650d7167df10fa305 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:24:03,536 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:24:03,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:24:03,545 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:24:03,545 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:24:03,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:24:03,547 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:24:03,548 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:24:03,550 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:24:03,551 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:24:03,551 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:24:03,552 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:24:03,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:24:03,553 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:24:03,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:24:03,554 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:24:03,555 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:24:03,556 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:24:03,557 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:24:03,559 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:24:03,560 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:24:03,560 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:24:03,561 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:24:03,561 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:24:03,563 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:24:03,563 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:24:03,563 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:24:03,564 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:24:03,564 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:24:03,565 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:24:03,565 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:24:03,565 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:24:03,565 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:24:03,566 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:24:03,566 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:24:03,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:24:03,567 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:24:03,567 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:24:03,567 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:24:03,568 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:24:03,568 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:24:03,569 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ba4d86db-0fe8-4195-a141-ef5096ee5d4b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:24:03,579 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:24:03,579 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:24:03,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:24:03,581 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:24:03,581 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:24:03,581 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:24:03,581 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:24:03,581 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:24:03,582 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:24:03,582 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:24:03,582 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:24:03,582 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:24:03,582 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:24:03,583 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:24:03,583 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:24:03,583 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:24:03,583 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:24:03,584 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:24:03,584 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:24:03,584 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:24:03,584 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:24:03,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:24:03,584 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:24:03,585 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:24:03,585 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:24:03,585 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:24:03,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:24:03,585 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:24:03,586 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:24:03,586 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_ba4d86db-0fe8-4195-a141-ef5096ee5d4b/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 -> 003d8b9b18d0283d5817b74650d7167df10fa305 [2019-12-07 18:24:03,689 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:24:03,696 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:24:03,698 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:24:03,699 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:24:03,700 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:24:03,700 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ba4d86db-0fe8-4195-a141-ef5096ee5d4b/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label44.c [2019-12-07 18:24:03,735 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ba4d86db-0fe8-4195-a141-ef5096ee5d4b/bin/uautomizer/data/ec8406ebb/78527407851546e9aa95351ed5f635ed/FLAG4d5f1abd6 [2019-12-07 18:24:04,132 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:24:04,133 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ba4d86db-0fe8-4195-a141-ef5096ee5d4b/sv-benchmarks/c/eca-rers2012/Problem03_label44.c [2019-12-07 18:24:04,144 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ba4d86db-0fe8-4195-a141-ef5096ee5d4b/bin/uautomizer/data/ec8406ebb/78527407851546e9aa95351ed5f635ed/FLAG4d5f1abd6 [2019-12-07 18:24:04,154 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ba4d86db-0fe8-4195-a141-ef5096ee5d4b/bin/uautomizer/data/ec8406ebb/78527407851546e9aa95351ed5f635ed [2019-12-07 18:24:04,155 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:24:04,156 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:24:04,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:24:04,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:24:04,159 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:24:04,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:24:04" (1/1) ... [2019-12-07 18:24:04,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@174ba895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:24:04, skipping insertion in model container [2019-12-07 18:24:04,162 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:24:04" (1/1) ... [2019-12-07 18:24:04,167 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:24:04,216 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:24:04,623 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:24:04,627 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:24:04,770 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:24:04,783 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:24:04,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:24:04 WrapperNode [2019-12-07 18:24:04,783 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:24:04,783 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:24:04,784 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:24:04,784 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:24:04,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:24:04" (1/1) ... [2019-12-07 18:24:04,808 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:24:04" (1/1) ... [2019-12-07 18:24:04,862 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:24:04,862 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:24:04,862 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:24:04,862 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:24:04,869 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:24:04" (1/1) ... [2019-12-07 18:24:04,869 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:24:04" (1/1) ... [2019-12-07 18:24:04,877 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:24:04" (1/1) ... [2019-12-07 18:24:04,877 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:24:04" (1/1) ... [2019-12-07 18:24:04,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:24:04" (1/1) ... [2019-12-07 18:24:04,911 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:24:04" (1/1) ... [2019-12-07 18:24:04,920 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:24:04" (1/1) ... [2019-12-07 18:24:04,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:24:04,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:24:04,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:24:04,929 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:24:04,929 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:24:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ba4d86db-0fe8-4195-a141-ef5096ee5d4b/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-12-07 18:24:04,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:24:04,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:24:06,068 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:24:06,068 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 18:24:06,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:24:06 BoogieIcfgContainer [2019-12-07 18:24:06,069 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:24:06,070 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:24:06,070 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:24:06,072 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:24:06,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:24:04" (1/3) ... [2019-12-07 18:24:06,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d482fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:24:06, skipping insertion in model container [2019-12-07 18:24:06,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:24:04" (2/3) ... [2019-12-07 18:24:06,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d482fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:24:06, skipping insertion in model container [2019-12-07 18:24:06,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:24:06" (3/3) ... [2019-12-07 18:24:06,075 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label44.c [2019-12-07 18:24:06,081 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:24:06,087 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 18:24:06,095 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 18:24:06,114 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:24:06,114 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:24:06,114 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:24:06,115 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:24:06,115 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:24:06,115 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:24:06,115 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:24:06,115 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:24:06,132 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-12-07 18:24:06,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-12-07 18:24:06,144 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:06,145 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:24:06,145 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:06,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:06,149 INFO L82 PathProgramCache]: Analyzing trace with hash 302925243, now seen corresponding path program 1 times [2019-12-07 18:24:06,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:06,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901322066] [2019-12-07 18:24:06,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:06,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:06,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:06,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901322066] [2019-12-07 18:24:06,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:06,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:24:06,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657549778] [2019-12-07 18:24:06,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:24:06,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:06,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:24:06,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:24:06,550 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 4 states. [2019-12-07 18:24:07,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:07,756 INFO L93 Difference]: Finished difference Result 1068 states and 1913 transitions. [2019-12-07 18:24:07,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:24:07,757 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-12-07 18:24:07,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:07,771 INFO L225 Difference]: With dead ends: 1068 [2019-12-07 18:24:07,771 INFO L226 Difference]: Without dead ends: 670 [2019-12-07 18:24:07,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:24:07,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2019-12-07 18:24:07,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 456. [2019-12-07 18:24:07,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-12-07 18:24:07,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 704 transitions. [2019-12-07 18:24:07,821 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 704 transitions. Word has length 177 [2019-12-07 18:24:07,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:07,822 INFO L462 AbstractCegarLoop]: Abstraction has 456 states and 704 transitions. [2019-12-07 18:24:07,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:24:07,822 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 704 transitions. [2019-12-07 18:24:07,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-12-07 18:24:07,826 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:07,826 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:24:07,826 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:07,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:07,826 INFO L82 PathProgramCache]: Analyzing trace with hash -2005485845, now seen corresponding path program 1 times [2019-12-07 18:24:07,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:07,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51247105] [2019-12-07 18:24:07,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:07,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:07,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51247105] [2019-12-07 18:24:07,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:07,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:24:07,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987393472] [2019-12-07 18:24:07,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:24:07,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:07,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:24:07,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:24:07,900 INFO L87 Difference]: Start difference. First operand 456 states and 704 transitions. Second operand 4 states. [2019-12-07 18:24:08,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:08,944 INFO L93 Difference]: Finished difference Result 1762 states and 2741 transitions. [2019-12-07 18:24:08,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:24:08,945 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-12-07 18:24:08,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:08,950 INFO L225 Difference]: With dead ends: 1762 [2019-12-07 18:24:08,951 INFO L226 Difference]: Without dead ends: 1308 [2019-12-07 18:24:08,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:24:08,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2019-12-07 18:24:08,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 869. [2019-12-07 18:24:08,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 869 states. [2019-12-07 18:24:08,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1278 transitions. [2019-12-07 18:24:08,975 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1278 transitions. Word has length 182 [2019-12-07 18:24:08,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:08,976 INFO L462 AbstractCegarLoop]: Abstraction has 869 states and 1278 transitions. [2019-12-07 18:24:08,976 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:24:08,976 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1278 transitions. [2019-12-07 18:24:08,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-12-07 18:24:08,978 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:08,979 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:24:08,979 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:08,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:08,979 INFO L82 PathProgramCache]: Analyzing trace with hash -23446020, now seen corresponding path program 1 times [2019-12-07 18:24:08,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:08,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773687404] [2019-12-07 18:24:08,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:09,038 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:09,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773687404] [2019-12-07 18:24:09,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:09,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:24:09,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717495678] [2019-12-07 18:24:09,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:24:09,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:09,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:24:09,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:24:09,040 INFO L87 Difference]: Start difference. First operand 869 states and 1278 transitions. Second operand 3 states. [2019-12-07 18:24:09,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:09,708 INFO L93 Difference]: Finished difference Result 2567 states and 3793 transitions. [2019-12-07 18:24:09,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:24:09,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 185 [2019-12-07 18:24:09,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:09,716 INFO L225 Difference]: With dead ends: 2567 [2019-12-07 18:24:09,716 INFO L226 Difference]: Without dead ends: 1700 [2019-12-07 18:24:09,717 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-07 18:24:09,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1700 states. [2019-12-07 18:24:09,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1700 to 1683. [2019-12-07 18:24:09,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1683 states. [2019-12-07 18:24:09,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1683 states to 1683 states and 2435 transitions. [2019-12-07 18:24:09,746 INFO L78 Accepts]: Start accepts. Automaton has 1683 states and 2435 transitions. Word has length 185 [2019-12-07 18:24:09,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:09,746 INFO L462 AbstractCegarLoop]: Abstraction has 1683 states and 2435 transitions. [2019-12-07 18:24:09,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:24:09,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1683 states and 2435 transitions. [2019-12-07 18:24:09,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-12-07 18:24:09,750 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:09,750 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:24:09,750 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:09,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:09,750 INFO L82 PathProgramCache]: Analyzing trace with hash 372513201, now seen corresponding path program 1 times [2019-12-07 18:24:09,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:09,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958218908] [2019-12-07 18:24:09,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:09,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:09,872 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 18:24:09,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958218908] [2019-12-07 18:24:09,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:09,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:24:09,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871419191] [2019-12-07 18:24:09,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:24:09,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:09,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:24:09,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:24:09,874 INFO L87 Difference]: Start difference. First operand 1683 states and 2435 transitions. Second operand 3 states. [2019-12-07 18:24:10,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:10,579 INFO L93 Difference]: Finished difference Result 5005 states and 7260 transitions. [2019-12-07 18:24:10,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:24:10,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 192 [2019-12-07 18:24:10,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:10,593 INFO L225 Difference]: With dead ends: 5005 [2019-12-07 18:24:10,593 INFO L226 Difference]: Without dead ends: 3324 [2019-12-07 18:24:10,595 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-12-07 18:24:10,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3324 states. [2019-12-07 18:24:10,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3324 to 3307. [2019-12-07 18:24:10,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3307 states. [2019-12-07 18:24:10,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3307 states to 3307 states and 4678 transitions. [2019-12-07 18:24:10,645 INFO L78 Accepts]: Start accepts. Automaton has 3307 states and 4678 transitions. Word has length 192 [2019-12-07 18:24:10,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:10,646 INFO L462 AbstractCegarLoop]: Abstraction has 3307 states and 4678 transitions. [2019-12-07 18:24:10,646 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:24:10,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3307 states and 4678 transitions. [2019-12-07 18:24:10,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-12-07 18:24:10,651 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:10,651 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:24:10,651 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:10,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:10,652 INFO L82 PathProgramCache]: Analyzing trace with hash 962558153, now seen corresponding path program 1 times [2019-12-07 18:24:10,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:10,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408959523] [2019-12-07 18:24:10,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:10,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:10,713 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-07 18:24:10,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408959523] [2019-12-07 18:24:10,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:10,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:24:10,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901690549] [2019-12-07 18:24:10,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:24:10,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:10,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:24:10,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:24:10,715 INFO L87 Difference]: Start difference. First operand 3307 states and 4678 transitions. Second operand 3 states. [2019-12-07 18:24:11,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:11,084 INFO L93 Difference]: Finished difference Result 6585 states and 9318 transitions. [2019-12-07 18:24:11,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:24:11,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-12-07 18:24:11,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:11,095 INFO L225 Difference]: With dead ends: 6585 [2019-12-07 18:24:11,095 INFO L226 Difference]: Without dead ends: 3280 [2019-12-07 18:24:11,098 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-07 18:24:11,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3280 states. [2019-12-07 18:24:11,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3280 to 3280. [2019-12-07 18:24:11,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3280 states. [2019-12-07 18:24:11,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3280 states to 3280 states and 4514 transitions. [2019-12-07 18:24:11,137 INFO L78 Accepts]: Start accepts. Automaton has 3280 states and 4514 transitions. Word has length 205 [2019-12-07 18:24:11,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:11,137 INFO L462 AbstractCegarLoop]: Abstraction has 3280 states and 4514 transitions. [2019-12-07 18:24:11,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:24:11,138 INFO L276 IsEmpty]: Start isEmpty. Operand 3280 states and 4514 transitions. [2019-12-07 18:24:11,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-12-07 18:24:11,142 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:11,142 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:24:11,143 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:11,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:11,143 INFO L82 PathProgramCache]: Analyzing trace with hash -338235124, now seen corresponding path program 1 times [2019-12-07 18:24:11,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:11,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498496450] [2019-12-07 18:24:11,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:11,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:11,214 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:11,215 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498496450] [2019-12-07 18:24:11,215 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:11,215 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:24:11,215 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325736368] [2019-12-07 18:24:11,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:24:11,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:11,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:24:11,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:24:11,216 INFO L87 Difference]: Start difference. First operand 3280 states and 4514 transitions. Second operand 3 states. [2019-12-07 18:24:11,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:11,813 INFO L93 Difference]: Finished difference Result 7992 states and 10933 transitions. [2019-12-07 18:24:11,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:24:11,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-12-07 18:24:11,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:11,831 INFO L225 Difference]: With dead ends: 7992 [2019-12-07 18:24:11,832 INFO L226 Difference]: Without dead ends: 4714 [2019-12-07 18:24:11,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-07 18:24:11,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4714 states. [2019-12-07 18:24:11,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4714 to 4713. [2019-12-07 18:24:11,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4713 states. [2019-12-07 18:24:11,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4713 states to 4713 states and 6371 transitions. [2019-12-07 18:24:11,890 INFO L78 Accepts]: Start accepts. Automaton has 4713 states and 6371 transitions. Word has length 218 [2019-12-07 18:24:11,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:11,890 INFO L462 AbstractCegarLoop]: Abstraction has 4713 states and 6371 transitions. [2019-12-07 18:24:11,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:24:11,890 INFO L276 IsEmpty]: Start isEmpty. Operand 4713 states and 6371 transitions. [2019-12-07 18:24:11,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-12-07 18:24:11,897 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:11,897 INFO L410 BasicCegarLoop]: trace histogram [3, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:24:11,897 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:11,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:11,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1335500791, now seen corresponding path program 1 times [2019-12-07 18:24:11,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:11,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645319456] [2019-12-07 18:24:11,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:12,061 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:12,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645319456] [2019-12-07 18:24:12,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068873879] [2019-12-07 18:24:12,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ba4d86db-0fe8-4195-a141-ef5096ee5d4b/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-12-07 18:24:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:12,166 INFO L264 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 18:24:12,179 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:24:12,230 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 18:24:12,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:24:12,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-12-07 18:24:12,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262346998] [2019-12-07 18:24:12,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:24:12,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:12,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:24:12,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:24:12,232 INFO L87 Difference]: Start difference. First operand 4713 states and 6371 transitions. Second operand 3 states. [2019-12-07 18:24:12,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:12,788 INFO L93 Difference]: Finished difference Result 12878 states and 17336 transitions. [2019-12-07 18:24:12,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:24:12,789 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 225 [2019-12-07 18:24:12,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:12,814 INFO L225 Difference]: With dead ends: 12878 [2019-12-07 18:24:12,814 INFO L226 Difference]: Without dead ends: 8167 [2019-12-07 18:24:12,818 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:24:12,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8167 states. [2019-12-07 18:24:12,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8167 to 8164. [2019-12-07 18:24:12,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8164 states. [2019-12-07 18:24:12,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8164 states to 8164 states and 10429 transitions. [2019-12-07 18:24:12,898 INFO L78 Accepts]: Start accepts. Automaton has 8164 states and 10429 transitions. Word has length 225 [2019-12-07 18:24:12,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:12,899 INFO L462 AbstractCegarLoop]: Abstraction has 8164 states and 10429 transitions. [2019-12-07 18:24:12,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:24:12,899 INFO L276 IsEmpty]: Start isEmpty. Operand 8164 states and 10429 transitions. [2019-12-07 18:24:12,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-12-07 18:24:12,907 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:12,907 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:24:13,108 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:24:13,109 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:13,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:13,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1624570458, now seen corresponding path program 1 times [2019-12-07 18:24:13,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:13,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209488644] [2019-12-07 18:24:13,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:13,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:13,210 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 18:24:13,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209488644] [2019-12-07 18:24:13,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:13,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:24:13,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484287203] [2019-12-07 18:24:13,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:24:13,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:13,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:24:13,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:24:13,212 INFO L87 Difference]: Start difference. First operand 8164 states and 10429 transitions. Second operand 3 states. [2019-12-07 18:24:13,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:13,801 INFO L93 Difference]: Finished difference Result 16331 states and 20865 transitions. [2019-12-07 18:24:13,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:24:13,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-12-07 18:24:13,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:13,844 INFO L225 Difference]: With dead ends: 16331 [2019-12-07 18:24:13,844 INFO L226 Difference]: Without dead ends: 8169 [2019-12-07 18:24:13,849 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-12-07 18:24:13,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8169 states. [2019-12-07 18:24:13,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8169 to 8164. [2019-12-07 18:24:13,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8164 states. [2019-12-07 18:24:13,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8164 states to 8164 states and 10164 transitions. [2019-12-07 18:24:13,920 INFO L78 Accepts]: Start accepts. Automaton has 8164 states and 10164 transitions. Word has length 226 [2019-12-07 18:24:13,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:13,920 INFO L462 AbstractCegarLoop]: Abstraction has 8164 states and 10164 transitions. [2019-12-07 18:24:13,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:24:13,920 INFO L276 IsEmpty]: Start isEmpty. Operand 8164 states and 10164 transitions. [2019-12-07 18:24:13,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-12-07 18:24:13,931 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:13,932 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:24:13,932 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:13,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:13,933 INFO L82 PathProgramCache]: Analyzing trace with hash 587520109, now seen corresponding path program 1 times [2019-12-07 18:24:13,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:13,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274875008] [2019-12-07 18:24:13,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:13,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:13,996 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 18:24:13,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274875008] [2019-12-07 18:24:13,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:13,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:24:13,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115580972] [2019-12-07 18:24:13,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:24:13,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:13,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:24:13,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:24:13,998 INFO L87 Difference]: Start difference. First operand 8164 states and 10164 transitions. Second operand 4 states. [2019-12-07 18:24:14,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:14,652 INFO L93 Difference]: Finished difference Result 16329 states and 20331 transitions. [2019-12-07 18:24:14,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:24:14,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 226 [2019-12-07 18:24:14,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:14,664 INFO L225 Difference]: With dead ends: 16329 [2019-12-07 18:24:14,664 INFO L226 Difference]: Without dead ends: 8167 [2019-12-07 18:24:14,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:24:14,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8167 states. [2019-12-07 18:24:14,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8167 to 8164. [2019-12-07 18:24:14,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8164 states. [2019-12-07 18:24:14,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8164 states to 8164 states and 9877 transitions. [2019-12-07 18:24:14,734 INFO L78 Accepts]: Start accepts. Automaton has 8164 states and 9877 transitions. Word has length 226 [2019-12-07 18:24:14,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:14,734 INFO L462 AbstractCegarLoop]: Abstraction has 8164 states and 9877 transitions. [2019-12-07 18:24:14,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:24:14,735 INFO L276 IsEmpty]: Start isEmpty. Operand 8164 states and 9877 transitions. [2019-12-07 18:24:14,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-12-07 18:24:14,742 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:14,742 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:24:14,742 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:14,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:14,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1006401140, now seen corresponding path program 1 times [2019-12-07 18:24:14,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:14,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396310892] [2019-12-07 18:24:14,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:14,796 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-12-07 18:24:14,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396310892] [2019-12-07 18:24:14,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:14,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:24:14,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434736551] [2019-12-07 18:24:14,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:24:14,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:14,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:24:14,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:24:14,798 INFO L87 Difference]: Start difference. First operand 8164 states and 9877 transitions. Second operand 3 states. [2019-12-07 18:24:15,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:15,400 INFO L93 Difference]: Finished difference Result 21810 states and 26334 transitions. [2019-12-07 18:24:15,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:24:15,401 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 232 [2019-12-07 18:24:15,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:15,417 INFO L225 Difference]: With dead ends: 21810 [2019-12-07 18:24:15,417 INFO L226 Difference]: Without dead ends: 13648 [2019-12-07 18:24:15,423 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:24:15,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13648 states. [2019-12-07 18:24:15,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13648 to 13239. [2019-12-07 18:24:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13239 states. [2019-12-07 18:24:15,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13239 states to 13239 states and 15073 transitions. [2019-12-07 18:24:15,536 INFO L78 Accepts]: Start accepts. Automaton has 13239 states and 15073 transitions. Word has length 232 [2019-12-07 18:24:15,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:15,537 INFO L462 AbstractCegarLoop]: Abstraction has 13239 states and 15073 transitions. [2019-12-07 18:24:15,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:24:15,537 INFO L276 IsEmpty]: Start isEmpty. Operand 13239 states and 15073 transitions. [2019-12-07 18:24:15,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2019-12-07 18:24:15,547 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:15,547 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:24:15,547 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:15,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:15,547 INFO L82 PathProgramCache]: Analyzing trace with hash 781312374, now seen corresponding path program 1 times [2019-12-07 18:24:15,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:15,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396757304] [2019-12-07 18:24:15,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:15,625 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:15,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396757304] [2019-12-07 18:24:15,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:15,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:24:15,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723793147] [2019-12-07 18:24:15,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:24:15,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:15,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:24:15,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:24:15,626 INFO L87 Difference]: Start difference. First operand 13239 states and 15073 transitions. Second operand 4 states. [2019-12-07 18:24:16,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:16,614 INFO L93 Difference]: Finished difference Result 30336 states and 34762 transitions. [2019-12-07 18:24:16,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:24:16,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 232 [2019-12-07 18:24:16,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:16,633 INFO L225 Difference]: With dead ends: 30336 [2019-12-07 18:24:16,634 INFO L226 Difference]: Without dead ends: 17099 [2019-12-07 18:24:16,644 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:24:16,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17099 states. [2019-12-07 18:24:16,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17099 to 16893. [2019-12-07 18:24:16,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16893 states. [2019-12-07 18:24:16,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16893 states to 16893 states and 18718 transitions. [2019-12-07 18:24:16,782 INFO L78 Accepts]: Start accepts. Automaton has 16893 states and 18718 transitions. Word has length 232 [2019-12-07 18:24:16,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:16,782 INFO L462 AbstractCegarLoop]: Abstraction has 16893 states and 18718 transitions. [2019-12-07 18:24:16,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:24:16,782 INFO L276 IsEmpty]: Start isEmpty. Operand 16893 states and 18718 transitions. [2019-12-07 18:24:16,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-12-07 18:24:16,798 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:16,798 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:24:16,798 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:16,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:16,799 INFO L82 PathProgramCache]: Analyzing trace with hash 211469247, now seen corresponding path program 1 times [2019-12-07 18:24:16,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:16,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51308434] [2019-12-07 18:24:16,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:16,966 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 18:24:16,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51308434] [2019-12-07 18:24:16,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:16,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:24:16,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319495075] [2019-12-07 18:24:16,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:24:16,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:16,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:24:16,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:24:16,967 INFO L87 Difference]: Start difference. First operand 16893 states and 18718 transitions. Second operand 4 states. [2019-12-07 18:24:17,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:17,531 INFO L93 Difference]: Finished difference Result 33795 states and 37455 transitions. [2019-12-07 18:24:17,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:24:17,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 286 [2019-12-07 18:24:17,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:17,543 INFO L225 Difference]: With dead ends: 33795 [2019-12-07 18:24:17,543 INFO L226 Difference]: Without dead ends: 16904 [2019-12-07 18:24:17,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:24:17,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16904 states. [2019-12-07 18:24:17,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16904 to 16893. [2019-12-07 18:24:17,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16893 states. [2019-12-07 18:24:17,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16893 states to 16893 states and 18680 transitions. [2019-12-07 18:24:17,682 INFO L78 Accepts]: Start accepts. Automaton has 16893 states and 18680 transitions. Word has length 286 [2019-12-07 18:24:17,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:17,682 INFO L462 AbstractCegarLoop]: Abstraction has 16893 states and 18680 transitions. [2019-12-07 18:24:17,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:24:17,682 INFO L276 IsEmpty]: Start isEmpty. Operand 16893 states and 18680 transitions. [2019-12-07 18:24:17,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2019-12-07 18:24:17,695 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:17,695 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:24:17,695 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:17,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:17,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1573273311, now seen corresponding path program 1 times [2019-12-07 18:24:17,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:17,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508097938] [2019-12-07 18:24:17,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:17,801 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 136 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-12-07 18:24:17,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508097938] [2019-12-07 18:24:17,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:17,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:24:17,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225238646] [2019-12-07 18:24:17,802 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:24:17,803 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:17,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:24:17,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:24:17,803 INFO L87 Difference]: Start difference. First operand 16893 states and 18680 transitions. Second operand 3 states. [2019-12-07 18:24:18,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:18,126 INFO L93 Difference]: Finished difference Result 33782 states and 37356 transitions. [2019-12-07 18:24:18,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:24:18,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 313 [2019-12-07 18:24:18,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:18,137 INFO L225 Difference]: With dead ends: 33782 [2019-12-07 18:24:18,137 INFO L226 Difference]: Without dead ends: 16891 [2019-12-07 18:24:18,144 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-07 18:24:18,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16891 states. [2019-12-07 18:24:18,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16891 to 16891. [2019-12-07 18:24:18,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16891 states. [2019-12-07 18:24:18,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16891 states to 16891 states and 18676 transitions. [2019-12-07 18:24:18,268 INFO L78 Accepts]: Start accepts. Automaton has 16891 states and 18676 transitions. Word has length 313 [2019-12-07 18:24:18,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:18,268 INFO L462 AbstractCegarLoop]: Abstraction has 16891 states and 18676 transitions. [2019-12-07 18:24:18,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:24:18,269 INFO L276 IsEmpty]: Start isEmpty. Operand 16891 states and 18676 transitions. [2019-12-07 18:24:18,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2019-12-07 18:24:18,320 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:18,320 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:24:18,320 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:18,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:18,321 INFO L82 PathProgramCache]: Analyzing trace with hash -476839199, now seen corresponding path program 1 times [2019-12-07 18:24:18,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:18,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912493398] [2019-12-07 18:24:18,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:18,424 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2019-12-07 18:24:18,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912493398] [2019-12-07 18:24:18,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055690965] [2019-12-07 18:24:18,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ba4d86db-0fe8-4195-a141-ef5096ee5d4b/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-12-07 18:24:18,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:18,533 INFO L264 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:24:18,544 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:24:18,625 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-12-07 18:24:18,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:24:18,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-12-07 18:24:18,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570867822] [2019-12-07 18:24:18,626 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:24:18,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:18,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:24:18,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:24:18,627 INFO L87 Difference]: Start difference. First operand 16891 states and 18676 transitions. Second operand 3 states. [2019-12-07 18:24:19,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:19,324 INFO L93 Difference]: Finished difference Result 33580 states and 37144 transitions. [2019-12-07 18:24:19,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:24:19,325 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 319 [2019-12-07 18:24:19,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:19,344 INFO L225 Difference]: With dead ends: 33580 [2019-12-07 18:24:19,344 INFO L226 Difference]: Without dead ends: 16691 [2019-12-07 18:24:19,351 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:24:19,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16691 states. [2019-12-07 18:24:19,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16691 to 16079. [2019-12-07 18:24:19,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16079 states. [2019-12-07 18:24:19,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16079 states to 16079 states and 17679 transitions. [2019-12-07 18:24:19,551 INFO L78 Accepts]: Start accepts. Automaton has 16079 states and 17679 transitions. Word has length 319 [2019-12-07 18:24:19,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:19,552 INFO L462 AbstractCegarLoop]: Abstraction has 16079 states and 17679 transitions. [2019-12-07 18:24:19,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:24:19,552 INFO L276 IsEmpty]: Start isEmpty. Operand 16079 states and 17679 transitions. [2019-12-07 18:24:19,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2019-12-07 18:24:19,568 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:19,568 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:24:19,768 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:24:19,769 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:19,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:19,769 INFO L82 PathProgramCache]: Analyzing trace with hash 738662, now seen corresponding path program 1 times [2019-12-07 18:24:19,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:19,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753158030] [2019-12-07 18:24:19,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:19,958 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 105 proven. 3 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-12-07 18:24:19,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753158030] [2019-12-07 18:24:19,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [34651810] [2019-12-07 18:24:19,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ba4d86db-0fe8-4195-a141-ef5096ee5d4b/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-12-07 18:24:20,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:20,082 INFO L264 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:24:20,087 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:24:20,162 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-12-07 18:24:20,162 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:24:20,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-12-07 18:24:20,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003853461] [2019-12-07 18:24:20,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:24:20,163 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:20,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:24:20,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:24:20,163 INFO L87 Difference]: Start difference. First operand 16079 states and 17679 transitions. Second operand 4 states. [2019-12-07 18:24:20,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:20,932 INFO L93 Difference]: Finished difference Result 48830 states and 53690 transitions. [2019-12-07 18:24:20,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:24:20,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 361 [2019-12-07 18:24:20,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:20,965 INFO L225 Difference]: With dead ends: 48830 [2019-12-07 18:24:20,965 INFO L226 Difference]: Without dead ends: 32753 [2019-12-07 18:24:20,974 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 359 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:24:20,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32753 states. [2019-12-07 18:24:21,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32753 to 32749. [2019-12-07 18:24:21,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32749 states. [2019-12-07 18:24:21,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32749 states to 32749 states and 35966 transitions. [2019-12-07 18:24:21,254 INFO L78 Accepts]: Start accepts. Automaton has 32749 states and 35966 transitions. Word has length 361 [2019-12-07 18:24:21,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:21,255 INFO L462 AbstractCegarLoop]: Abstraction has 32749 states and 35966 transitions. [2019-12-07 18:24:21,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:24:21,255 INFO L276 IsEmpty]: Start isEmpty. Operand 32749 states and 35966 transitions. [2019-12-07 18:24:21,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-12-07 18:24:21,269 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:21,270 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:24:21,470 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:24:21,471 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:21,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:21,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1903494745, now seen corresponding path program 1 times [2019-12-07 18:24:21,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:21,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501591363] [2019-12-07 18:24:21,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:21,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:21,681 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-12-07 18:24:21,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501591363] [2019-12-07 18:24:21,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:21,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:24:21,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41558812] [2019-12-07 18:24:21,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:24:21,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:21,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:24:21,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:24:21,682 INFO L87 Difference]: Start difference. First operand 32749 states and 35966 transitions. Second operand 5 states. [2019-12-07 18:24:22,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:22,865 INFO L93 Difference]: Finished difference Result 90940 states and 100098 transitions. [2019-12-07 18:24:22,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:24:22,865 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 364 [2019-12-07 18:24:22,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:22,912 INFO L225 Difference]: With dead ends: 90940 [2019-12-07 18:24:22,912 INFO L226 Difference]: Without dead ends: 58193 [2019-12-07 18:24:22,929 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:24:22,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58193 states. [2019-12-07 18:24:23,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58193 to 56346. [2019-12-07 18:24:23,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56346 states. [2019-12-07 18:24:23,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56346 states to 56346 states and 61942 transitions. [2019-12-07 18:24:23,445 INFO L78 Accepts]: Start accepts. Automaton has 56346 states and 61942 transitions. Word has length 364 [2019-12-07 18:24:23,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:23,445 INFO L462 AbstractCegarLoop]: Abstraction has 56346 states and 61942 transitions. [2019-12-07 18:24:23,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:24:23,445 INFO L276 IsEmpty]: Start isEmpty. Operand 56346 states and 61942 transitions. [2019-12-07 18:24:23,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2019-12-07 18:24:23,465 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:23,466 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:24:23,466 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:23,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:23,466 INFO L82 PathProgramCache]: Analyzing trace with hash 296271038, now seen corresponding path program 1 times [2019-12-07 18:24:23,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:23,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143862847] [2019-12-07 18:24:23,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:23,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:24,211 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 190 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:24,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143862847] [2019-12-07 18:24:24,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237846012] [2019-12-07 18:24:24,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ba4d86db-0fe8-4195-a141-ef5096ee5d4b/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-12-07 18:24:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:24,332 INFO L264 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:24:24,335 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:24:24,455 INFO L134 CoverageAnalysis]: Checked inductivity of 313 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-12-07 18:24:24,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:24:24,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-12-07 18:24:24,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583497663] [2019-12-07 18:24:24,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:24:24,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:24,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:24:24,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:24:24,457 INFO L87 Difference]: Start difference. First operand 56346 states and 61942 transitions. Second operand 4 states. [2019-12-07 18:24:25,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:25,464 INFO L93 Difference]: Finished difference Result 117999 states and 129821 transitions. [2019-12-07 18:24:25,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:24:25,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 366 [2019-12-07 18:24:25,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:25,520 INFO L225 Difference]: With dead ends: 117999 [2019-12-07 18:24:25,520 INFO L226 Difference]: Without dead ends: 61655 [2019-12-07 18:24:25,544 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 373 GetRequests, 364 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:24:25,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61655 states. [2019-12-07 18:24:26,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61655 to 59996. [2019-12-07 18:24:26,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59996 states. [2019-12-07 18:24:26,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59996 states to 59996 states and 64829 transitions. [2019-12-07 18:24:26,098 INFO L78 Accepts]: Start accepts. Automaton has 59996 states and 64829 transitions. Word has length 366 [2019-12-07 18:24:26,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:26,098 INFO L462 AbstractCegarLoop]: Abstraction has 59996 states and 64829 transitions. [2019-12-07 18:24:26,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:24:26,098 INFO L276 IsEmpty]: Start isEmpty. Operand 59996 states and 64829 transitions. [2019-12-07 18:24:26,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-12-07 18:24:26,127 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:26,128 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:24:26,329 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:24:26,330 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:26,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:26,330 INFO L82 PathProgramCache]: Analyzing trace with hash 2131780047, now seen corresponding path program 1 times [2019-12-07 18:24:26,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:26,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509721838] [2019-12-07 18:24:26,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:26,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:26,506 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-12-07 18:24:26,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509721838] [2019-12-07 18:24:26,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:26,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:24:26,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202574576] [2019-12-07 18:24:26,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:24:26,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:26,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:24:26,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:24:26,507 INFO L87 Difference]: Start difference. First operand 59996 states and 64829 transitions. Second operand 4 states. [2019-12-07 18:24:27,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:27,678 INFO L93 Difference]: Finished difference Result 120811 states and 130534 transitions. [2019-12-07 18:24:27,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:24:27,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 393 [2019-12-07 18:24:27,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:27,728 INFO L225 Difference]: With dead ends: 120811 [2019-12-07 18:24:27,729 INFO L226 Difference]: Without dead ends: 60817 [2019-12-07 18:24:27,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:24:27,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60817 states. [2019-12-07 18:24:28,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60817 to 60402. [2019-12-07 18:24:28,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60402 states. [2019-12-07 18:24:28,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60402 states to 60402 states and 65126 transitions. [2019-12-07 18:24:28,456 INFO L78 Accepts]: Start accepts. Automaton has 60402 states and 65126 transitions. Word has length 393 [2019-12-07 18:24:28,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:28,456 INFO L462 AbstractCegarLoop]: Abstraction has 60402 states and 65126 transitions. [2019-12-07 18:24:28,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:24:28,457 INFO L276 IsEmpty]: Start isEmpty. Operand 60402 states and 65126 transitions. [2019-12-07 18:24:28,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2019-12-07 18:24:28,476 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:28,476 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:24:28,476 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:28,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:28,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1185805506, now seen corresponding path program 1 times [2019-12-07 18:24:28,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:28,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364879501] [2019-12-07 18:24:28,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:28,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:28,609 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 283 trivial. 0 not checked. [2019-12-07 18:24:28,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364879501] [2019-12-07 18:24:28,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:28,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:24:28,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476133603] [2019-12-07 18:24:28,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:24:28,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:28,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:24:28,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:24:28,610 INFO L87 Difference]: Start difference. First operand 60402 states and 65126 transitions. Second operand 4 states. [2019-12-07 18:24:29,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:29,720 INFO L93 Difference]: Finished difference Result 174240 states and 187140 transitions. [2019-12-07 18:24:29,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:24:29,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 398 [2019-12-07 18:24:29,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:29,820 INFO L225 Difference]: With dead ends: 174240 [2019-12-07 18:24:29,820 INFO L226 Difference]: Without dead ends: 113840 [2019-12-07 18:24:29,849 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:24:29,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113840 states. [2019-12-07 18:24:30,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113840 to 110991. [2019-12-07 18:24:30,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110991 states. [2019-12-07 18:24:31,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110991 states to 110991 states and 119044 transitions. [2019-12-07 18:24:31,011 INFO L78 Accepts]: Start accepts. Automaton has 110991 states and 119044 transitions. Word has length 398 [2019-12-07 18:24:31,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:31,011 INFO L462 AbstractCegarLoop]: Abstraction has 110991 states and 119044 transitions. [2019-12-07 18:24:31,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:24:31,011 INFO L276 IsEmpty]: Start isEmpty. Operand 110991 states and 119044 transitions. [2019-12-07 18:24:31,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-12-07 18:24:31,036 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:31,036 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:24:31,036 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:31,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:31,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1884846633, now seen corresponding path program 1 times [2019-12-07 18:24:31,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:31,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804580146] [2019-12-07 18:24:31,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:31,233 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-12-07 18:24:31,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804580146] [2019-12-07 18:24:31,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:31,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:24:31,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449420048] [2019-12-07 18:24:31,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:24:31,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:31,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:24:31,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:24:31,235 INFO L87 Difference]: Start difference. First operand 110991 states and 119044 transitions. Second operand 4 states. [2019-12-07 18:24:32,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:32,457 INFO L93 Difference]: Finished difference Result 395001 states and 423842 transitions. [2019-12-07 18:24:32,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:24:32,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 400 [2019-12-07 18:24:32,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:32,756 INFO L225 Difference]: With dead ends: 395001 [2019-12-07 18:24:32,757 INFO L226 Difference]: Without dead ends: 284215 [2019-12-07 18:24:32,830 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:24:33,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284215 states. [2019-12-07 18:24:35,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284215 to 180540. [2019-12-07 18:24:35,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180540 states. [2019-12-07 18:24:35,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180540 states to 180540 states and 193677 transitions. [2019-12-07 18:24:35,363 INFO L78 Accepts]: Start accepts. Automaton has 180540 states and 193677 transitions. Word has length 400 [2019-12-07 18:24:35,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:35,363 INFO L462 AbstractCegarLoop]: Abstraction has 180540 states and 193677 transitions. [2019-12-07 18:24:35,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:24:35,363 INFO L276 IsEmpty]: Start isEmpty. Operand 180540 states and 193677 transitions. [2019-12-07 18:24:35,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-12-07 18:24:35,388 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:35,389 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:24:35,389 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:35,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:35,389 INFO L82 PathProgramCache]: Analyzing trace with hash -792061351, now seen corresponding path program 1 times [2019-12-07 18:24:35,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:35,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390477690] [2019-12-07 18:24:35,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:36,779 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-12-07 18:24:36,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390477690] [2019-12-07 18:24:36,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:36,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:24:36,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47063075] [2019-12-07 18:24:36,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:24:36,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:36,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:24:36,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:24:36,780 INFO L87 Difference]: Start difference. First operand 180540 states and 193677 transitions. Second operand 5 states. [2019-12-07 18:24:38,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:38,806 INFO L93 Difference]: Finished difference Result 382430 states and 409891 transitions. [2019-12-07 18:24:38,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:24:38,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 400 [2019-12-07 18:24:38,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:39,029 INFO L225 Difference]: With dead ends: 382430 [2019-12-07 18:24:39,029 INFO L226 Difference]: Without dead ends: 202095 [2019-12-07 18:24:39,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-07 18:24:39,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202095 states. [2019-12-07 18:24:40,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202095 to 188071. [2019-12-07 18:24:40,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188071 states. [2019-12-07 18:24:41,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188071 states to 188071 states and 201564 transitions. [2019-12-07 18:24:41,040 INFO L78 Accepts]: Start accepts. Automaton has 188071 states and 201564 transitions. Word has length 400 [2019-12-07 18:24:41,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:41,040 INFO L462 AbstractCegarLoop]: Abstraction has 188071 states and 201564 transitions. [2019-12-07 18:24:41,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:24:41,041 INFO L276 IsEmpty]: Start isEmpty. Operand 188071 states and 201564 transitions. [2019-12-07 18:24:41,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2019-12-07 18:24:41,069 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:41,069 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1] [2019-12-07 18:24:41,070 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:41,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:41,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1777016498, now seen corresponding path program 1 times [2019-12-07 18:24:41,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:41,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962619200] [2019-12-07 18:24:41,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:41,874 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 262 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:24:41,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962619200] [2019-12-07 18:24:41,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822965413] [2019-12-07 18:24:41,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ba4d86db-0fe8-4195-a141-ef5096ee5d4b/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-12-07 18:24:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:42,026 INFO L264 TraceCheckSpWp]: Trace formula consists of 707 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 18:24:42,029 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:24:42,149 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-12-07 18:24:42,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:24:42,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [14] total 15 [2019-12-07 18:24:42,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584674756] [2019-12-07 18:24:42,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:24:42,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:42,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:24:42,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:24:42,150 INFO L87 Difference]: Start difference. First operand 188071 states and 201564 transitions. Second operand 4 states. [2019-12-07 18:24:43,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:43,531 INFO L93 Difference]: Finished difference Result 382447 states and 409567 transitions. [2019-12-07 18:24:43,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:24:43,532 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 415 [2019-12-07 18:24:43,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:43,715 INFO L225 Difference]: With dead ends: 382447 [2019-12-07 18:24:43,716 INFO L226 Difference]: Without dead ends: 194378 [2019-12-07 18:24:43,792 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 414 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:24:43,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194378 states. [2019-12-07 18:24:45,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194378 to 175891. [2019-12-07 18:24:45,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175891 states. [2019-12-07 18:24:45,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175891 states to 175891 states and 188982 transitions. [2019-12-07 18:24:45,658 INFO L78 Accepts]: Start accepts. Automaton has 175891 states and 188982 transitions. Word has length 415 [2019-12-07 18:24:45,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:45,658 INFO L462 AbstractCegarLoop]: Abstraction has 175891 states and 188982 transitions. [2019-12-07 18:24:45,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:24:45,658 INFO L276 IsEmpty]: Start isEmpty. Operand 175891 states and 188982 transitions. [2019-12-07 18:24:45,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-12-07 18:24:45,686 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:45,687 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:24:45,887 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:24:45,888 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:45,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:45,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1842609697, now seen corresponding path program 1 times [2019-12-07 18:24:45,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:45,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532336817] [2019-12-07 18:24:45,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:46,426 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 251 proven. 8 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-12-07 18:24:46,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532336817] [2019-12-07 18:24:46,426 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918302898] [2019-12-07 18:24:46,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ba4d86db-0fe8-4195-a141-ef5096ee5d4b/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-12-07 18:24:46,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:46,567 INFO L264 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:24:46,570 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:24:46,677 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 321 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-12-07 18:24:46,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:24:46,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-12-07 18:24:46,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939489933] [2019-12-07 18:24:46,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:24:46,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:46,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:24:46,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:24:46,678 INFO L87 Difference]: Start difference. First operand 175891 states and 188982 transitions. Second operand 4 states. [2019-12-07 18:24:47,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:47,938 INFO L93 Difference]: Finished difference Result 351785 states and 377967 transitions. [2019-12-07 18:24:47,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:24:47,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 419 [2019-12-07 18:24:47,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:48,131 INFO L225 Difference]: With dead ends: 351785 [2019-12-07 18:24:48,131 INFO L226 Difference]: Without dead ends: 175896 [2019-12-07 18:24:48,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 426 GetRequests, 417 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:24:48,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175896 states. [2019-12-07 18:24:49,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175896 to 175891. [2019-12-07 18:24:49,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175891 states. [2019-12-07 18:24:50,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175891 states to 175891 states and 188154 transitions. [2019-12-07 18:24:50,270 INFO L78 Accepts]: Start accepts. Automaton has 175891 states and 188154 transitions. Word has length 419 [2019-12-07 18:24:50,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:50,270 INFO L462 AbstractCegarLoop]: Abstraction has 175891 states and 188154 transitions. [2019-12-07 18:24:50,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:24:50,270 INFO L276 IsEmpty]: Start isEmpty. Operand 175891 states and 188154 transitions. [2019-12-07 18:24:50,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2019-12-07 18:24:50,296 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:50,296 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:24:50,496 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:24:50,497 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:50,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:50,498 INFO L82 PathProgramCache]: Analyzing trace with hash -87735325, now seen corresponding path program 1 times [2019-12-07 18:24:50,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:50,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719481833] [2019-12-07 18:24:50,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:50,699 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 331 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2019-12-07 18:24:50,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719481833] [2019-12-07 18:24:50,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:50,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:24:50,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818536758] [2019-12-07 18:24:50,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:24:50,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:50,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:24:50,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:24:50,700 INFO L87 Difference]: Start difference. First operand 175891 states and 188154 transitions. Second operand 3 states. [2019-12-07 18:24:51,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:51,760 INFO L93 Difference]: Finished difference Result 401820 states and 429533 transitions. [2019-12-07 18:24:51,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:24:51,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 421 [2019-12-07 18:24:51,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:51,998 INFO L225 Difference]: With dead ends: 401820 [2019-12-07 18:24:51,998 INFO L226 Difference]: Without dead ends: 225931 [2019-12-07 18:24:52,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-07 18:24:52,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225931 states. [2019-12-07 18:24:54,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225931 to 225931. [2019-12-07 18:24:54,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225931 states. [2019-12-07 18:24:54,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225931 states to 225931 states and 241286 transitions. [2019-12-07 18:24:54,744 INFO L78 Accepts]: Start accepts. Automaton has 225931 states and 241286 transitions. Word has length 421 [2019-12-07 18:24:54,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:54,744 INFO L462 AbstractCegarLoop]: Abstraction has 225931 states and 241286 transitions. [2019-12-07 18:24:54,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:24:54,744 INFO L276 IsEmpty]: Start isEmpty. Operand 225931 states and 241286 transitions. [2019-12-07 18:24:54,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-12-07 18:24:54,771 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:54,772 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:24:54,772 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:54,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:54,772 INFO L82 PathProgramCache]: Analyzing trace with hash 866542192, now seen corresponding path program 1 times [2019-12-07 18:24:54,772 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:54,772 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581507334] [2019-12-07 18:24:54,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:54,959 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2019-12-07 18:24:54,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581507334] [2019-12-07 18:24:54,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:54,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:24:54,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34829612] [2019-12-07 18:24:54,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:24:54,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:54,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:24:54,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:24:54,960 INFO L87 Difference]: Start difference. First operand 225931 states and 241286 transitions. Second operand 4 states. [2019-12-07 18:24:56,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:24:56,506 INFO L93 Difference]: Finished difference Result 451050 states and 481735 transitions. [2019-12-07 18:24:56,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:24:56,506 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 441 [2019-12-07 18:24:56,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:24:56,730 INFO L225 Difference]: With dead ends: 451050 [2019-12-07 18:24:56,730 INFO L226 Difference]: Without dead ends: 225121 [2019-12-07 18:24:56,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:24:56,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225121 states. [2019-12-07 18:24:59,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225121 to 225119. [2019-12-07 18:24:59,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225119 states. [2019-12-07 18:24:59,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225119 states to 225119 states and 240368 transitions. [2019-12-07 18:24:59,412 INFO L78 Accepts]: Start accepts. Automaton has 225119 states and 240368 transitions. Word has length 441 [2019-12-07 18:24:59,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:24:59,413 INFO L462 AbstractCegarLoop]: Abstraction has 225119 states and 240368 transitions. [2019-12-07 18:24:59,413 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:24:59,413 INFO L276 IsEmpty]: Start isEmpty. Operand 225119 states and 240368 transitions. [2019-12-07 18:24:59,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2019-12-07 18:24:59,441 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:24:59,442 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:24:59,442 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:24:59,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:24:59,442 INFO L82 PathProgramCache]: Analyzing trace with hash 830855433, now seen corresponding path program 1 times [2019-12-07 18:24:59,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:24:59,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79630408] [2019-12-07 18:24:59,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:24:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:24:59,639 INFO L134 CoverageAnalysis]: Checked inductivity of 658 backedges. 273 proven. 0 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-12-07 18:24:59,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79630408] [2019-12-07 18:24:59,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:24:59,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:24:59,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781402032] [2019-12-07 18:24:59,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:24:59,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:24:59,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:24:59,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:24:59,640 INFO L87 Difference]: Start difference. First operand 225119 states and 240368 transitions. Second operand 5 states. [2019-12-07 18:25:01,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:01,965 INFO L93 Difference]: Finished difference Result 565497 states and 602551 transitions. [2019-12-07 18:25:01,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:25:01,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 469 [2019-12-07 18:25:01,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:02,308 INFO L225 Difference]: With dead ends: 565497 [2019-12-07 18:25:02,308 INFO L226 Difference]: Without dead ends: 340380 [2019-12-07 18:25:02,420 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:25:02,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340380 states. [2019-12-07 18:25:05,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340380 to 317003. [2019-12-07 18:25:05,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317003 states. [2019-12-07 18:25:06,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317003 states to 317003 states and 338013 transitions. [2019-12-07 18:25:06,296 INFO L78 Accepts]: Start accepts. Automaton has 317003 states and 338013 transitions. Word has length 469 [2019-12-07 18:25:06,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:06,297 INFO L462 AbstractCegarLoop]: Abstraction has 317003 states and 338013 transitions. [2019-12-07 18:25:06,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:25:06,297 INFO L276 IsEmpty]: Start isEmpty. Operand 317003 states and 338013 transitions. [2019-12-07 18:25:06,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2019-12-07 18:25:06,322 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:06,323 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:06,323 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:06,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:06,323 INFO L82 PathProgramCache]: Analyzing trace with hash 777925708, now seen corresponding path program 1 times [2019-12-07 18:25:06,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:06,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46243385] [2019-12-07 18:25:06,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:08,157 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 308 proven. 4 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-12-07 18:25:08,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46243385] [2019-12-07 18:25:08,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466816610] [2019-12-07 18:25:08,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ba4d86db-0fe8-4195-a141-ef5096ee5d4b/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-12-07 18:25:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:08,306 INFO L264 TraceCheckSpWp]: Trace formula consists of 737 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:25:08,309 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:08,446 INFO L134 CoverageAnalysis]: Checked inductivity of 502 backedges. 388 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-12-07 18:25:08,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:25:08,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-12-07 18:25:08,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088944898] [2019-12-07 18:25:08,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:25:08,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:08,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:25:08,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:25:08,447 INFO L87 Difference]: Start difference. First operand 317003 states and 338013 transitions. Second operand 4 states. [2019-12-07 18:25:10,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:10,364 INFO L93 Difference]: Finished difference Result 613865 states and 654416 transitions. [2019-12-07 18:25:10,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:25:10,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 472 [2019-12-07 18:25:10,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:10,668 INFO L225 Difference]: With dead ends: 613865 [2019-12-07 18:25:10,668 INFO L226 Difference]: Without dead ends: 296864 [2019-12-07 18:25:10,787 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 470 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:25:11,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296864 states. [2019-12-07 18:25:13,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296864 to 256644. [2019-12-07 18:25:13,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256644 states. [2019-12-07 18:25:14,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256644 states to 256644 states and 273489 transitions. [2019-12-07 18:25:14,006 INFO L78 Accepts]: Start accepts. Automaton has 256644 states and 273489 transitions. Word has length 472 [2019-12-07 18:25:14,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:14,006 INFO L462 AbstractCegarLoop]: Abstraction has 256644 states and 273489 transitions. [2019-12-07 18:25:14,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:25:14,007 INFO L276 IsEmpty]: Start isEmpty. Operand 256644 states and 273489 transitions. [2019-12-07 18:25:14,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2019-12-07 18:25:14,032 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:14,032 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:25:14,232 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:14,233 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:14,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:14,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1916997917, now seen corresponding path program 1 times [2019-12-07 18:25:14,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:14,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340089230] [2019-12-07 18:25:14,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:14,500 INFO L134 CoverageAnalysis]: Checked inductivity of 611 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-12-07 18:25:14,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340089230] [2019-12-07 18:25:14,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:14,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:25:14,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648438402] [2019-12-07 18:25:14,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:25:14,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:14,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:25:14,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:25:14,502 INFO L87 Difference]: Start difference. First operand 256644 states and 273489 transitions. Second operand 3 states. [2019-12-07 18:25:16,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:16,287 INFO L93 Difference]: Finished difference Result 566958 states and 603112 transitions. [2019-12-07 18:25:16,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:25:16,287 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 491 [2019-12-07 18:25:16,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:16,607 INFO L225 Difference]: With dead ends: 566958 [2019-12-07 18:25:16,607 INFO L226 Difference]: Without dead ends: 310316 [2019-12-07 18:25:16,700 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-12-07 18:25:16,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310316 states. [2019-12-07 18:25:20,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310316 to 300166. [2019-12-07 18:25:20,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300166 states. [2019-12-07 18:25:20,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300166 states to 300166 states and 318293 transitions. [2019-12-07 18:25:20,280 INFO L78 Accepts]: Start accepts. Automaton has 300166 states and 318293 transitions. Word has length 491 [2019-12-07 18:25:20,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:20,281 INFO L462 AbstractCegarLoop]: Abstraction has 300166 states and 318293 transitions. [2019-12-07 18:25:20,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:25:20,281 INFO L276 IsEmpty]: Start isEmpty. Operand 300166 states and 318293 transitions. [2019-12-07 18:25:20,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2019-12-07 18:25:20,311 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:20,311 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:20,311 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:20,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:20,312 INFO L82 PathProgramCache]: Analyzing trace with hash -184571190, now seen corresponding path program 1 times [2019-12-07 18:25:20,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:20,312 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196269819] [2019-12-07 18:25:20,312 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:20,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:21,207 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 445 proven. 61 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-12-07 18:25:21,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196269819] [2019-12-07 18:25:21,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563581340] [2019-12-07 18:25:21,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ba4d86db-0fe8-4195-a141-ef5096ee5d4b/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-12-07 18:25:21,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:21,366 INFO L264 TraceCheckSpWp]: Trace formula consists of 820 conjuncts, 25 conjunts are in the unsatisfiable core [2019-12-07 18:25:21,370 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:21,411 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 18:25:21,956 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 498 proven. 8 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-12-07 18:25:21,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:25:21,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-12-07 18:25:21,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816319218] [2019-12-07 18:25:21,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 18:25:21,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:21,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 18:25:21,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:25:21,957 INFO L87 Difference]: Start difference. First operand 300166 states and 318293 transitions. Second operand 11 states. [2019-12-07 18:25:26,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:26,294 INFO L93 Difference]: Finished difference Result 659315 states and 699128 transitions. [2019-12-07 18:25:26,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:25:26,295 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 511 [2019-12-07 18:25:26,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:26,664 INFO L225 Difference]: With dead ends: 659315 [2019-12-07 18:25:26,665 INFO L226 Difference]: Without dead ends: 359151 [2019-12-07 18:25:26,805 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 508 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:25:27,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359151 states. [2019-12-07 18:25:32,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359151 to 300777. [2019-12-07 18:25:32,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300777 states. [2019-12-07 18:25:32,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300777 states to 300777 states and 318938 transitions. [2019-12-07 18:25:32,618 INFO L78 Accepts]: Start accepts. Automaton has 300777 states and 318938 transitions. Word has length 511 [2019-12-07 18:25:32,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:32,619 INFO L462 AbstractCegarLoop]: Abstraction has 300777 states and 318938 transitions. [2019-12-07 18:25:32,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 18:25:32,619 INFO L276 IsEmpty]: Start isEmpty. Operand 300777 states and 318938 transitions. [2019-12-07 18:25:32,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 525 [2019-12-07 18:25:32,657 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:32,658 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:32,858 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:32,859 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:32,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:32,860 INFO L82 PathProgramCache]: Analyzing trace with hash 377478072, now seen corresponding path program 1 times [2019-12-07 18:25:32,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:32,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16264924] [2019-12-07 18:25:32,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:32,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:33,096 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 501 proven. 0 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-12-07 18:25:33,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16264924] [2019-12-07 18:25:33,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:33,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:25:33,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310133450] [2019-12-07 18:25:33,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:25:33,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:33,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:25:33,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:25:33,097 INFO L87 Difference]: Start difference. First operand 300777 states and 318938 transitions. Second operand 3 states. [2019-12-07 18:25:34,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:34,832 INFO L93 Difference]: Finished difference Result 530151 states and 562178 transitions. [2019-12-07 18:25:34,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:25:34,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 524 [2019-12-07 18:25:34,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:35,052 INFO L225 Difference]: With dead ends: 530151 [2019-12-07 18:25:35,052 INFO L226 Difference]: Without dead ends: 229175 [2019-12-07 18:25:35,158 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-12-07 18:25:35,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229175 states. [2019-12-07 18:25:37,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229175 to 183819. [2019-12-07 18:25:37,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183819 states. [2019-12-07 18:25:37,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183819 states to 183819 states and 193436 transitions. [2019-12-07 18:25:37,901 INFO L78 Accepts]: Start accepts. Automaton has 183819 states and 193436 transitions. Word has length 524 [2019-12-07 18:25:37,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:37,902 INFO L462 AbstractCegarLoop]: Abstraction has 183819 states and 193436 transitions. [2019-12-07 18:25:37,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:25:37,902 INFO L276 IsEmpty]: Start isEmpty. Operand 183819 states and 193436 transitions. [2019-12-07 18:25:37,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2019-12-07 18:25:37,916 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:37,916 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2019-12-07 18:25:37,916 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:37,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:37,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1806755140, now seen corresponding path program 1 times [2019-12-07 18:25:37,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:37,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192119545] [2019-12-07 18:25:37,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:38,830 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 464 proven. 61 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2019-12-07 18:25:38,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192119545] [2019-12-07 18:25:38,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104673871] [2019-12-07 18:25:38,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ba4d86db-0fe8-4195-a141-ef5096ee5d4b/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-12-07 18:25:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:38,986 INFO L264 TraceCheckSpWp]: Trace formula consists of 833 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:25:38,990 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:39,168 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 540 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2019-12-07 18:25:39,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:25:39,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2019-12-07 18:25:39,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326867666] [2019-12-07 18:25:39,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:25:39,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:39,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:25:39,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:25:39,170 INFO L87 Difference]: Start difference. First operand 183819 states and 193436 transitions. Second operand 4 states. [2019-12-07 18:25:40,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:40,324 INFO L93 Difference]: Finished difference Result 318817 states and 335360 transitions. [2019-12-07 18:25:40,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:25:40,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 528 [2019-12-07 18:25:40,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:40,443 INFO L225 Difference]: With dead ends: 318817 [2019-12-07 18:25:40,443 INFO L226 Difference]: Without dead ends: 135611 [2019-12-07 18:25:40,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 526 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:25:40,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135611 states. [2019-12-07 18:25:42,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135611 to 126022. [2019-12-07 18:25:42,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126022 states. [2019-12-07 18:25:42,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126022 states to 126022 states and 132073 transitions. [2019-12-07 18:25:42,190 INFO L78 Accepts]: Start accepts. Automaton has 126022 states and 132073 transitions. Word has length 528 [2019-12-07 18:25:42,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:42,190 INFO L462 AbstractCegarLoop]: Abstraction has 126022 states and 132073 transitions. [2019-12-07 18:25:42,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:25:42,190 INFO L276 IsEmpty]: Start isEmpty. Operand 126022 states and 132073 transitions. [2019-12-07 18:25:42,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2019-12-07 18:25:42,204 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:42,204 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:42,405 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:42,406 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:42,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:42,407 INFO L82 PathProgramCache]: Analyzing trace with hash 805635785, now seen corresponding path program 1 times [2019-12-07 18:25:42,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:42,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551345401] [2019-12-07 18:25:42,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:43,752 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 553 proven. 136 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-12-07 18:25:43,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551345401] [2019-12-07 18:25:43,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258527668] [2019-12-07 18:25:43,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ba4d86db-0fe8-4195-a141-ef5096ee5d4b/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-12-07 18:25:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:43,919 INFO L264 TraceCheckSpWp]: Trace formula consists of 866 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:25:43,922 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:44,117 INFO L134 CoverageAnalysis]: Checked inductivity of 803 backedges. 689 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-12-07 18:25:44,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:25:44,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2019-12-07 18:25:44,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436884605] [2019-12-07 18:25:44,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:25:44,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:44,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:25:44,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:25:44,118 INFO L87 Difference]: Start difference. First operand 126022 states and 132073 transitions. Second operand 4 states. [2019-12-07 18:25:45,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:45,208 INFO L93 Difference]: Finished difference Result 159149 states and 166565 transitions. [2019-12-07 18:25:45,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:25:45,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 552 [2019-12-07 18:25:45,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:45,221 INFO L225 Difference]: With dead ends: 159149 [2019-12-07 18:25:45,222 INFO L226 Difference]: Without dead ends: 17094 [2019-12-07 18:25:45,256 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 562 GetRequests, 550 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:25:45,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17094 states. [2019-12-07 18:25:45,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17094 to 7939. [2019-12-07 18:25:45,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7939 states. [2019-12-07 18:25:45,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7939 states to 7939 states and 8213 transitions. [2019-12-07 18:25:45,484 INFO L78 Accepts]: Start accepts. Automaton has 7939 states and 8213 transitions. Word has length 552 [2019-12-07 18:25:45,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:45,485 INFO L462 AbstractCegarLoop]: Abstraction has 7939 states and 8213 transitions. [2019-12-07 18:25:45,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:25:45,485 INFO L276 IsEmpty]: Start isEmpty. Operand 7939 states and 8213 transitions. [2019-12-07 18:25:45,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2019-12-07 18:25:45,491 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:45,491 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:25:45,691 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:45,692 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:45,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:45,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1566727996, now seen corresponding path program 1 times [2019-12-07 18:25:45,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:45,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027398991] [2019-12-07 18:25:45,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:46,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1032 backedges. 585 proven. 28 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2019-12-07 18:25:46,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027398991] [2019-12-07 18:25:46,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535076711] [2019-12-07 18:25:46,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ba4d86db-0fe8-4195-a141-ef5096ee5d4b/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-12-07 18:25:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:46,241 INFO L264 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 18:25:46,244 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:46,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1032 backedges. 585 proven. 0 refuted. 0 times theorem prover too weak. 447 trivial. 0 not checked. [2019-12-07 18:25:46,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:25:46,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-12-07 18:25:46,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825305805] [2019-12-07 18:25:46,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:25:46,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:46,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:25:46,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:25:46,422 INFO L87 Difference]: Start difference. First operand 7939 states and 8213 transitions. Second operand 3 states. [2019-12-07 18:25:46,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:46,619 INFO L93 Difference]: Finished difference Result 21368 states and 22139 transitions. [2019-12-07 18:25:46,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:25:46,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 603 [2019-12-07 18:25:46,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:46,627 INFO L225 Difference]: With dead ends: 21368 [2019-12-07 18:25:46,627 INFO L226 Difference]: Without dead ends: 14042 [2019-12-07 18:25:46,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 603 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:25:46,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14042 states. [2019-12-07 18:25:46,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14042 to 12824. [2019-12-07 18:25:46,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12824 states. [2019-12-07 18:25:46,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12824 states to 12824 states and 13323 transitions. [2019-12-07 18:25:46,743 INFO L78 Accepts]: Start accepts. Automaton has 12824 states and 13323 transitions. Word has length 603 [2019-12-07 18:25:46,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:46,744 INFO L462 AbstractCegarLoop]: Abstraction has 12824 states and 13323 transitions. [2019-12-07 18:25:46,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:25:46,744 INFO L276 IsEmpty]: Start isEmpty. Operand 12824 states and 13323 transitions. [2019-12-07 18:25:46,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2019-12-07 18:25:46,752 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:46,752 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:25:46,953 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:46,953 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:46,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:46,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1078339668, now seen corresponding path program 1 times [2019-12-07 18:25:46,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:46,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815931130] [2019-12-07 18:25:46,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:47,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:48,707 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 964 proven. 379 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-12-07 18:25:48,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815931130] [2019-12-07 18:25:48,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882002562] [2019-12-07 18:25:48,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ba4d86db-0fe8-4195-a141-ef5096ee5d4b/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-12-07 18:25:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:48,908 INFO L264 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 5 conjunts are in the unsatisfiable core [2019-12-07 18:25:48,913 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:25:49,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 1170 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2019-12-07 18:25:49,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-12-07 18:25:49,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 13 [2019-12-07 18:25:49,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376387492] [2019-12-07 18:25:49,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:25:49,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:49,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:25:49,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:25:49,394 INFO L87 Difference]: Start difference. First operand 12824 states and 13323 transitions. Second operand 5 states. [2019-12-07 18:25:50,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:50,213 INFO L93 Difference]: Finished difference Result 45175 states and 46981 transitions. [2019-12-07 18:25:50,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:25:50,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 692 [2019-12-07 18:25:50,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:50,233 INFO L225 Difference]: With dead ends: 45175 [2019-12-07 18:25:50,234 INFO L226 Difference]: Without dead ends: 32558 [2019-12-07 18:25:50,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 705 GetRequests, 689 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:25:50,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32558 states. [2019-12-07 18:25:50,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32558 to 31740. [2019-12-07 18:25:50,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31740 states. [2019-12-07 18:25:50,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31740 states to 31740 states and 33041 transitions. [2019-12-07 18:25:50,554 INFO L78 Accepts]: Start accepts. Automaton has 31740 states and 33041 transitions. Word has length 692 [2019-12-07 18:25:50,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:50,555 INFO L462 AbstractCegarLoop]: Abstraction has 31740 states and 33041 transitions. [2019-12-07 18:25:50,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:25:50,555 INFO L276 IsEmpty]: Start isEmpty. Operand 31740 states and 33041 transitions. [2019-12-07 18:25:50,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 962 [2019-12-07 18:25:50,576 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:50,577 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:25:50,777 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:25:50,777 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:50,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:50,779 INFO L82 PathProgramCache]: Analyzing trace with hash -186732457, now seen corresponding path program 1 times [2019-12-07 18:25:50,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:50,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553778038] [2019-12-07 18:25:50,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:51,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2966 backedges. 737 proven. 0 refuted. 0 times theorem prover too weak. 2229 trivial. 0 not checked. [2019-12-07 18:25:51,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553778038] [2019-12-07 18:25:51,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:51,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:25:51,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674792852] [2019-12-07 18:25:51,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:25:51,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:51,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:25:51,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:25:51,403 INFO L87 Difference]: Start difference. First operand 31740 states and 33041 transitions. Second operand 3 states. [2019-12-07 18:25:52,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:52,058 INFO L93 Difference]: Finished difference Result 74284 states and 77363 transitions. [2019-12-07 18:25:52,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:25:52,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 961 [2019-12-07 18:25:52,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:52,087 INFO L225 Difference]: With dead ends: 74284 [2019-12-07 18:25:52,087 INFO L226 Difference]: Without dead ends: 43157 [2019-12-07 18:25:52,099 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-07 18:25:52,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43157 states. [2019-12-07 18:25:52,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43157 to 31740. [2019-12-07 18:25:52,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31740 states. [2019-12-07 18:25:52,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31740 states to 31740 states and 33040 transitions. [2019-12-07 18:25:52,471 INFO L78 Accepts]: Start accepts. Automaton has 31740 states and 33040 transitions. Word has length 961 [2019-12-07 18:25:52,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:52,471 INFO L462 AbstractCegarLoop]: Abstraction has 31740 states and 33040 transitions. [2019-12-07 18:25:52,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:25:52,471 INFO L276 IsEmpty]: Start isEmpty. Operand 31740 states and 33040 transitions. [2019-12-07 18:25:52,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 969 [2019-12-07 18:25:52,493 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:52,494 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:25:52,494 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:52,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:52,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1569597196, now seen corresponding path program 1 times [2019-12-07 18:25:52,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:52,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077977394] [2019-12-07 18:25:52,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:52,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:54,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3028 backedges. 799 proven. 0 refuted. 0 times theorem prover too weak. 2229 trivial. 0 not checked. [2019-12-07 18:25:54,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077977394] [2019-12-07 18:25:54,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:54,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:25:54,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733998669] [2019-12-07 18:25:54,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 18:25:54,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:54,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 18:25:54,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:25:54,376 INFO L87 Difference]: Start difference. First operand 31740 states and 33040 transitions. Second operand 11 states. [2019-12-07 18:25:56,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:56,658 INFO L93 Difference]: Finished difference Result 79612 states and 82735 transitions. [2019-12-07 18:25:56,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:25:56,658 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 968 [2019-12-07 18:25:56,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:56,689 INFO L225 Difference]: With dead ends: 79612 [2019-12-07 18:25:56,689 INFO L226 Difference]: Without dead ends: 48485 [2019-12-07 18:25:56,704 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:25:56,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48485 states. [2019-12-07 18:25:57,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48485 to 31740. [2019-12-07 18:25:57,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31740 states. [2019-12-07 18:25:57,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31740 states to 31740 states and 33039 transitions. [2019-12-07 18:25:57,128 INFO L78 Accepts]: Start accepts. Automaton has 31740 states and 33039 transitions. Word has length 968 [2019-12-07 18:25:57,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:57,129 INFO L462 AbstractCegarLoop]: Abstraction has 31740 states and 33039 transitions. [2019-12-07 18:25:57,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 18:25:57,129 INFO L276 IsEmpty]: Start isEmpty. Operand 31740 states and 33039 transitions. [2019-12-07 18:25:57,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1064 [2019-12-07 18:25:57,152 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:57,152 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:25:57,153 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:57,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:57,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1995304239, now seen corresponding path program 1 times [2019-12-07 18:25:57,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:57,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24986716] [2019-12-07 18:25:57,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:57,915 INFO L134 CoverageAnalysis]: Checked inductivity of 3759 backedges. 2242 proven. 0 refuted. 0 times theorem prover too weak. 1517 trivial. 0 not checked. [2019-12-07 18:25:57,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24986716] [2019-12-07 18:25:57,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:57,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:25:57,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616289410] [2019-12-07 18:25:57,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:25:57,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:57,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:25:57,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:25:57,916 INFO L87 Difference]: Start difference. First operand 31740 states and 33039 transitions. Second operand 4 states. [2019-12-07 18:25:58,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:25:58,315 INFO L93 Difference]: Finished difference Result 74266 states and 77196 transitions. [2019-12-07 18:25:58,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:25:58,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1063 [2019-12-07 18:25:58,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:25:58,344 INFO L225 Difference]: With dead ends: 74266 [2019-12-07 18:25:58,344 INFO L226 Difference]: Without dead ends: 43139 [2019-12-07 18:25:58,358 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:25:58,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43139 states. [2019-12-07 18:25:58,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43139 to 41515. [2019-12-07 18:25:58,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41515 states. [2019-12-07 18:25:58,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41515 states to 41515 states and 43032 transitions. [2019-12-07 18:25:58,795 INFO L78 Accepts]: Start accepts. Automaton has 41515 states and 43032 transitions. Word has length 1063 [2019-12-07 18:25:58,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:25:58,796 INFO L462 AbstractCegarLoop]: Abstraction has 41515 states and 43032 transitions. [2019-12-07 18:25:58,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:25:58,796 INFO L276 IsEmpty]: Start isEmpty. Operand 41515 states and 43032 transitions. [2019-12-07 18:25:58,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1109 [2019-12-07 18:25:58,823 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:25:58,824 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 18:25:58,824 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:25:58,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:25:58,824 INFO L82 PathProgramCache]: Analyzing trace with hash 147166229, now seen corresponding path program 1 times [2019-12-07 18:25:58,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:25:58,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20807932] [2019-12-07 18:25:58,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:25:58,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:25:59,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4222 backedges. 2011 proven. 0 refuted. 0 times theorem prover too weak. 2211 trivial. 0 not checked. [2019-12-07 18:25:59,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20807932] [2019-12-07 18:25:59,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:25:59,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:25:59,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739185813] [2019-12-07 18:25:59,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:25:59,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:25:59,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:25:59,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:25:59,950 INFO L87 Difference]: Start difference. First operand 41515 states and 43032 transitions. Second operand 3 states. [2019-12-07 18:26:00,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:26:00,324 INFO L93 Difference]: Finished difference Result 57176 states and 59348 transitions. [2019-12-07 18:26:00,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:26:00,324 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1108 [2019-12-07 18:26:00,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:26:00,325 INFO L225 Difference]: With dead ends: 57176 [2019-12-07 18:26:00,325 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 18:26:00,335 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-07 18:26:00,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 18:26:00,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 18:26:00,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 18:26:00,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 18:26:00,336 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1108 [2019-12-07 18:26:00,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:26:00,336 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 18:26:00,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:26:00,336 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 18:26:00,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 18:26:00,338 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 18:26:10,049 WARN L192 SmtUtils]: Spent 9.69 s on a formula simplification. DAG size of input: 2742 DAG size of output: 2263 [2019-12-07 18:26:19,522 WARN L192 SmtUtils]: Spent 9.46 s on a formula simplification. DAG size of input: 2742 DAG size of output: 2263 [2019-12-07 18:27:00,169 WARN L192 SmtUtils]: Spent 40.63 s on a formula simplification. DAG size of input: 2063 DAG size of output: 300 [2019-12-07 18:27:41,114 WARN L192 SmtUtils]: Spent 40.93 s on a formula simplification. DAG size of input: 2063 DAG size of output: 300 [2019-12-07 18:27:41,117 INFO L246 CegarLoopResult]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-12-07 18:27:41,117 INFO L246 CegarLoopResult]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-12-07 18:27:41,117 INFO L246 CegarLoopResult]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,117 INFO L246 CegarLoopResult]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,117 INFO L246 CegarLoopResult]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,117 INFO L246 CegarLoopResult]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,117 INFO L246 CegarLoopResult]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,117 INFO L246 CegarLoopResult]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,117 INFO L246 CegarLoopResult]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,117 INFO L246 CegarLoopResult]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-12-07 18:27:41,117 INFO L246 CegarLoopResult]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,117 INFO L246 CegarLoopResult]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-12-07 18:27:41,118 INFO L246 CegarLoopResult]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-12-07 18:27:41,118 INFO L246 CegarLoopResult]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,118 INFO L246 CegarLoopResult]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,118 INFO L246 CegarLoopResult]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,118 INFO L246 CegarLoopResult]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,118 INFO L246 CegarLoopResult]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-12-07 18:27:41,118 INFO L246 CegarLoopResult]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-12-07 18:27:41,118 INFO L246 CegarLoopResult]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,118 INFO L246 CegarLoopResult]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,118 INFO L246 CegarLoopResult]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,118 INFO L246 CegarLoopResult]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,118 INFO L246 CegarLoopResult]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,118 INFO L246 CegarLoopResult]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,118 INFO L246 CegarLoopResult]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,118 INFO L246 CegarLoopResult]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,118 INFO L246 CegarLoopResult]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,118 INFO L246 CegarLoopResult]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,118 INFO L246 CegarLoopResult]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-12-07 18:27:41,118 INFO L246 CegarLoopResult]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-12-07 18:27:41,118 INFO L246 CegarLoopResult]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-12-07 18:27:41,118 INFO L246 CegarLoopResult]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,119 INFO L246 CegarLoopResult]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,119 INFO L246 CegarLoopResult]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,119 INFO L246 CegarLoopResult]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,119 INFO L246 CegarLoopResult]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,119 INFO L246 CegarLoopResult]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,119 INFO L246 CegarLoopResult]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-12-07 18:27:41,119 INFO L246 CegarLoopResult]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-12-07 18:27:41,119 INFO L246 CegarLoopResult]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-12-07 18:27:41,119 INFO L246 CegarLoopResult]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,119 INFO L246 CegarLoopResult]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,119 INFO L246 CegarLoopResult]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,119 INFO L246 CegarLoopResult]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,119 INFO L246 CegarLoopResult]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,119 INFO L246 CegarLoopResult]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,119 INFO L246 CegarLoopResult]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-12-07 18:27:41,119 INFO L246 CegarLoopResult]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-12-07 18:27:41,119 INFO L246 CegarLoopResult]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-12-07 18:27:41,119 INFO L246 CegarLoopResult]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,119 INFO L246 CegarLoopResult]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,119 INFO L246 CegarLoopResult]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,120 INFO L246 CegarLoopResult]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-12-07 18:27:41,120 INFO L246 CegarLoopResult]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,120 INFO L246 CegarLoopResult]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-12-07 18:27:41,120 INFO L246 CegarLoopResult]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,120 INFO L246 CegarLoopResult]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,120 INFO L246 CegarLoopResult]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-12-07 18:27:41,120 INFO L246 CegarLoopResult]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-12-07 18:27:41,120 INFO L246 CegarLoopResult]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,120 INFO L246 CegarLoopResult]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,120 INFO L246 CegarLoopResult]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,120 INFO L246 CegarLoopResult]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,120 INFO L246 CegarLoopResult]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,120 INFO L246 CegarLoopResult]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,120 INFO L246 CegarLoopResult]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,120 INFO L246 CegarLoopResult]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-12-07 18:27:41,120 INFO L246 CegarLoopResult]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-12-07 18:27:41,120 INFO L246 CegarLoopResult]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-12-07 18:27:41,120 INFO L246 CegarLoopResult]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-12-07 18:27:41,120 INFO L246 CegarLoopResult]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-12-07 18:27:41,120 INFO L246 CegarLoopResult]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,121 INFO L246 CegarLoopResult]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,121 INFO L246 CegarLoopResult]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,121 INFO L246 CegarLoopResult]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,121 INFO L246 CegarLoopResult]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,121 INFO L246 CegarLoopResult]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,121 INFO L246 CegarLoopResult]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,121 INFO L246 CegarLoopResult]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,121 INFO L246 CegarLoopResult]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,121 INFO L246 CegarLoopResult]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,121 INFO L246 CegarLoopResult]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-12-07 18:27:41,121 INFO L246 CegarLoopResult]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-12-07 18:27:41,121 INFO L246 CegarLoopResult]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-12-07 18:27:41,121 INFO L246 CegarLoopResult]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,121 INFO L246 CegarLoopResult]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,121 INFO L246 CegarLoopResult]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,121 INFO L246 CegarLoopResult]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,121 INFO L246 CegarLoopResult]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,121 INFO L246 CegarLoopResult]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,121 INFO L246 CegarLoopResult]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,121 INFO L246 CegarLoopResult]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,121 INFO L246 CegarLoopResult]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,122 INFO L246 CegarLoopResult]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-12-07 18:27:41,122 INFO L246 CegarLoopResult]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-12-07 18:27:41,122 INFO L246 CegarLoopResult]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-12-07 18:27:41,122 INFO L246 CegarLoopResult]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-12-07 18:27:41,122 INFO L246 CegarLoopResult]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-12-07 18:27:41,122 INFO L246 CegarLoopResult]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,122 INFO L246 CegarLoopResult]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,122 INFO L246 CegarLoopResult]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,122 INFO L246 CegarLoopResult]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,122 INFO L246 CegarLoopResult]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,122 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 18:27:41,122 INFO L246 CegarLoopResult]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,122 INFO L246 CegarLoopResult]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,122 INFO L246 CegarLoopResult]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,122 INFO L246 CegarLoopResult]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-12-07 18:27:41,122 INFO L246 CegarLoopResult]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-12-07 18:27:41,122 INFO L246 CegarLoopResult]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-12-07 18:27:41,122 INFO L246 CegarLoopResult]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,122 INFO L246 CegarLoopResult]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,122 INFO L246 CegarLoopResult]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,123 INFO L246 CegarLoopResult]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-12-07 18:27:41,123 INFO L246 CegarLoopResult]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-12-07 18:27:41,123 INFO L246 CegarLoopResult]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,123 INFO L246 CegarLoopResult]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,123 INFO L246 CegarLoopResult]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,123 INFO L246 CegarLoopResult]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-12-07 18:27:41,123 INFO L246 CegarLoopResult]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,123 INFO L246 CegarLoopResult]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-12-07 18:27:41,123 INFO L246 CegarLoopResult]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,123 INFO L246 CegarLoopResult]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-12-07 18:27:41,123 INFO L246 CegarLoopResult]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,123 INFO L246 CegarLoopResult]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,123 INFO L246 CegarLoopResult]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-12-07 18:27:41,123 INFO L246 CegarLoopResult]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-12-07 18:27:41,123 INFO L246 CegarLoopResult]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-12-07 18:27:41,123 INFO L246 CegarLoopResult]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-12-07 18:27:41,123 INFO L246 CegarLoopResult]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-12-07 18:27:41,123 INFO L246 CegarLoopResult]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-12-07 18:27:41,123 INFO L246 CegarLoopResult]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-12-07 18:27:41,123 INFO L246 CegarLoopResult]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,123 INFO L246 CegarLoopResult]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,124 INFO L246 CegarLoopResult]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,124 INFO L242 CegarLoopResult]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse1 (= ~a11~0 1)) (.cse6 (= ~a12~0 1))) (let ((.cse14 (<= ~a27~0 0)) (.cse4 (= ~a18~0 1)) (.cse19 (not .cse6)) (.cse13 (= ~a16~0 1)) (.cse10 (= ~a15~0 1)) (.cse15 (= 1 ~a3~0)) (.cse2 (<= ~a3~0 0)) (.cse18 (= ~a27~0 1)) (.cse5 (= 1 ~a5~0)) (.cse26 (= 1 ~a6~0)) (.cse23 (not .cse1)) (.cse12 (= ~a26~0 1)) (.cse11 (= 1 ~a8~0))) (let ((.cse21 (not .cse11)) (.cse9 (= 1 ~a4~0)) (.cse30 (= ~a12~0 ~a6~0)) (.cse25 (<= ~a23~0 0)) (.cse32 (or .cse11 .cse1)) (.cse29 (<= ~a7~0 0)) (.cse28 (or (and .cse18 .cse15 .cse5 .cse26 .cse6 .cse23 .cse12) (and .cse2 .cse18 .cse5 .cse26 .cse6 .cse23 .cse12))) (.cse24 (<= ~a26~0 0)) (.cse31 (or (and .cse2 .cse4 .cse5 .cse26 .cse19 .cse23 .cse12 .cse13 .cse10 .cse14) (and .cse2 .cse4 .cse5 .cse18 .cse26 .cse19 .cse23 .cse12 .cse13 .cse10))) (.cse0 (= 1 ~a1~0)) (.cse27 (<= 2 ~a3~0)) (.cse7 (= ~a22~0 1)) (.cse16 (<= ~a20~0 0)) (.cse22 (not (= 1 ~a7~0))) (.cse17 (= 0 ~a3~0)) (.cse3 (<= ~a6~0 0)) (.cse8 (= ~a29~0 1)) (.cse20 (= 1 ~a0~0))) (or (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (or (and .cse8 .cse9 .cse10) .cse11) .cse12 .cse13 .cse14) (and .cse3 .cse4 .cse5 .cse15 .cse6 .cse7 .cse12 .cse13 .cse14)) .cse16) (and .cse0 .cse4 .cse5 .cse17 .cse13 .cse3 .cse18 .cse19 .cse1 .cse8 .cse12 .cse20 .cse16) (and .cse0 .cse4 .cse5 .cse21 .cse22 .cse23 .cse13 .cse10 .cse9 .cse14 (or (= ~a19~0 1) (= ~a17~0 1) (not (= 2 ULTIMATE.start_calculate_output_~input))) .cse3 .cse15 .cse7 .cse19 .cse24 .cse8 .cse20 .cse25 .cse16) (and .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse22 .cse8 .cse23 .cse12 .cse13 .cse20) (and .cse4 .cse5 .cse22 .cse17 .cse23 .cse13 .cse14 .cse3 .cse6 .cse7 .cse8 .cse12 .cse20) (and .cse0 .cse4 .cse5 .cse26 .cse22 .cse23 .cse13 .cse10 .cse14 .cse27 .cse7 .cse8 .cse12 .cse20 .cse16) (and .cse0 .cse4 .cse5 .cse26 .cse22 .cse23 .cse13 .cse10 .cse27 .cse18 .cse7 .cse24 .cse8 .cse20 .cse25 .cse16) (and (or (and .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse22 .cse8 .cse23 .cse13 .cse20 .cse12) (and .cse3 .cse4 .cse5 .cse18 .cse6 .cse22 .cse23 .cse8 .cse13 .cse20 .cse12 .cse10)) .cse0 .cse16) (and .cse4 .cse7 .cse22 .cse28 .cse8 .cse13 .cse20) (and .cse2 .cse4 .cse18 .cse5 .cse26 .cse7 .cse19 .cse23 .cse8 .cse20 .cse12 .cse10) (and .cse0 .cse4 .cse5 .cse13 .cse29 .cse30 .cse27 .cse18 .cse6 .cse24 .cse8 .cse1 .cse20 .cse16) (and .cse4 .cse5 .cse26 .cse22 .cse23 .cse13 .cse10 .cse14 .cse15 .cse6 .cse7 .cse8 .cse24 .cse20 .cse25 .cse16) (and .cse4 .cse5 .cse18 .cse26 .cse6 .cse22 .cse17 .cse1 .cse20 .cse12) (and .cse0 .cse4 .cse5 .cse22 .cse13 .cse3 .cse27 .cse18 .cse19 .cse1 .cse8 .cse12 .cse20 .cse16) (and .cse0 .cse4 .cse5 .cse22 .cse13 .cse14 .cse30 .cse3 .cse27 .cse1 .cse24 .cse8 .cse20 .cse16) (and .cse7 .cse17 .cse8 .cse31 .cse20) (and .cse0 .cse4 .cse5 .cse22 .cse23 .cse13 .cse10 .cse14 .cse3 .cse27 .cse6 .cse8 .cse12 .cse20 .cse16) (and .cse4 .cse5 .cse22 .cse17 .cse23 .cse13 .cse10 .cse3 .cse18 .cse7 .cse19 .cse8 .cse24 .cse20) (and .cse0 .cse4 .cse18 .cse5 .cse26 .cse7 .cse17 .cse8 .cse20 .cse12 .cse13 .cse16) (and .cse4 .cse5 .cse17 .cse23 .cse13 .cse10 .cse30 .cse3 .cse18 .cse7 .cse19 .cse8 .cse20 .cse12) (and .cse0 .cse4 .cse5 .cse21 .cse22 .cse23 .cse13 .cse9 .cse10 .cse3 .cse18 .cse15 .cse7 .cse19 .cse24 .cse8 .cse20 .cse25 .cse16) (and .cse4 .cse7 .cse17 .cse28 .cse8 .cse13 .cse20) (and .cse2 .cse4 .cse18 .cse5 .cse26 .cse6 .cse22 .cse1 .cse13 .cse12) (and .cse0 .cse4 .cse5 .cse22 .cse13 .cse10 .cse3 .cse27 .cse18 .cse6 .cse7 .cse8 .cse12 .cse20 .cse16) (and .cse4 .cse18 .cse5 .cse15 .cse26 .cse7 .cse19 .cse23 .cse8 .cse20 .cse12) (and .cse0 .cse4 .cse5 .cse26 .cse22 .cse23 .cse13 .cse10 .cse14 .cse27 .cse7 .cse24 .cse8 .cse20 .cse16) (and .cse4 .cse17 .cse22 .cse28 .cse8 .cse13 .cse20) (and .cse0 .cse4 .cse5 .cse22 .cse23 .cse3 .cse18 .cse15 .cse6 .cse8 .cse20 .cse12 .cse16) (and .cse0 .cse4 .cse5 .cse22 .cse13 .cse10 .cse3 .cse27 .cse18 .cse19 .cse24 .cse8 .cse1 .cse20 .cse16) (and .cse32 .cse4 .cse5 .cse18 .cse15 .cse26 .cse19 .cse22 .cse23 .cse12) (and .cse4 .cse5 .cse15 .cse26 .cse19 .cse22 .cse23 .cse8 .cse13 .cse12 .cse10 .cse14) (and .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse22 .cse8 .cse23 .cse12 .cse20 .cse10) (and .cse2 .cse4 .cse5 .cse18 .cse26 .cse19 .cse22 .cse24 .cse8 .cse20 .cse13) (and .cse4 .cse5 .cse22 .cse13 .cse10 .cse2 .cse3 .cse18 .cse19 .cse24 .cse8 .cse1 .cse20) (and .cse4 .cse22 .cse28 .cse17 .cse13 .cse20 .cse10) (and .cse2 .cse4 .cse5 .cse18 .cse26 .cse7 .cse19 .cse1 .cse24 .cse8) (and .cse0 (or (and .cse4 .cse15 .cse5 .cse18 .cse26 .cse19 .cse8 .cse1 .cse20 .cse12) (and .cse4 .cse5 .cse18 .cse15 .cse26 .cse19 .cse1 .cse12 .cse10) (and .cse4 .cse5 .cse18 .cse15 .cse26 .cse7 .cse19 .cse1 .cse12) (and .cse4 .cse15 .cse5 .cse26 .cse19 .cse22 .cse8 .cse20 .cse12 .cse13 .cse10 .cse14)) .cse16) (and (or (and .cse4 .cse15 .cse5 .cse26 .cse19 .cse22 .cse23 .cse8 .cse12) (and .cse2 .cse4 .cse5 .cse26 .cse19 .cse22 .cse23 .cse8 .cse12)) .cse18) (and (or (and .cse4 .cse5 .cse22 .cse13 .cse10 .cse30 .cse3 .cse18 .cse15 .cse8 .cse1 .cse12 .cse20) (and (or (and .cse3 .cse4 .cse18 .cse15 .cse5 .cse6 .cse7 .cse22 .cse8 .cse13 .cse20) (and .cse3 .cse4 .cse5 .cse18 .cse6 .cse7 .cse17 .cse22 .cse8 .cse20 .cse13)) .cse12) (and .cse4 .cse5 .cse22 .cse13 .cse10 .cse14 .cse30 .cse3 .cse15 .cse7 .cse8 .cse12 .cse20) (and .cse4 .cse5 .cse17 .cse22 .cse13 .cse10 .cse14 .cse30 .cse3 .cse8 .cse1 .cse20 .cse12) (and .cse4 .cse5 .cse22 .cse17 .cse13 .cse10 .cse14 .cse3 .cse6 .cse7 .cse8 .cse12 .cse20)) .cse0 .cse16) (and .cse3 .cse4 .cse5 .cse18 .cse17 .cse19 .cse22 .cse1 .cse24 .cse8 .cse13 .cse20) (and .cse0 .cse4 .cse5 .cse26 .cse17 .cse22 .cse13 .cse10 .cse14 .cse6 .cse7 .cse8 .cse1 .cse12 .cse20 .cse16) (and .cse0 (or (and .cse3 .cse4 .cse15 .cse5 .cse19 .cse22 .cse23 .cse8 .cse13 .cse12 .cse10 .cse14) (and .cse3 .cse4 .cse5 .cse15 .cse7 .cse19 .cse22 .cse23 .cse8 .cse12 .cse13 .cse14)) .cse16) (and (or (and .cse3 .cse4 .cse5 .cse18 .cse6 .cse17 .cse22 .cse23 .cse8 .cse20) (and .cse3 .cse4 .cse5 .cse18 .cse6 .cse7 .cse17 .cse23 .cse8 .cse20)) .cse12) (and .cse2 .cse4 .cse5 .cse18 .cse26 .cse19 .cse22 .cse8 .cse13 .cse12) (and .cse0 .cse4 .cse5 .cse26 .cse17 .cse22 .cse13 .cse10 .cse18 .cse7 .cse1 .cse24 .cse8 .cse20 .cse25) (and .cse0 (or (and .cse4 .cse27 .cse5 .cse26 .cse22 .cse19 .cse8 .cse23 .cse24 .cse20 .cse13 .cse10) (and .cse4 .cse27 .cse5 .cse26 .cse19 .cse22 .cse23 .cse8 .cse12 .cse13 .cse20)) .cse16) (and .cse2 .cse4 .cse18 .cse5 .cse26 .cse7 .cse19 .cse23 .cse8 .cse20 .cse12 .cse13) (and .cse0 .cse4 .cse5 .cse26 .cse22 .cse13 .cse10 .cse27 (not .cse18) .cse19 .cse8 .cse20 .cse12 .cse25 .cse16) (and .cse32 .cse4 .cse28 .cse22 .cse17 .cse20 .cse10) (and .cse4 .cse15 .cse5 .cse26 .cse7 .cse19 .cse22 .cse23 .cse8 .cse12 .cse13 .cse14) (and .cse0 .cse4 .cse5 .cse26 .cse22 .cse23 .cse13 .cse18 .cse19 .cse24 .cse8 .cse20 .cse16) (and .cse0 .cse4 .cse5 .cse26 .cse22 .cse13 .cse10 .cse18 .cse7 .cse8 .cse12 .cse20 .cse16) (and .cse4 .cse5 .cse26 .cse17 .cse23 .cse13 .cse10 .cse29 .cse14 .cse6 .cse7 .cse24 .cse8 .cse20 .cse16) (and .cse4 .cse7 .cse28 .cse10) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse22 .cse24 .cse23 .cse14) (and .cse2 .cse4 .cse18 .cse5 .cse26 .cse6 .cse22 .cse8 .cse1 .cse12 .cse10) (and .cse22 .cse17 .cse8 .cse31 .cse20) (and .cse0 .cse4 .cse5 .cse26 .cse22 .cse13 .cse27 .cse18 .cse7 .cse8 .cse1 .cse20 .cse12 .cse16) (and .cse0 .cse4 .cse5 .cse22 .cse13 .cse14 .cse3 .cse27 .cse6 .cse7 .cse8 .cse12 .cse20 .cse16) (and .cse4 .cse5 .cse22 .cse17 .cse23 .cse13 .cse10 .cse14 .cse3 .cse6 .cse8 .cse12 .cse20))))) [2019-12-07 18:27:41,124 INFO L246 CegarLoopResult]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,124 INFO L246 CegarLoopResult]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,125 INFO L246 CegarLoopResult]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,125 INFO L246 CegarLoopResult]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-12-07 18:27:41,125 INFO L246 CegarLoopResult]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-12-07 18:27:41,125 INFO L246 CegarLoopResult]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,125 INFO L246 CegarLoopResult]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,125 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 18:27:41,125 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1566) no Hoare annotation was computed. [2019-12-07 18:27:41,125 INFO L246 CegarLoopResult]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,125 INFO L249 CegarLoopResult]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-12-07 18:27:41,125 INFO L246 CegarLoopResult]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,125 INFO L246 CegarLoopResult]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,125 INFO L246 CegarLoopResult]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,125 INFO L246 CegarLoopResult]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,125 INFO L246 CegarLoopResult]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,125 INFO L246 CegarLoopResult]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,125 INFO L246 CegarLoopResult]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-12-07 18:27:41,125 INFO L246 CegarLoopResult]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-12-07 18:27:41,125 INFO L246 CegarLoopResult]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,125 INFO L246 CegarLoopResult]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,125 INFO L246 CegarLoopResult]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,126 INFO L246 CegarLoopResult]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,126 INFO L246 CegarLoopResult]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,126 INFO L246 CegarLoopResult]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,126 INFO L246 CegarLoopResult]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,126 INFO L246 CegarLoopResult]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,126 INFO L246 CegarLoopResult]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,126 INFO L246 CegarLoopResult]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-12-07 18:27:41,126 INFO L246 CegarLoopResult]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-12-07 18:27:41,126 INFO L246 CegarLoopResult]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,126 INFO L246 CegarLoopResult]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,126 INFO L246 CegarLoopResult]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-12-07 18:27:41,126 INFO L246 CegarLoopResult]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-12-07 18:27:41,126 INFO L246 CegarLoopResult]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,127 INFO L242 CegarLoopResult]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse1 (= ~a11~0 1)) (.cse6 (= ~a12~0 1))) (let ((.cse14 (<= ~a27~0 0)) (.cse4 (= ~a18~0 1)) (.cse19 (not .cse6)) (.cse13 (= ~a16~0 1)) (.cse10 (= ~a15~0 1)) (.cse15 (= 1 ~a3~0)) (.cse2 (<= ~a3~0 0)) (.cse18 (= ~a27~0 1)) (.cse5 (= 1 ~a5~0)) (.cse26 (= 1 ~a6~0)) (.cse23 (not .cse1)) (.cse12 (= ~a26~0 1)) (.cse11 (= 1 ~a8~0))) (let ((.cse21 (not .cse11)) (.cse9 (= 1 ~a4~0)) (.cse30 (= ~a12~0 ~a6~0)) (.cse25 (<= ~a23~0 0)) (.cse32 (or .cse11 .cse1)) (.cse29 (<= ~a7~0 0)) (.cse28 (or (and .cse18 .cse15 .cse5 .cse26 .cse6 .cse23 .cse12) (and .cse2 .cse18 .cse5 .cse26 .cse6 .cse23 .cse12))) (.cse24 (<= ~a26~0 0)) (.cse31 (or (and .cse2 .cse4 .cse5 .cse26 .cse19 .cse23 .cse12 .cse13 .cse10 .cse14) (and .cse2 .cse4 .cse5 .cse18 .cse26 .cse19 .cse23 .cse12 .cse13 .cse10))) (.cse0 (= 1 ~a1~0)) (.cse27 (<= 2 ~a3~0)) (.cse7 (= ~a22~0 1)) (.cse16 (<= ~a20~0 0)) (.cse22 (not (= 1 ~a7~0))) (.cse17 (= 0 ~a3~0)) (.cse3 (<= ~a6~0 0)) (.cse8 (= ~a29~0 1)) (.cse20 (= 1 ~a0~0))) (or (and .cse0 .cse1 (or (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (or (and .cse8 .cse9 .cse10) .cse11) .cse12 .cse13 .cse14) (and .cse3 .cse4 .cse5 .cse15 .cse6 .cse7 .cse12 .cse13 .cse14)) .cse16) (and .cse0 .cse4 .cse5 .cse17 .cse13 .cse3 .cse18 .cse19 .cse1 .cse8 .cse12 .cse20 .cse16) (and .cse0 .cse4 .cse5 .cse21 .cse22 .cse23 .cse13 .cse10 .cse9 .cse14 (or (= ~a19~0 1) (= ~a17~0 1) (not (= 2 ULTIMATE.start_calculate_output_~input))) .cse3 .cse15 .cse7 .cse19 .cse24 .cse8 .cse20 .cse25 .cse16) (and .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse22 .cse8 .cse23 .cse12 .cse13 .cse20) (and .cse4 .cse5 .cse22 .cse17 .cse23 .cse13 .cse14 .cse3 .cse6 .cse7 .cse8 .cse12 .cse20) (and .cse0 .cse4 .cse5 .cse26 .cse22 .cse23 .cse13 .cse10 .cse14 .cse27 .cse7 .cse8 .cse12 .cse20 .cse16) (and .cse0 .cse4 .cse5 .cse26 .cse22 .cse23 .cse13 .cse10 .cse27 .cse18 .cse7 .cse24 .cse8 .cse20 .cse25 .cse16) (and (or (and .cse3 .cse4 .cse18 .cse5 .cse6 .cse7 .cse22 .cse8 .cse23 .cse13 .cse20 .cse12) (and .cse3 .cse4 .cse5 .cse18 .cse6 .cse22 .cse23 .cse8 .cse13 .cse20 .cse12 .cse10)) .cse0 .cse16) (and .cse4 .cse7 .cse22 .cse28 .cse8 .cse13 .cse20) (and .cse2 .cse4 .cse18 .cse5 .cse26 .cse7 .cse19 .cse23 .cse8 .cse20 .cse12 .cse10) (and .cse0 .cse4 .cse5 .cse13 .cse29 .cse30 .cse27 .cse18 .cse6 .cse24 .cse8 .cse1 .cse20 .cse16) (and .cse4 .cse5 .cse26 .cse22 .cse23 .cse13 .cse10 .cse14 .cse15 .cse6 .cse7 .cse8 .cse24 .cse20 .cse25 .cse16) (and .cse4 .cse5 .cse18 .cse26 .cse6 .cse22 .cse17 .cse1 .cse20 .cse12) (and .cse0 .cse4 .cse5 .cse22 .cse13 .cse3 .cse27 .cse18 .cse19 .cse1 .cse8 .cse12 .cse20 .cse16) (and .cse0 .cse4 .cse5 .cse22 .cse13 .cse14 .cse30 .cse3 .cse27 .cse1 .cse24 .cse8 .cse20 .cse16) (and .cse7 .cse17 .cse8 .cse31 .cse20) (and .cse0 .cse4 .cse5 .cse22 .cse23 .cse13 .cse10 .cse14 .cse3 .cse27 .cse6 .cse8 .cse12 .cse20 .cse16) (and .cse4 .cse5 .cse22 .cse17 .cse23 .cse13 .cse10 .cse3 .cse18 .cse7 .cse19 .cse8 .cse24 .cse20) (and .cse0 .cse4 .cse18 .cse5 .cse26 .cse7 .cse17 .cse8 .cse20 .cse12 .cse13 .cse16) (and .cse4 .cse5 .cse17 .cse23 .cse13 .cse10 .cse30 .cse3 .cse18 .cse7 .cse19 .cse8 .cse20 .cse12) (and .cse0 .cse4 .cse5 .cse21 .cse22 .cse23 .cse13 .cse9 .cse10 .cse3 .cse18 .cse15 .cse7 .cse19 .cse24 .cse8 .cse20 .cse25 .cse16) (and .cse4 .cse7 .cse17 .cse28 .cse8 .cse13 .cse20) (and .cse2 .cse4 .cse18 .cse5 .cse26 .cse6 .cse22 .cse1 .cse13 .cse12) (and .cse0 .cse4 .cse5 .cse22 .cse13 .cse10 .cse3 .cse27 .cse18 .cse6 .cse7 .cse8 .cse12 .cse20 .cse16) (and .cse4 .cse18 .cse5 .cse15 .cse26 .cse7 .cse19 .cse23 .cse8 .cse20 .cse12) (and .cse0 .cse4 .cse5 .cse26 .cse22 .cse23 .cse13 .cse10 .cse14 .cse27 .cse7 .cse24 .cse8 .cse20 .cse16) (and .cse4 .cse17 .cse22 .cse28 .cse8 .cse13 .cse20) (and .cse0 .cse4 .cse5 .cse22 .cse23 .cse3 .cse18 .cse15 .cse6 .cse8 .cse20 .cse12 .cse16) (and .cse0 .cse4 .cse5 .cse22 .cse13 .cse10 .cse3 .cse27 .cse18 .cse19 .cse24 .cse8 .cse1 .cse20 .cse16) (and .cse32 .cse4 .cse5 .cse18 .cse15 .cse26 .cse19 .cse22 .cse23 .cse12) (and .cse4 .cse5 .cse15 .cse26 .cse19 .cse22 .cse23 .cse8 .cse13 .cse12 .cse10 .cse14) (and .cse2 .cse3 .cse4 .cse18 .cse5 .cse6 .cse22 .cse8 .cse23 .cse12 .cse20 .cse10) (and .cse2 .cse4 .cse5 .cse18 .cse26 .cse19 .cse22 .cse24 .cse8 .cse20 .cse13) (and .cse4 .cse5 .cse22 .cse13 .cse10 .cse2 .cse3 .cse18 .cse19 .cse24 .cse8 .cse1 .cse20) (and .cse4 .cse22 .cse28 .cse17 .cse13 .cse20 .cse10) (and .cse2 .cse4 .cse5 .cse18 .cse26 .cse7 .cse19 .cse1 .cse24 .cse8) (and .cse0 (or (and .cse4 .cse15 .cse5 .cse18 .cse26 .cse19 .cse8 .cse1 .cse20 .cse12) (and .cse4 .cse5 .cse18 .cse15 .cse26 .cse19 .cse1 .cse12 .cse10) (and .cse4 .cse5 .cse18 .cse15 .cse26 .cse7 .cse19 .cse1 .cse12) (and .cse4 .cse15 .cse5 .cse26 .cse19 .cse22 .cse8 .cse20 .cse12 .cse13 .cse10 .cse14)) .cse16) (and (or (and .cse4 .cse15 .cse5 .cse26 .cse19 .cse22 .cse23 .cse8 .cse12) (and .cse2 .cse4 .cse5 .cse26 .cse19 .cse22 .cse23 .cse8 .cse12)) .cse18) (and (or (and .cse4 .cse5 .cse22 .cse13 .cse10 .cse30 .cse3 .cse18 .cse15 .cse8 .cse1 .cse12 .cse20) (and (or (and .cse3 .cse4 .cse18 .cse15 .cse5 .cse6 .cse7 .cse22 .cse8 .cse13 .cse20) (and .cse3 .cse4 .cse5 .cse18 .cse6 .cse7 .cse17 .cse22 .cse8 .cse20 .cse13)) .cse12) (and .cse4 .cse5 .cse22 .cse13 .cse10 .cse14 .cse30 .cse3 .cse15 .cse7 .cse8 .cse12 .cse20) (and .cse4 .cse5 .cse17 .cse22 .cse13 .cse10 .cse14 .cse30 .cse3 .cse8 .cse1 .cse20 .cse12) (and .cse4 .cse5 .cse22 .cse17 .cse13 .cse10 .cse14 .cse3 .cse6 .cse7 .cse8 .cse12 .cse20)) .cse0 .cse16) (and .cse3 .cse4 .cse5 .cse18 .cse17 .cse19 .cse22 .cse1 .cse24 .cse8 .cse13 .cse20) (and .cse0 .cse4 .cse5 .cse26 .cse17 .cse22 .cse13 .cse10 .cse14 .cse6 .cse7 .cse8 .cse1 .cse12 .cse20 .cse16) (and .cse0 (or (and .cse3 .cse4 .cse15 .cse5 .cse19 .cse22 .cse23 .cse8 .cse13 .cse12 .cse10 .cse14) (and .cse3 .cse4 .cse5 .cse15 .cse7 .cse19 .cse22 .cse23 .cse8 .cse12 .cse13 .cse14)) .cse16) (and (or (and .cse3 .cse4 .cse5 .cse18 .cse6 .cse17 .cse22 .cse23 .cse8 .cse20) (and .cse3 .cse4 .cse5 .cse18 .cse6 .cse7 .cse17 .cse23 .cse8 .cse20)) .cse12) (and .cse2 .cse4 .cse5 .cse18 .cse26 .cse19 .cse22 .cse8 .cse13 .cse12) (and .cse0 .cse4 .cse5 .cse26 .cse17 .cse22 .cse13 .cse10 .cse18 .cse7 .cse1 .cse24 .cse8 .cse20 .cse25) (and .cse0 (or (and .cse4 .cse27 .cse5 .cse26 .cse22 .cse19 .cse8 .cse23 .cse24 .cse20 .cse13 .cse10) (and .cse4 .cse27 .cse5 .cse26 .cse19 .cse22 .cse23 .cse8 .cse12 .cse13 .cse20)) .cse16) (and .cse2 .cse4 .cse18 .cse5 .cse26 .cse7 .cse19 .cse23 .cse8 .cse20 .cse12 .cse13) (and .cse0 .cse4 .cse5 .cse26 .cse22 .cse13 .cse10 .cse27 (not .cse18) .cse19 .cse8 .cse20 .cse12 .cse25 .cse16) (and .cse32 .cse4 .cse28 .cse22 .cse17 .cse20 .cse10) (and .cse4 .cse15 .cse5 .cse26 .cse7 .cse19 .cse22 .cse23 .cse8 .cse12 .cse13 .cse14) (and .cse0 .cse4 .cse5 .cse26 .cse22 .cse23 .cse13 .cse18 .cse19 .cse24 .cse8 .cse20 .cse16) (and .cse0 .cse4 .cse5 .cse26 .cse22 .cse13 .cse10 .cse18 .cse7 .cse8 .cse12 .cse20 .cse16) (and .cse4 .cse5 .cse26 .cse17 .cse23 .cse13 .cse10 .cse29 .cse14 .cse6 .cse7 .cse24 .cse8 .cse20 .cse16) (and .cse4 .cse7 .cse28 .cse10) (and .cse2 .cse3 .cse4 .cse5 .cse6 .cse22 .cse24 .cse23 .cse14) (and .cse2 .cse4 .cse18 .cse5 .cse26 .cse6 .cse22 .cse8 .cse1 .cse12 .cse10) (and .cse22 .cse17 .cse8 .cse31 .cse20) (and .cse0 .cse4 .cse5 .cse26 .cse22 .cse13 .cse27 .cse18 .cse7 .cse8 .cse1 .cse20 .cse12 .cse16) (and .cse0 .cse4 .cse5 .cse22 .cse13 .cse14 .cse3 .cse27 .cse6 .cse7 .cse8 .cse12 .cse20 .cse16) (and .cse4 .cse5 .cse22 .cse17 .cse23 .cse13 .cse10 .cse14 .cse3 .cse6 .cse8 .cse12 .cse20))))) [2019-12-07 18:27:41,127 INFO L246 CegarLoopResult]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,127 INFO L246 CegarLoopResult]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,127 INFO L246 CegarLoopResult]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,127 INFO L246 CegarLoopResult]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,127 INFO L246 CegarLoopResult]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-12-07 18:27:41,127 INFO L246 CegarLoopResult]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-12-07 18:27:41,127 INFO L246 CegarLoopResult]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,127 INFO L246 CegarLoopResult]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,127 INFO L246 CegarLoopResult]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,127 INFO L246 CegarLoopResult]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,127 INFO L246 CegarLoopResult]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,127 INFO L246 CegarLoopResult]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,127 INFO L246 CegarLoopResult]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,128 INFO L246 CegarLoopResult]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,128 INFO L246 CegarLoopResult]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-12-07 18:27:41,128 INFO L246 CegarLoopResult]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-12-07 18:27:41,128 INFO L246 CegarLoopResult]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-12-07 18:27:41,128 INFO L246 CegarLoopResult]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,128 INFO L246 CegarLoopResult]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-12-07 18:27:41,128 INFO L246 CegarLoopResult]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,128 INFO L246 CegarLoopResult]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,128 INFO L246 CegarLoopResult]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-12-07 18:27:41,128 INFO L246 CegarLoopResult]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,128 INFO L246 CegarLoopResult]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,128 INFO L246 CegarLoopResult]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,128 INFO L246 CegarLoopResult]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,128 INFO L246 CegarLoopResult]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,128 INFO L246 CegarLoopResult]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-12-07 18:27:41,128 INFO L246 CegarLoopResult]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,128 INFO L246 CegarLoopResult]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-12-07 18:27:41,128 INFO L246 CegarLoopResult]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-12-07 18:27:41,128 INFO L246 CegarLoopResult]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-12-07 18:27:41,128 INFO L246 CegarLoopResult]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,128 INFO L246 CegarLoopResult]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,129 INFO L246 CegarLoopResult]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,129 INFO L246 CegarLoopResult]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,129 INFO L246 CegarLoopResult]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,129 INFO L246 CegarLoopResult]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,129 INFO L246 CegarLoopResult]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,129 INFO L246 CegarLoopResult]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,129 INFO L246 CegarLoopResult]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-12-07 18:27:41,129 INFO L246 CegarLoopResult]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-12-07 18:27:41,129 INFO L246 CegarLoopResult]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,129 INFO L246 CegarLoopResult]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,129 INFO L246 CegarLoopResult]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-12-07 18:27:41,129 INFO L246 CegarLoopResult]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-12-07 18:27:41,129 INFO L246 CegarLoopResult]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-12-07 18:27:41,129 INFO L246 CegarLoopResult]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,129 INFO L246 CegarLoopResult]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,129 INFO L246 CegarLoopResult]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,129 INFO L246 CegarLoopResult]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,129 INFO L246 CegarLoopResult]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,129 INFO L246 CegarLoopResult]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,129 INFO L246 CegarLoopResult]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,129 INFO L246 CegarLoopResult]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,130 INFO L246 CegarLoopResult]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,130 INFO L246 CegarLoopResult]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,130 INFO L246 CegarLoopResult]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,130 INFO L246 CegarLoopResult]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-12-07 18:27:41,130 INFO L246 CegarLoopResult]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-12-07 18:27:41,130 INFO L246 CegarLoopResult]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-12-07 18:27:41,130 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 18:27:41,130 INFO L246 CegarLoopResult]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,130 INFO L246 CegarLoopResult]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,130 INFO L246 CegarLoopResult]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,130 INFO L246 CegarLoopResult]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,130 INFO L246 CegarLoopResult]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,130 INFO L246 CegarLoopResult]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,130 INFO L246 CegarLoopResult]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,130 INFO L246 CegarLoopResult]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-12-07 18:27:41,130 INFO L246 CegarLoopResult]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-12-07 18:27:41,130 INFO L246 CegarLoopResult]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,130 INFO L246 CegarLoopResult]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-12-07 18:27:41,130 INFO L246 CegarLoopResult]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-12-07 18:27:41,130 INFO L246 CegarLoopResult]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-12-07 18:27:41,131 INFO L246 CegarLoopResult]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,131 INFO L246 CegarLoopResult]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,131 INFO L246 CegarLoopResult]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,131 INFO L246 CegarLoopResult]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,131 INFO L246 CegarLoopResult]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,131 INFO L246 CegarLoopResult]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-12-07 18:27:41,131 INFO L246 CegarLoopResult]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-12-07 18:27:41,131 INFO L246 CegarLoopResult]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,131 INFO L246 CegarLoopResult]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,131 INFO L246 CegarLoopResult]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,131 INFO L246 CegarLoopResult]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-12-07 18:27:41,131 INFO L246 CegarLoopResult]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-12-07 18:27:41,131 INFO L246 CegarLoopResult]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,131 INFO L246 CegarLoopResult]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-12-07 18:27:41,131 INFO L246 CegarLoopResult]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,131 INFO L246 CegarLoopResult]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,131 INFO L246 CegarLoopResult]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,131 INFO L246 CegarLoopResult]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,131 INFO L246 CegarLoopResult]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,132 INFO L246 CegarLoopResult]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,132 INFO L246 CegarLoopResult]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,132 INFO L246 CegarLoopResult]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,132 INFO L246 CegarLoopResult]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,132 INFO L246 CegarLoopResult]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,132 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 18:27:41,132 INFO L246 CegarLoopResult]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-12-07 18:27:41,132 INFO L246 CegarLoopResult]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-12-07 18:27:41,132 INFO L246 CegarLoopResult]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-12-07 18:27:41,132 INFO L246 CegarLoopResult]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,132 INFO L246 CegarLoopResult]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-12-07 18:27:41,132 INFO L246 CegarLoopResult]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-12-07 18:27:41,132 INFO L246 CegarLoopResult]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,132 INFO L246 CegarLoopResult]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,132 INFO L246 CegarLoopResult]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,132 INFO L246 CegarLoopResult]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,132 INFO L246 CegarLoopResult]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,132 INFO L246 CegarLoopResult]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,132 INFO L246 CegarLoopResult]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,132 INFO L246 CegarLoopResult]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,132 INFO L246 CegarLoopResult]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,132 INFO L246 CegarLoopResult]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-12-07 18:27:41,133 INFO L246 CegarLoopResult]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-12-07 18:27:41,133 INFO L246 CegarLoopResult]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-12-07 18:27:41,133 INFO L246 CegarLoopResult]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,133 INFO L246 CegarLoopResult]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,133 INFO L246 CegarLoopResult]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,133 INFO L246 CegarLoopResult]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,133 INFO L246 CegarLoopResult]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-12-07 18:27:41,133 INFO L246 CegarLoopResult]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,133 INFO L246 CegarLoopResult]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-12-07 18:27:41,133 INFO L246 CegarLoopResult]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-12-07 18:27:41,133 INFO L246 CegarLoopResult]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,133 INFO L246 CegarLoopResult]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-12-07 18:27:41,133 INFO L246 CegarLoopResult]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-12-07 18:27:41,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:27:41 BoogieIcfgContainer [2019-12-07 18:27:41,180 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:27:41,180 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:27:41,181 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:27:41,181 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:27:41,181 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:24:06" (3/4) ... [2019-12-07 18:27:41,183 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 18:27:41,206 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-12-07 18:27:41,209 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-12-07 18:27:41,340 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ba4d86db-0fe8-4195-a141-ef5096ee5d4b/bin/uautomizer/witness.graphml [2019-12-07 18:27:41,340 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:27:41,341 INFO L168 Benchmark]: Toolchain (without parser) took 217184.45 ms. Allocated memory was 1.0 GB in the beginning and 6.3 GB in the end (delta: 5.3 GB). Free memory was 934.0 MB in the beginning and 1.3 GB in the end (delta: -410.3 MB). Peak memory consumption was 4.8 GB. Max. memory is 11.5 GB. [2019-12-07 18:27:41,341 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:27:41,341 INFO L168 Benchmark]: CACSL2BoogieTranslator took 626.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -119.3 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:27:41,341 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:27:41,341 INFO L168 Benchmark]: Boogie Preprocessor took 66.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:27:41,341 INFO L168 Benchmark]: RCFGBuilder took 1140.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 21.9 MB). Peak memory consumption was 189.8 MB. Max. memory is 11.5 GB. [2019-12-07 18:27:41,342 INFO L168 Benchmark]: TraceAbstraction took 215110.15 ms. Allocated memory was 1.2 GB in the beginning and 6.3 GB in the end (delta: 5.1 GB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -421.9 MB). Peak memory consumption was 5.0 GB. Max. memory is 11.5 GB. [2019-12-07 18:27:41,342 INFO L168 Benchmark]: Witness Printer took 159.23 ms. Allocated memory is still 6.3 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 82.2 MB). Peak memory consumption was 82.2 MB. Max. memory is 11.5 GB. [2019-12-07 18:27:41,343 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 626.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 934.0 MB in the beginning and 1.1 GB in the end (delta: -119.3 MB). Peak memory consumption was 33.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 78.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1140.63 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 21.9 MB). Peak memory consumption was 189.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 215110.15 ms. Allocated memory was 1.2 GB in the beginning and 6.3 GB in the end (delta: 5.1 GB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -421.9 MB). Peak memory consumption was 5.0 GB. Max. memory is 11.5 GB. * Witness Printer took 159.23 ms. Allocated memory is still 6.3 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 82.2 MB). Peak memory consumption was 82.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1566]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((1 == a1 && a11 == 1) && ((((((((((a3 <= 0 && a6 <= 0) && a18 == 1) && 1 == a5) && a12 == 1) && a22 == 1) && (((a29 == 1 && 1 == a4) && a15 == 1) || 1 == a8)) && a26 == 1) && a16 == 1) && a27 <= 0) || ((((((((a6 <= 0 && a18 == 1) && 1 == a5) && 1 == a3) && a12 == 1) && a22 == 1) && a26 == 1) && a16 == 1) && a27 <= 0))) && a20 <= 0) || ((((((((((((1 == a1 && a18 == 1) && 1 == a5) && 0 == a3) && a16 == 1) && a6 <= 0) && a27 == 1) && !(a12 == 1)) && a11 == 1) && a29 == 1) && a26 == 1) && 1 == a0) && a20 <= 0)) || (((((((((((((((((((1 == a1 && a18 == 1) && 1 == a5) && !(1 == a8)) && !(1 == a7)) && !(a11 == 1)) && a16 == 1) && a15 == 1) && 1 == a4) && a27 <= 0) && ((a19 == 1 || a17 == 1) || !(2 == input))) && a6 <= 0) && 1 == a3) && a22 == 1) && !(a12 == 1)) && a26 <= 0) && a29 == 1) && 1 == a0) && a23 <= 0) && a20 <= 0)) || (((((((((((a3 <= 0 && a6 <= 0) && a18 == 1) && a27 == 1) && 1 == a5) && a12 == 1) && !(1 == a7)) && a29 == 1) && !(a11 == 1)) && a26 == 1) && a16 == 1) && 1 == a0)) || ((((((((((((a18 == 1 && 1 == a5) && !(1 == a7)) && 0 == a3) && !(a11 == 1)) && a16 == 1) && a27 <= 0) && a6 <= 0) && a12 == 1) && a22 == 1) && a29 == 1) && a26 == 1) && 1 == a0)) || ((((((((((((((1 == a1 && a18 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && !(a11 == 1)) && a16 == 1) && a15 == 1) && a27 <= 0) && 2 <= a3) && a22 == 1) && a29 == 1) && a26 == 1) && 1 == a0) && a20 <= 0)) || (((((((((((((((1 == a1 && a18 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && !(a11 == 1)) && a16 == 1) && a15 == 1) && 2 <= a3) && a27 == 1) && a22 == 1) && a26 <= 0) && a29 == 1) && 1 == a0) && a23 <= 0) && a20 <= 0)) || ((((((((((((((a6 <= 0 && a18 == 1) && a27 == 1) && 1 == a5) && a12 == 1) && a22 == 1) && !(1 == a7)) && a29 == 1) && !(a11 == 1)) && a16 == 1) && 1 == a0) && a26 == 1) || (((((((((((a6 <= 0 && a18 == 1) && 1 == a5) && a27 == 1) && a12 == 1) && !(1 == a7)) && !(a11 == 1)) && a29 == 1) && a16 == 1) && 1 == a0) && a26 == 1) && a15 == 1)) && 1 == a1) && a20 <= 0)) || ((((((a18 == 1 && a22 == 1) && !(1 == a7)) && (((((((a27 == 1 && 1 == a3) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 == 1) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 == 1))) && a29 == 1) && a16 == 1) && 1 == a0)) || (((((((((((a3 <= 0 && a18 == 1) && a27 == 1) && 1 == a5) && 1 == a6) && a22 == 1) && !(a12 == 1)) && !(a11 == 1)) && a29 == 1) && 1 == a0) && a26 == 1) && a15 == 1)) || (((((((((((((1 == a1 && a18 == 1) && 1 == a5) && a16 == 1) && a7 <= 0) && a12 == a6) && 2 <= a3) && a27 == 1) && a12 == 1) && a26 <= 0) && a29 == 1) && a11 == 1) && 1 == a0) && a20 <= 0)) || (((((((((((((((a18 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && !(a11 == 1)) && a16 == 1) && a15 == 1) && a27 <= 0) && 1 == a3) && a12 == 1) && a22 == 1) && a29 == 1) && a26 <= 0) && 1 == a0) && a23 <= 0) && a20 <= 0)) || (((((((((a18 == 1 && 1 == a5) && a27 == 1) && 1 == a6) && a12 == 1) && !(1 == a7)) && 0 == a3) && a11 == 1) && 1 == a0) && a26 == 1)) || (((((((((((((1 == a1 && a18 == 1) && 1 == a5) && !(1 == a7)) && a16 == 1) && a6 <= 0) && 2 <= a3) && a27 == 1) && !(a12 == 1)) && a11 == 1) && a29 == 1) && a26 == 1) && 1 == a0) && a20 <= 0)) || (((((((((((((1 == a1 && a18 == 1) && 1 == a5) && !(1 == a7)) && a16 == 1) && a27 <= 0) && a12 == a6) && a6 <= 0) && 2 <= a3) && a11 == 1) && a26 <= 0) && a29 == 1) && 1 == a0) && a20 <= 0)) || ((((a22 == 1 && 0 == a3) && a29 == 1) && ((((((((((a3 <= 0 && a18 == 1) && 1 == a5) && 1 == a6) && !(a12 == 1)) && !(a11 == 1)) && a26 == 1) && a16 == 1) && a15 == 1) && a27 <= 0) || (((((((((a3 <= 0 && a18 == 1) && 1 == a5) && a27 == 1) && 1 == a6) && !(a12 == 1)) && !(a11 == 1)) && a26 == 1) && a16 == 1) && a15 == 1))) && 1 == a0)) || ((((((((((((((1 == a1 && a18 == 1) && 1 == a5) && !(1 == a7)) && !(a11 == 1)) && a16 == 1) && a15 == 1) && a27 <= 0) && a6 <= 0) && 2 <= a3) && a12 == 1) && a29 == 1) && a26 == 1) && 1 == a0) && a20 <= 0)) || (((((((((((((a18 == 1 && 1 == a5) && !(1 == a7)) && 0 == a3) && !(a11 == 1)) && a16 == 1) && a15 == 1) && a6 <= 0) && a27 == 1) && a22 == 1) && !(a12 == 1)) && a29 == 1) && a26 <= 0) && 1 == a0)) || (((((((((((1 == a1 && a18 == 1) && a27 == 1) && 1 == a5) && 1 == a6) && a22 == 1) && 0 == a3) && a29 == 1) && 1 == a0) && a26 == 1) && a16 == 1) && a20 <= 0)) || (((((((((((((a18 == 1 && 1 == a5) && 0 == a3) && !(a11 == 1)) && a16 == 1) && a15 == 1) && a12 == a6) && a6 <= 0) && a27 == 1) && a22 == 1) && !(a12 == 1)) && a29 == 1) && 1 == a0) && a26 == 1)) || ((((((((((((((((((1 == a1 && a18 == 1) && 1 == a5) && !(1 == a8)) && !(1 == a7)) && !(a11 == 1)) && a16 == 1) && 1 == a4) && a15 == 1) && a6 <= 0) && a27 == 1) && 1 == a3) && a22 == 1) && !(a12 == 1)) && a26 <= 0) && a29 == 1) && 1 == a0) && a23 <= 0) && a20 <= 0)) || ((((((a18 == 1 && a22 == 1) && 0 == a3) && (((((((a27 == 1 && 1 == a3) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 == 1) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 == 1))) && a29 == 1) && a16 == 1) && 1 == a0)) || (((((((((a3 <= 0 && a18 == 1) && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(1 == a7)) && a11 == 1) && a16 == 1) && a26 == 1)) || ((((((((((((((1 == a1 && a18 == 1) && 1 == a5) && !(1 == a7)) && a16 == 1) && a15 == 1) && a6 <= 0) && 2 <= a3) && a27 == 1) && a12 == 1) && a22 == 1) && a29 == 1) && a26 == 1) && 1 == a0) && a20 <= 0)) || ((((((((((a18 == 1 && a27 == 1) && 1 == a5) && 1 == a3) && 1 == a6) && a22 == 1) && !(a12 == 1)) && !(a11 == 1)) && a29 == 1) && 1 == a0) && a26 == 1)) || ((((((((((((((1 == a1 && a18 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && !(a11 == 1)) && a16 == 1) && a15 == 1) && a27 <= 0) && 2 <= a3) && a22 == 1) && a26 <= 0) && a29 == 1) && 1 == a0) && a20 <= 0)) || ((((((a18 == 1 && 0 == a3) && !(1 == a7)) && (((((((a27 == 1 && 1 == a3) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 == 1) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 == 1))) && a29 == 1) && a16 == 1) && 1 == a0)) || ((((((((((((1 == a1 && a18 == 1) && 1 == a5) && !(1 == a7)) && !(a11 == 1)) && a6 <= 0) && a27 == 1) && 1 == a3) && a12 == 1) && a29 == 1) && 1 == a0) && a26 == 1) && a20 <= 0)) || ((((((((((((((1 == a1 && a18 == 1) && 1 == a5) && !(1 == a7)) && a16 == 1) && a15 == 1) && a6 <= 0) && 2 <= a3) && a27 == 1) && !(a12 == 1)) && a26 <= 0) && a29 == 1) && a11 == 1) && 1 == a0) && a20 <= 0)) || ((((((((((1 == a8 || a11 == 1) && a18 == 1) && 1 == a5) && a27 == 1) && 1 == a3) && 1 == a6) && !(a12 == 1)) && !(1 == a7)) && !(a11 == 1)) && a26 == 1)) || (((((((((((a18 == 1 && 1 == a5) && 1 == a3) && 1 == a6) && !(a12 == 1)) && !(1 == a7)) && !(a11 == 1)) && a29 == 1) && a16 == 1) && a26 == 1) && a15 == 1) && a27 <= 0)) || (((((((((((a3 <= 0 && a6 <= 0) && a18 == 1) && a27 == 1) && 1 == a5) && a12 == 1) && !(1 == a7)) && a29 == 1) && !(a11 == 1)) && a26 == 1) && 1 == a0) && a15 == 1)) || ((((((((((a3 <= 0 && a18 == 1) && 1 == a5) && a27 == 1) && 1 == a6) && !(a12 == 1)) && !(1 == a7)) && a26 <= 0) && a29 == 1) && 1 == a0) && a16 == 1)) || ((((((((((((a18 == 1 && 1 == a5) && !(1 == a7)) && a16 == 1) && a15 == 1) && a3 <= 0) && a6 <= 0) && a27 == 1) && !(a12 == 1)) && a26 <= 0) && a29 == 1) && a11 == 1) && 1 == a0)) || ((((((a18 == 1 && !(1 == a7)) && (((((((a27 == 1 && 1 == a3) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 == 1) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 == 1))) && 0 == a3) && a16 == 1) && 1 == a0) && a15 == 1)) || (((((((((a3 <= 0 && a18 == 1) && 1 == a5) && a27 == 1) && 1 == a6) && a22 == 1) && !(a12 == 1)) && a11 == 1) && a26 <= 0) && a29 == 1)) || ((1 == a1 && ((((((((((((a18 == 1 && 1 == a3) && 1 == a5) && a27 == 1) && 1 == a6) && !(a12 == 1)) && a29 == 1) && a11 == 1) && 1 == a0) && a26 == 1) || ((((((((a18 == 1 && 1 == a5) && a27 == 1) && 1 == a3) && 1 == a6) && !(a12 == 1)) && a11 == 1) && a26 == 1) && a15 == 1)) || ((((((((a18 == 1 && 1 == a5) && a27 == 1) && 1 == a3) && 1 == a6) && a22 == 1) && !(a12 == 1)) && a11 == 1) && a26 == 1)) || (((((((((((a18 == 1 && 1 == a3) && 1 == a5) && 1 == a6) && !(a12 == 1)) && !(1 == a7)) && a29 == 1) && 1 == a0) && a26 == 1) && a16 == 1) && a15 == 1) && a27 <= 0))) && a20 <= 0)) || ((((((((((a18 == 1 && 1 == a3) && 1 == a5) && 1 == a6) && !(a12 == 1)) && !(1 == a7)) && !(a11 == 1)) && a29 == 1) && a26 == 1) || ((((((((a3 <= 0 && a18 == 1) && 1 == a5) && 1 == a6) && !(a12 == 1)) && !(1 == a7)) && !(a11 == 1)) && a29 == 1) && a26 == 1)) && a27 == 1)) || ((((((((((((((((((a18 == 1 && 1 == a5) && !(1 == a7)) && a16 == 1) && a15 == 1) && a12 == a6) && a6 <= 0) && a27 == 1) && 1 == a3) && a29 == 1) && a11 == 1) && a26 == 1) && 1 == a0) || ((((((((((((a6 <= 0 && a18 == 1) && a27 == 1) && 1 == a3) && 1 == a5) && a12 == 1) && a22 == 1) && !(1 == a7)) && a29 == 1) && a16 == 1) && 1 == a0) || ((((((((((a6 <= 0 && a18 == 1) && 1 == a5) && a27 == 1) && a12 == 1) && a22 == 1) && 0 == a3) && !(1 == a7)) && a29 == 1) && 1 == a0) && a16 == 1)) && a26 == 1)) || ((((((((((((a18 == 1 && 1 == a5) && !(1 == a7)) && a16 == 1) && a15 == 1) && a27 <= 0) && a12 == a6) && a6 <= 0) && 1 == a3) && a22 == 1) && a29 == 1) && a26 == 1) && 1 == a0)) || ((((((((((((a18 == 1 && 1 == a5) && 0 == a3) && !(1 == a7)) && a16 == 1) && a15 == 1) && a27 <= 0) && a12 == a6) && a6 <= 0) && a29 == 1) && a11 == 1) && 1 == a0) && a26 == 1)) || ((((((((((((a18 == 1 && 1 == a5) && !(1 == a7)) && 0 == a3) && a16 == 1) && a15 == 1) && a27 <= 0) && a6 <= 0) && a12 == 1) && a22 == 1) && a29 == 1) && a26 == 1) && 1 == a0)) && 1 == a1) && a20 <= 0)) || (((((((((((a6 <= 0 && a18 == 1) && 1 == a5) && a27 == 1) && 0 == a3) && !(a12 == 1)) && !(1 == a7)) && a11 == 1) && a26 <= 0) && a29 == 1) && a16 == 1) && 1 == a0)) || (((((((((((((((1 == a1 && a18 == 1) && 1 == a5) && 1 == a6) && 0 == a3) && !(1 == a7)) && a16 == 1) && a15 == 1) && a27 <= 0) && a12 == 1) && a22 == 1) && a29 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && a20 <= 0)) || ((1 == a1 && ((((((((((((a6 <= 0 && a18 == 1) && 1 == a3) && 1 == a5) && !(a12 == 1)) && !(1 == a7)) && !(a11 == 1)) && a29 == 1) && a16 == 1) && a26 == 1) && a15 == 1) && a27 <= 0) || (((((((((((a6 <= 0 && a18 == 1) && 1 == a5) && 1 == a3) && a22 == 1) && !(a12 == 1)) && !(1 == a7)) && !(a11 == 1)) && a29 == 1) && a26 == 1) && a16 == 1) && a27 <= 0))) && a20 <= 0)) || (((((((((((a6 <= 0 && a18 == 1) && 1 == a5) && a27 == 1) && a12 == 1) && 0 == a3) && !(1 == a7)) && !(a11 == 1)) && a29 == 1) && 1 == a0) || (((((((((a6 <= 0 && a18 == 1) && 1 == a5) && a27 == 1) && a12 == 1) && a22 == 1) && 0 == a3) && !(a11 == 1)) && a29 == 1) && 1 == a0)) && a26 == 1)) || (((((((((a3 <= 0 && a18 == 1) && 1 == a5) && a27 == 1) && 1 == a6) && !(a12 == 1)) && !(1 == a7)) && a29 == 1) && a16 == 1) && a26 == 1)) || ((((((((((((((1 == a1 && a18 == 1) && 1 == a5) && 1 == a6) && 0 == a3) && !(1 == a7)) && a16 == 1) && a15 == 1) && a27 == 1) && a22 == 1) && a11 == 1) && a26 <= 0) && a29 == 1) && 1 == a0) && a23 <= 0)) || ((1 == a1 && ((((((((((((a18 == 1 && 2 <= a3) && 1 == a5) && 1 == a6) && !(1 == a7)) && !(a12 == 1)) && a29 == 1) && !(a11 == 1)) && a26 <= 0) && 1 == a0) && a16 == 1) && a15 == 1) || ((((((((((a18 == 1 && 2 <= a3) && 1 == a5) && 1 == a6) && !(a12 == 1)) && !(1 == a7)) && !(a11 == 1)) && a29 == 1) && a26 == 1) && a16 == 1) && 1 == a0))) && a20 <= 0)) || (((((((((((a3 <= 0 && a18 == 1) && a27 == 1) && 1 == a5) && 1 == a6) && a22 == 1) && !(a12 == 1)) && !(a11 == 1)) && a29 == 1) && 1 == a0) && a26 == 1) && a16 == 1)) || ((((((((((((((1 == a1 && a18 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && a16 == 1) && a15 == 1) && 2 <= a3) && !(a27 == 1)) && !(a12 == 1)) && a29 == 1) && 1 == a0) && a26 == 1) && a23 <= 0) && a20 <= 0)) || (((((((1 == a8 || a11 == 1) && a18 == 1) && (((((((a27 == 1 && 1 == a3) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 == 1) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 == 1))) && !(1 == a7)) && 0 == a3) && 1 == a0) && a15 == 1)) || (((((((((((a18 == 1 && 1 == a3) && 1 == a5) && 1 == a6) && a22 == 1) && !(a12 == 1)) && !(1 == a7)) && !(a11 == 1)) && a29 == 1) && a26 == 1) && a16 == 1) && a27 <= 0)) || ((((((((((((1 == a1 && a18 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && !(a11 == 1)) && a16 == 1) && a27 == 1) && !(a12 == 1)) && a26 <= 0) && a29 == 1) && 1 == a0) && a20 <= 0)) || ((((((((((((1 == a1 && a18 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && a16 == 1) && a15 == 1) && a27 == 1) && a22 == 1) && a29 == 1) && a26 == 1) && 1 == a0) && a20 <= 0)) || ((((((((((((((a18 == 1 && 1 == a5) && 1 == a6) && 0 == a3) && !(a11 == 1)) && a16 == 1) && a15 == 1) && a7 <= 0) && a27 <= 0) && a12 == 1) && a22 == 1) && a26 <= 0) && a29 == 1) && 1 == a0) && a20 <= 0)) || (((a18 == 1 && a22 == 1) && (((((((a27 == 1 && 1 == a3) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 == 1) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 == 1))) && a15 == 1)) || ((((((((a3 <= 0 && a6 <= 0) && a18 == 1) && 1 == a5) && a12 == 1) && !(1 == a7)) && a26 <= 0) && !(a11 == 1)) && a27 <= 0)) || ((((((((((a3 <= 0 && a18 == 1) && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(1 == a7)) && a29 == 1) && a11 == 1) && a26 == 1) && a15 == 1)) || ((((!(1 == a7) && 0 == a3) && a29 == 1) && ((((((((((a3 <= 0 && a18 == 1) && 1 == a5) && 1 == a6) && !(a12 == 1)) && !(a11 == 1)) && a26 == 1) && a16 == 1) && a15 == 1) && a27 <= 0) || (((((((((a3 <= 0 && a18 == 1) && 1 == a5) && a27 == 1) && 1 == a6) && !(a12 == 1)) && !(a11 == 1)) && a26 == 1) && a16 == 1) && a15 == 1))) && 1 == a0)) || (((((((((((((1 == a1 && a18 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && a16 == 1) && 2 <= a3) && a27 == 1) && a22 == 1) && a29 == 1) && a11 == 1) && 1 == a0) && a26 == 1) && a20 <= 0)) || (((((((((((((1 == a1 && a18 == 1) && 1 == a5) && !(1 == a7)) && a16 == 1) && a27 <= 0) && a6 <= 0) && 2 <= a3) && a12 == 1) && a22 == 1) && a29 == 1) && a26 == 1) && 1 == a0) && a20 <= 0)) || ((((((((((((a18 == 1 && 1 == a5) && !(1 == a7)) && 0 == a3) && !(a11 == 1)) && a16 == 1) && a15 == 1) && a27 <= 0) && a6 <= 0) && a12 == 1) && a29 == 1) && a26 == 1) && 1 == a0) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((1 == a1 && a11 == 1) && ((((((((((a3 <= 0 && a6 <= 0) && a18 == 1) && 1 == a5) && a12 == 1) && a22 == 1) && (((a29 == 1 && 1 == a4) && a15 == 1) || 1 == a8)) && a26 == 1) && a16 == 1) && a27 <= 0) || ((((((((a6 <= 0 && a18 == 1) && 1 == a5) && 1 == a3) && a12 == 1) && a22 == 1) && a26 == 1) && a16 == 1) && a27 <= 0))) && a20 <= 0) || ((((((((((((1 == a1 && a18 == 1) && 1 == a5) && 0 == a3) && a16 == 1) && a6 <= 0) && a27 == 1) && !(a12 == 1)) && a11 == 1) && a29 == 1) && a26 == 1) && 1 == a0) && a20 <= 0)) || (((((((((((((((((((1 == a1 && a18 == 1) && 1 == a5) && !(1 == a8)) && !(1 == a7)) && !(a11 == 1)) && a16 == 1) && a15 == 1) && 1 == a4) && a27 <= 0) && ((a19 == 1 || a17 == 1) || !(2 == input))) && a6 <= 0) && 1 == a3) && a22 == 1) && !(a12 == 1)) && a26 <= 0) && a29 == 1) && 1 == a0) && a23 <= 0) && a20 <= 0)) || (((((((((((a3 <= 0 && a6 <= 0) && a18 == 1) && a27 == 1) && 1 == a5) && a12 == 1) && !(1 == a7)) && a29 == 1) && !(a11 == 1)) && a26 == 1) && a16 == 1) && 1 == a0)) || ((((((((((((a18 == 1 && 1 == a5) && !(1 == a7)) && 0 == a3) && !(a11 == 1)) && a16 == 1) && a27 <= 0) && a6 <= 0) && a12 == 1) && a22 == 1) && a29 == 1) && a26 == 1) && 1 == a0)) || ((((((((((((((1 == a1 && a18 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && !(a11 == 1)) && a16 == 1) && a15 == 1) && a27 <= 0) && 2 <= a3) && a22 == 1) && a29 == 1) && a26 == 1) && 1 == a0) && a20 <= 0)) || (((((((((((((((1 == a1 && a18 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && !(a11 == 1)) && a16 == 1) && a15 == 1) && 2 <= a3) && a27 == 1) && a22 == 1) && a26 <= 0) && a29 == 1) && 1 == a0) && a23 <= 0) && a20 <= 0)) || ((((((((((((((a6 <= 0 && a18 == 1) && a27 == 1) && 1 == a5) && a12 == 1) && a22 == 1) && !(1 == a7)) && a29 == 1) && !(a11 == 1)) && a16 == 1) && 1 == a0) && a26 == 1) || (((((((((((a6 <= 0 && a18 == 1) && 1 == a5) && a27 == 1) && a12 == 1) && !(1 == a7)) && !(a11 == 1)) && a29 == 1) && a16 == 1) && 1 == a0) && a26 == 1) && a15 == 1)) && 1 == a1) && a20 <= 0)) || ((((((a18 == 1 && a22 == 1) && !(1 == a7)) && (((((((a27 == 1 && 1 == a3) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 == 1) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 == 1))) && a29 == 1) && a16 == 1) && 1 == a0)) || (((((((((((a3 <= 0 && a18 == 1) && a27 == 1) && 1 == a5) && 1 == a6) && a22 == 1) && !(a12 == 1)) && !(a11 == 1)) && a29 == 1) && 1 == a0) && a26 == 1) && a15 == 1)) || (((((((((((((1 == a1 && a18 == 1) && 1 == a5) && a16 == 1) && a7 <= 0) && a12 == a6) && 2 <= a3) && a27 == 1) && a12 == 1) && a26 <= 0) && a29 == 1) && a11 == 1) && 1 == a0) && a20 <= 0)) || (((((((((((((((a18 == 1 && 1 == a5) && 1 == a6) && !(1 == a7)) && !(a11 == 1)) && a16 == 1) && a15 == 1) && a27 <= 0) && 1 == a3) && a12 == 1) && a22 == 1) && a29 == 1) && a26 <= 0) && 1 == a0) && a23 <= 0) && a20 <= 0)) || (((((((((a18 == 1 && 1 == a5) && a27 == 1) && 1 == a6) && a12 == 1) && !(1 == a7)) && 0 == a3) && a11 == 1) && 1 == a0) && a26 == 1)) || (((((((((((((1 == a1 && a18 == 1) && 1 == a5) && !(1 == a7)) && a16 == 1) && a6 <= 0) && 2 <= a3) && a27 == 1) && !(a12 == 1)) && a11 == 1) && a29 == 1) && a26 == 1) && 1 == a0) && a20 <= 0)) || (((((((((((((1 == a1 && a18 == 1) && 1 == a5) && !(1 == a7)) && a16 == 1) && a27 <= 0) && a12 == a6) && a6 <= 0) && 2 <= a3) && a11 == 1) && a26 <= 0) && a29 == 1) && 1 == a0) && a20 <= 0)) || ((((a22 == 1 && 0 == a3) && a29 == 1) && ((((((((((a3 <= 0 && a18 == 1) && 1 == a5) && 1 == a6) && !(a12 == 1)) && !(a11 == 1)) && a26 == 1) && a16 == 1) && a15 == 1) && a27 <= 0) || (((((((((a3 <= 0 && a18 == 1) && 1 == a5) && a27 == 1) && 1 == a6) && !(a12 == 1)) && !(a11 == 1)) && a26 == 1) && a16 == 1) && a15 == 1))) && 1 == a0)) || ((((((((((((((1 == a1 && a18 == 1) && 1 == a5) && !(1 == a7)) && !(a11 == 1)) && a16 == 1) && a15 == 1) && a27 <= 0) && a6 <= 0) && 2 <= a3) && a12 == 1) && a29 == 1) && a26 == 1) && 1 == a0) && a20 <= 0)) || (((((((((((((a18 == 1 && 1 == a5) && !(1 == a7)) && 0 == a3) && !(a11 == 1)) && a16 == 1) && a15 == 1) && a6 <= 0) && a27 == 1) && a22 == 1) && !(a12 == 1)) && a29 == 1) && a26 <= 0) && 1 == a0)) || (((((((((((1 == a1 && a18 == 1) && a27 == 1) && 1 == a5) && 1 == a6) && a22 == 1) && 0 == a3) && a29 == 1) && 1 == a0) && a26 == 1) && a16 == 1) && a20 <= 0)) || (((((((((((((a18 == 1 && 1 == a5) && 0 == a3) && !(a11 == 1)) && a16 == 1) && a15 == 1) && a12 == a6) && a6 <= 0) && a27 == 1) && a22 == 1) && !(a12 == 1)) && a29 == 1) && 1 == a0) && a26 == 1)) || ((((((((((((((((((1 == a1 && a18 == 1) && 1 == a5) && !(1 == a8)) && !(1 == a7)) && !(a11 == 1)) && a16 == 1) && 1 == a4) && a15 == 1) && a6 <= 0) && a27 == 1) && 1 == a3) && a22 == 1) && !(a12 == 1)) && a26 <= 0) && a29 == 1) && 1 == a0) && a23 <= 0) && a20 <= 0)) || ((((((a18 == 1 && a22 == 1) && 0 == a3) && (((((((a27 == 1 && 1 == a3) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 == 1) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 == 1))) && a29 == 1) && a16 == 1) && 1 == a0)) || (((((((((a3 <= 0 && a18 == 1) && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(1 == a7)) && a11 == 1) && a16 == 1) && a26 == 1)) || ((((((((((((((1 == a1 && a18 == 1) && 1 == a5) && !(1 == a7)) && a16 == 1) && a15 == 1) && a6 <= 0) && 2 <= a3) && a27 == 1) && a12 == 1) && a22 == 1) && a29 == 1) && a26 == 1) && 1 == a0) && a20 <= 0)) || ((((((((((a18 == 1 && a27 == 1) && 1 == a5) && 1 == a3) && 1 == a6) && a22 == 1) && !(a12 == 1)) && !(a11 == 1)) && a29 == 1) && 1 == a0) && a26 == 1)) || ((((((((((((((1 == a1 && a18 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && !(a11 == 1)) && a16 == 1) && a15 == 1) && a27 <= 0) && 2 <= a3) && a22 == 1) && a26 <= 0) && a29 == 1) && 1 == a0) && a20 <= 0)) || ((((((a18 == 1 && 0 == a3) && !(1 == a7)) && (((((((a27 == 1 && 1 == a3) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 == 1) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 == 1))) && a29 == 1) && a16 == 1) && 1 == a0)) || ((((((((((((1 == a1 && a18 == 1) && 1 == a5) && !(1 == a7)) && !(a11 == 1)) && a6 <= 0) && a27 == 1) && 1 == a3) && a12 == 1) && a29 == 1) && 1 == a0) && a26 == 1) && a20 <= 0)) || ((((((((((((((1 == a1 && a18 == 1) && 1 == a5) && !(1 == a7)) && a16 == 1) && a15 == 1) && a6 <= 0) && 2 <= a3) && a27 == 1) && !(a12 == 1)) && a26 <= 0) && a29 == 1) && a11 == 1) && 1 == a0) && a20 <= 0)) || ((((((((((1 == a8 || a11 == 1) && a18 == 1) && 1 == a5) && a27 == 1) && 1 == a3) && 1 == a6) && !(a12 == 1)) && !(1 == a7)) && !(a11 == 1)) && a26 == 1)) || (((((((((((a18 == 1 && 1 == a5) && 1 == a3) && 1 == a6) && !(a12 == 1)) && !(1 == a7)) && !(a11 == 1)) && a29 == 1) && a16 == 1) && a26 == 1) && a15 == 1) && a27 <= 0)) || (((((((((((a3 <= 0 && a6 <= 0) && a18 == 1) && a27 == 1) && 1 == a5) && a12 == 1) && !(1 == a7)) && a29 == 1) && !(a11 == 1)) && a26 == 1) && 1 == a0) && a15 == 1)) || ((((((((((a3 <= 0 && a18 == 1) && 1 == a5) && a27 == 1) && 1 == a6) && !(a12 == 1)) && !(1 == a7)) && a26 <= 0) && a29 == 1) && 1 == a0) && a16 == 1)) || ((((((((((((a18 == 1 && 1 == a5) && !(1 == a7)) && a16 == 1) && a15 == 1) && a3 <= 0) && a6 <= 0) && a27 == 1) && !(a12 == 1)) && a26 <= 0) && a29 == 1) && a11 == 1) && 1 == a0)) || ((((((a18 == 1 && !(1 == a7)) && (((((((a27 == 1 && 1 == a3) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 == 1) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 == 1))) && 0 == a3) && a16 == 1) && 1 == a0) && a15 == 1)) || (((((((((a3 <= 0 && a18 == 1) && 1 == a5) && a27 == 1) && 1 == a6) && a22 == 1) && !(a12 == 1)) && a11 == 1) && a26 <= 0) && a29 == 1)) || ((1 == a1 && ((((((((((((a18 == 1 && 1 == a3) && 1 == a5) && a27 == 1) && 1 == a6) && !(a12 == 1)) && a29 == 1) && a11 == 1) && 1 == a0) && a26 == 1) || ((((((((a18 == 1 && 1 == a5) && a27 == 1) && 1 == a3) && 1 == a6) && !(a12 == 1)) && a11 == 1) && a26 == 1) && a15 == 1)) || ((((((((a18 == 1 && 1 == a5) && a27 == 1) && 1 == a3) && 1 == a6) && a22 == 1) && !(a12 == 1)) && a11 == 1) && a26 == 1)) || (((((((((((a18 == 1 && 1 == a3) && 1 == a5) && 1 == a6) && !(a12 == 1)) && !(1 == a7)) && a29 == 1) && 1 == a0) && a26 == 1) && a16 == 1) && a15 == 1) && a27 <= 0))) && a20 <= 0)) || ((((((((((a18 == 1 && 1 == a3) && 1 == a5) && 1 == a6) && !(a12 == 1)) && !(1 == a7)) && !(a11 == 1)) && a29 == 1) && a26 == 1) || ((((((((a3 <= 0 && a18 == 1) && 1 == a5) && 1 == a6) && !(a12 == 1)) && !(1 == a7)) && !(a11 == 1)) && a29 == 1) && a26 == 1)) && a27 == 1)) || ((((((((((((((((((a18 == 1 && 1 == a5) && !(1 == a7)) && a16 == 1) && a15 == 1) && a12 == a6) && a6 <= 0) && a27 == 1) && 1 == a3) && a29 == 1) && a11 == 1) && a26 == 1) && 1 == a0) || ((((((((((((a6 <= 0 && a18 == 1) && a27 == 1) && 1 == a3) && 1 == a5) && a12 == 1) && a22 == 1) && !(1 == a7)) && a29 == 1) && a16 == 1) && 1 == a0) || ((((((((((a6 <= 0 && a18 == 1) && 1 == a5) && a27 == 1) && a12 == 1) && a22 == 1) && 0 == a3) && !(1 == a7)) && a29 == 1) && 1 == a0) && a16 == 1)) && a26 == 1)) || ((((((((((((a18 == 1 && 1 == a5) && !(1 == a7)) && a16 == 1) && a15 == 1) && a27 <= 0) && a12 == a6) && a6 <= 0) && 1 == a3) && a22 == 1) && a29 == 1) && a26 == 1) && 1 == a0)) || ((((((((((((a18 == 1 && 1 == a5) && 0 == a3) && !(1 == a7)) && a16 == 1) && a15 == 1) && a27 <= 0) && a12 == a6) && a6 <= 0) && a29 == 1) && a11 == 1) && 1 == a0) && a26 == 1)) || ((((((((((((a18 == 1 && 1 == a5) && !(1 == a7)) && 0 == a3) && a16 == 1) && a15 == 1) && a27 <= 0) && a6 <= 0) && a12 == 1) && a22 == 1) && a29 == 1) && a26 == 1) && 1 == a0)) && 1 == a1) && a20 <= 0)) || (((((((((((a6 <= 0 && a18 == 1) && 1 == a5) && a27 == 1) && 0 == a3) && !(a12 == 1)) && !(1 == a7)) && a11 == 1) && a26 <= 0) && a29 == 1) && a16 == 1) && 1 == a0)) || (((((((((((((((1 == a1 && a18 == 1) && 1 == a5) && 1 == a6) && 0 == a3) && !(1 == a7)) && a16 == 1) && a15 == 1) && a27 <= 0) && a12 == 1) && a22 == 1) && a29 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && a20 <= 0)) || ((1 == a1 && ((((((((((((a6 <= 0 && a18 == 1) && 1 == a3) && 1 == a5) && !(a12 == 1)) && !(1 == a7)) && !(a11 == 1)) && a29 == 1) && a16 == 1) && a26 == 1) && a15 == 1) && a27 <= 0) || (((((((((((a6 <= 0 && a18 == 1) && 1 == a5) && 1 == a3) && a22 == 1) && !(a12 == 1)) && !(1 == a7)) && !(a11 == 1)) && a29 == 1) && a26 == 1) && a16 == 1) && a27 <= 0))) && a20 <= 0)) || (((((((((((a6 <= 0 && a18 == 1) && 1 == a5) && a27 == 1) && a12 == 1) && 0 == a3) && !(1 == a7)) && !(a11 == 1)) && a29 == 1) && 1 == a0) || (((((((((a6 <= 0 && a18 == 1) && 1 == a5) && a27 == 1) && a12 == 1) && a22 == 1) && 0 == a3) && !(a11 == 1)) && a29 == 1) && 1 == a0)) && a26 == 1)) || (((((((((a3 <= 0 && a18 == 1) && 1 == a5) && a27 == 1) && 1 == a6) && !(a12 == 1)) && !(1 == a7)) && a29 == 1) && a16 == 1) && a26 == 1)) || ((((((((((((((1 == a1 && a18 == 1) && 1 == a5) && 1 == a6) && 0 == a3) && !(1 == a7)) && a16 == 1) && a15 == 1) && a27 == 1) && a22 == 1) && a11 == 1) && a26 <= 0) && a29 == 1) && 1 == a0) && a23 <= 0)) || ((1 == a1 && ((((((((((((a18 == 1 && 2 <= a3) && 1 == a5) && 1 == a6) && !(1 == a7)) && !(a12 == 1)) && a29 == 1) && !(a11 == 1)) && a26 <= 0) && 1 == a0) && a16 == 1) && a15 == 1) || ((((((((((a18 == 1 && 2 <= a3) && 1 == a5) && 1 == a6) && !(a12 == 1)) && !(1 == a7)) && !(a11 == 1)) && a29 == 1) && a26 == 1) && a16 == 1) && 1 == a0))) && a20 <= 0)) || (((((((((((a3 <= 0 && a18 == 1) && a27 == 1) && 1 == a5) && 1 == a6) && a22 == 1) && !(a12 == 1)) && !(a11 == 1)) && a29 == 1) && 1 == a0) && a26 == 1) && a16 == 1)) || ((((((((((((((1 == a1 && a18 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && a16 == 1) && a15 == 1) && 2 <= a3) && !(a27 == 1)) && !(a12 == 1)) && a29 == 1) && 1 == a0) && a26 == 1) && a23 <= 0) && a20 <= 0)) || (((((((1 == a8 || a11 == 1) && a18 == 1) && (((((((a27 == 1 && 1 == a3) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 == 1) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 == 1))) && !(1 == a7)) && 0 == a3) && 1 == a0) && a15 == 1)) || (((((((((((a18 == 1 && 1 == a3) && 1 == a5) && 1 == a6) && a22 == 1) && !(a12 == 1)) && !(1 == a7)) && !(a11 == 1)) && a29 == 1) && a26 == 1) && a16 == 1) && a27 <= 0)) || ((((((((((((1 == a1 && a18 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && !(a11 == 1)) && a16 == 1) && a27 == 1) && !(a12 == 1)) && a26 <= 0) && a29 == 1) && 1 == a0) && a20 <= 0)) || ((((((((((((1 == a1 && a18 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && a16 == 1) && a15 == 1) && a27 == 1) && a22 == 1) && a29 == 1) && a26 == 1) && 1 == a0) && a20 <= 0)) || ((((((((((((((a18 == 1 && 1 == a5) && 1 == a6) && 0 == a3) && !(a11 == 1)) && a16 == 1) && a15 == 1) && a7 <= 0) && a27 <= 0) && a12 == 1) && a22 == 1) && a26 <= 0) && a29 == 1) && 1 == a0) && a20 <= 0)) || (((a18 == 1 && a22 == 1) && (((((((a27 == 1 && 1 == a3) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 == 1) || ((((((a3 <= 0 && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(a11 == 1)) && a26 == 1))) && a15 == 1)) || ((((((((a3 <= 0 && a6 <= 0) && a18 == 1) && 1 == a5) && a12 == 1) && !(1 == a7)) && a26 <= 0) && !(a11 == 1)) && a27 <= 0)) || ((((((((((a3 <= 0 && a18 == 1) && a27 == 1) && 1 == a5) && 1 == a6) && a12 == 1) && !(1 == a7)) && a29 == 1) && a11 == 1) && a26 == 1) && a15 == 1)) || ((((!(1 == a7) && 0 == a3) && a29 == 1) && ((((((((((a3 <= 0 && a18 == 1) && 1 == a5) && 1 == a6) && !(a12 == 1)) && !(a11 == 1)) && a26 == 1) && a16 == 1) && a15 == 1) && a27 <= 0) || (((((((((a3 <= 0 && a18 == 1) && 1 == a5) && a27 == 1) && 1 == a6) && !(a12 == 1)) && !(a11 == 1)) && a26 == 1) && a16 == 1) && a15 == 1))) && 1 == a0)) || (((((((((((((1 == a1 && a18 == 1) && 1 == a5) && 1 == a6) && !(1 == a7)) && a16 == 1) && 2 <= a3) && a27 == 1) && a22 == 1) && a29 == 1) && a11 == 1) && 1 == a0) && a26 == 1) && a20 <= 0)) || (((((((((((((1 == a1 && a18 == 1) && 1 == a5) && !(1 == a7)) && a16 == 1) && a27 <= 0) && a6 <= 0) && 2 <= a3) && a12 == 1) && a22 == 1) && a29 == 1) && a26 == 1) && 1 == a0) && a20 <= 0)) || ((((((((((((a18 == 1 && 1 == a5) && !(1 == a7)) && 0 == a3) && !(a11 == 1)) && a16 == 1) && a15 == 1) && a27 <= 0) && a6 <= 0) && a12 == 1) && a29 == 1) && a26 == 1) && 1 == a0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 114.2s, OverallIterations: 38, TraceHistogramMax: 12, AutomataDifference: 47.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 100.7s, HoareTripleCheckerStatistics: 5687 SDtfs, 15886 SDslu, 3953 SDs, 0 SdLazy, 28998 SolverSat, 4912 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5643 GetRequests, 5475 SyntacticMatches, 17 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=317003occurred in iteration=26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 40.8s AutomataMinimizationTime, 38 MinimizatonAttempts, 372947 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 342 NumberOfFragments, 6615 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1853008 FormulaSimplificationTreeSizeReduction, 19.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2115284 FormulaSimplificationTreeSizeReductionInter, 81.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 1.2s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 7.1s InterpolantComputationTime, 22001 NumberOfCodeBlocks, 22001 NumberOfCodeBlocksAsserted, 50 NumberOfCheckSat, 21951 ConstructedInterpolants, 0 QuantifiedInterpolants, 50286451 SizeOfPredicates, 30 NumberOfNonLiveVariables, 8848 ConjunctsInSsa, 69 ConjunctsInUnsatCore, 50 InterpolantComputations, 37 PerfectInterpolantSequences, 32421/33408 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 correct! Received shutdown request...