./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem14_label04.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_4b83e986-8c50-44a5-ae80-88b44ebbadc7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_4b83e986-8c50-44a5-ae80-88b44ebbadc7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_4b83e986-8c50-44a5-ae80-88b44ebbadc7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_4b83e986-8c50-44a5-ae80-88b44ebbadc7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem14_label04.c -s /tmp/vcloud-vcloud-master/worker/run_dir_4b83e986-8c50-44a5-ae80-88b44ebbadc7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_4b83e986-8c50-44a5-ae80-88b44ebbadc7/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 e4f93eb95cdae688384271d92bae052385a66833 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:52:20,768 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:52:20,769 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:52:20,783 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:52:20,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:52:20,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:52:20,787 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:52:20,796 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:52:20,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:52:20,805 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:52:20,806 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:52:20,807 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:52:20,808 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:52:20,810 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:52:20,810 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:52:20,811 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:52:20,812 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:52:20,813 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:52:20,815 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:52:20,818 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:52:20,821 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:52:20,823 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:52:20,826 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:52:20,827 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:52:20,829 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:52:20,830 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:52:20,830 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:52:20,832 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:52:20,832 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:52:20,833 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:52:20,833 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:52:20,834 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:52:20,834 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:52:20,835 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:52:20,836 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:52:20,836 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:52:20,837 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:52:20,837 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:52:20,838 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:52:20,838 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:52:20,839 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:52:20,840 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_4b83e986-8c50-44a5-ae80-88b44ebbadc7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:52:20,863 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:52:20,864 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:52:20,865 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:52:20,865 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:52:20,865 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:52:20,866 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:52:20,866 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:52:20,866 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:52:20,866 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:52:20,866 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:52:20,867 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:52:20,867 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:52:20,867 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:52:20,867 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:52:20,868 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:52:20,868 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:52:20,868 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:52:20,868 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:52:20,869 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:52:20,869 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:52:20,869 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:52:20,869 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:52:20,870 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:52:20,870 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:52:20,870 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:52:20,870 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:52:20,871 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:52:20,871 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:52:20,871 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_4b83e986-8c50-44a5-ae80-88b44ebbadc7/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 -> e4f93eb95cdae688384271d92bae052385a66833 [2019-11-15 23:52:20,896 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:52:20,906 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:52:20,908 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:52:20,910 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:52:20,910 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:52:20,911 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_4b83e986-8c50-44a5-ae80-88b44ebbadc7/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem14_label04.c [2019-11-15 23:52:20,960 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4b83e986-8c50-44a5-ae80-88b44ebbadc7/bin/uautomizer/data/47c67bd29/e2e56dc4aebb48e4a85b3276e76d3217/FLAG77fae624a [2019-11-15 23:52:21,442 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:52:21,442 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_4b83e986-8c50-44a5-ae80-88b44ebbadc7/sv-benchmarks/c/eca-rers2012/Problem14_label04.c [2019-11-15 23:52:21,464 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_4b83e986-8c50-44a5-ae80-88b44ebbadc7/bin/uautomizer/data/47c67bd29/e2e56dc4aebb48e4a85b3276e76d3217/FLAG77fae624a [2019-11-15 23:52:21,696 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_4b83e986-8c50-44a5-ae80-88b44ebbadc7/bin/uautomizer/data/47c67bd29/e2e56dc4aebb48e4a85b3276e76d3217 [2019-11-15 23:52:21,702 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:52:21,703 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:52:21,704 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:52:21,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:52:21,708 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:52:21,708 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:52:21" (1/1) ... [2019-11-15 23:52:21,710 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ee03a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:21, skipping insertion in model container [2019-11-15 23:52:21,710 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:52:21" (1/1) ... [2019-11-15 23:52:21,717 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:52:21,781 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:52:22,221 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:52:22,226 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:52:22,338 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:52:22,352 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:52:22,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:22 WrapperNode [2019-11-15 23:52:22,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:52:22,354 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:52:22,354 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:52:22,354 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:52:22,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:22" (1/1) ... [2019-11-15 23:52:22,383 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:22" (1/1) ... [2019-11-15 23:52:22,458 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:52:22,459 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:52:22,460 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:52:22,460 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:52:22,469 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:22" (1/1) ... [2019-11-15 23:52:22,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:22" (1/1) ... [2019-11-15 23:52:22,486 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:22" (1/1) ... [2019-11-15 23:52:22,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:22" (1/1) ... [2019-11-15 23:52:22,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:22" (1/1) ... [2019-11-15 23:52:22,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:22" (1/1) ... [2019-11-15 23:52:22,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:22" (1/1) ... [2019-11-15 23:52:22,581 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:52:22,581 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:52:22,581 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:52:22,582 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:52:22,583 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b83e986-8c50-44a5-ae80-88b44ebbadc7/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:52:22,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:52:22,650 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:52:24,293 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:52:24,294 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 23:52:24,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:52:24 BoogieIcfgContainer [2019-11-15 23:52:24,295 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:52:24,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:52:24,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:52:24,300 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:52:24,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:52:21" (1/3) ... [2019-11-15 23:52:24,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c1574c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:52:24, skipping insertion in model container [2019-11-15 23:52:24,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:52:22" (2/3) ... [2019-11-15 23:52:24,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20c1574c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:52:24, skipping insertion in model container [2019-11-15 23:52:24,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:52:24" (3/3) ... [2019-11-15 23:52:24,304 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem14_label04.c [2019-11-15 23:52:24,313 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:52:24,323 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 23:52:24,334 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 23:52:24,368 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:52:24,368 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:52:24,368 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:52:24,368 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:52:24,369 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:52:24,369 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:52:24,369 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:52:24,369 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:52:24,393 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states. [2019-11-15 23:52:24,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 23:52:24,405 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:24,406 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:24,407 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:24,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:24,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1382487458, now seen corresponding path program 1 times [2019-11-15 23:52:24,421 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:24,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682167067] [2019-11-15 23:52:24,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:24,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:24,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:24,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:24,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682167067] [2019-11-15 23:52:24,743 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:24,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:52:24,744 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721886568] [2019-11-15 23:52:24,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:52:24,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:24,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:52:24,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:52:24,765 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 4 states. [2019-11-15 23:52:26,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:26,869 INFO L93 Difference]: Finished difference Result 850 states and 1558 transitions. [2019-11-15 23:52:26,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:52:26,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-15 23:52:26,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:26,898 INFO L225 Difference]: With dead ends: 850 [2019-11-15 23:52:26,898 INFO L226 Difference]: Without dead ends: 538 [2019-11-15 23:52:26,903 INFO L600 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-11-15 23:52:26,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2019-11-15 23:52:27,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 538. [2019-11-15 23:52:27,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-11-15 23:52:27,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 826 transitions. [2019-11-15 23:52:27,020 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 826 transitions. Word has length 52 [2019-11-15 23:52:27,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:27,021 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 826 transitions. [2019-11-15 23:52:27,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:52:27,021 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 826 transitions. [2019-11-15 23:52:27,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-15 23:52:27,033 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:27,034 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:27,034 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:27,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:27,034 INFO L82 PathProgramCache]: Analyzing trace with hash 106118808, now seen corresponding path program 1 times [2019-11-15 23:52:27,034 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:27,035 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272909647] [2019-11-15 23:52:27,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:27,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:27,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:27,228 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:27,229 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272909647] [2019-11-15 23:52:27,229 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:27,229 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:52:27,230 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369948632] [2019-11-15 23:52:27,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:52:27,232 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:27,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:52:27,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:52:27,232 INFO L87 Difference]: Start difference. First operand 538 states and 826 transitions. Second operand 4 states. [2019-11-15 23:52:28,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:28,481 INFO L93 Difference]: Finished difference Result 2142 states and 3296 transitions. [2019-11-15 23:52:28,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:52:28,486 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-11-15 23:52:28,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:28,496 INFO L225 Difference]: With dead ends: 2142 [2019-11-15 23:52:28,496 INFO L226 Difference]: Without dead ends: 1606 [2019-11-15 23:52:28,499 INFO L600 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-11-15 23:52:28,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1606 states. [2019-11-15 23:52:28,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1606 to 1428. [2019-11-15 23:52:28,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2019-11-15 23:52:28,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 2029 transitions. [2019-11-15 23:52:28,545 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 2029 transitions. Word has length 117 [2019-11-15 23:52:28,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:28,546 INFO L462 AbstractCegarLoop]: Abstraction has 1428 states and 2029 transitions. [2019-11-15 23:52:28,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:52:28,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 2029 transitions. [2019-11-15 23:52:28,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-15 23:52:28,548 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:28,548 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:28,549 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:28,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:28,549 INFO L82 PathProgramCache]: Analyzing trace with hash -301797236, now seen corresponding path program 1 times [2019-11-15 23:52:28,549 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:28,550 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768588806] [2019-11-15 23:52:28,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:28,550 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:28,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:28,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:28,653 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:52:28,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768588806] [2019-11-15 23:52:28,654 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:28,654 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:52:28,654 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598612166] [2019-11-15 23:52:28,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:52:28,655 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:28,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:52:28,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:52:28,656 INFO L87 Difference]: Start difference. First operand 1428 states and 2029 transitions. Second operand 4 states. [2019-11-15 23:52:30,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:30,064 INFO L93 Difference]: Finished difference Result 4634 states and 6631 transitions. [2019-11-15 23:52:30,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:52:30,065 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-11-15 23:52:30,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:30,083 INFO L225 Difference]: With dead ends: 4634 [2019-11-15 23:52:30,083 INFO L226 Difference]: Without dead ends: 3208 [2019-11-15 23:52:30,086 INFO L600 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-11-15 23:52:30,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3208 states. [2019-11-15 23:52:30,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3208 to 2852. [2019-11-15 23:52:30,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-11-15 23:52:30,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3754 transitions. [2019-11-15 23:52:30,184 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3754 transitions. Word has length 120 [2019-11-15 23:52:30,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:30,187 INFO L462 AbstractCegarLoop]: Abstraction has 2852 states and 3754 transitions. [2019-11-15 23:52:30,187 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:52:30,187 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3754 transitions. [2019-11-15 23:52:30,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-11-15 23:52:30,195 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:30,195 INFO L380 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, 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] [2019-11-15 23:52:30,196 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:30,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:30,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1455566984, now seen corresponding path program 1 times [2019-11-15 23:52:30,196 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:30,197 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490847143] [2019-11-15 23:52:30,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:30,197 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:30,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:30,593 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 246 proven. 4 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-15 23:52:30,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490847143] [2019-11-15 23:52:30,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142759395] [2019-11-15 23:52:30,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b83e986-8c50-44a5-ae80-88b44ebbadc7/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:30,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:52:30,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:30,856 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2019-11-15 23:52:30,857 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:52:30,857 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-15 23:52:30,858 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735483897] [2019-11-15 23:52:30,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:52:30,861 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:30,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:52:30,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:52:30,861 INFO L87 Difference]: Start difference. First operand 2852 states and 3754 transitions. Second operand 3 states. [2019-11-15 23:52:31,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:31,808 INFO L93 Difference]: Finished difference Result 6414 states and 8465 transitions. [2019-11-15 23:52:31,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:52:31,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 277 [2019-11-15 23:52:31,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:31,830 INFO L225 Difference]: With dead ends: 6414 [2019-11-15 23:52:31,830 INFO L226 Difference]: Without dead ends: 3742 [2019-11-15 23:52:31,834 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 276 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:52:31,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3742 states. [2019-11-15 23:52:31,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3742 to 2852. [2019-11-15 23:52:31,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-11-15 23:52:31,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3754 transitions. [2019-11-15 23:52:31,910 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3754 transitions. Word has length 277 [2019-11-15 23:52:31,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:31,913 INFO L462 AbstractCegarLoop]: Abstraction has 2852 states and 3754 transitions. [2019-11-15 23:52:31,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:52:31,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3754 transitions. [2019-11-15 23:52:31,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2019-11-15 23:52:31,919 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:31,919 INFO L380 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:32,124 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:32,124 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:32,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:32,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1904800060, now seen corresponding path program 1 times [2019-11-15 23:52:32,125 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:32,125 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302013235] [2019-11-15 23:52:32,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:32,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:32,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:32,465 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 250 proven. 4 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-11-15 23:52:32,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302013235] [2019-11-15 23:52:32,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725147736] [2019-11-15 23:52:32,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b83e986-8c50-44a5-ae80-88b44ebbadc7/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:32,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:32,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 23:52:32,585 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:32,776 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2019-11-15 23:52:32,777 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:52:32,777 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-15 23:52:32,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992943003] [2019-11-15 23:52:32,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:52:32,779 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:32,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:52:32,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:52:32,780 INFO L87 Difference]: Start difference. First operand 2852 states and 3754 transitions. Second operand 4 states. [2019-11-15 23:52:33,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:33,702 INFO L93 Difference]: Finished difference Result 5731 states and 7565 transitions. [2019-11-15 23:52:33,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:52:33,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 309 [2019-11-15 23:52:33,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:33,719 INFO L225 Difference]: With dead ends: 5731 [2019-11-15 23:52:33,719 INFO L226 Difference]: Without dead ends: 3030 [2019-11-15 23:52:33,722 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 308 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:52:33,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3030 states. [2019-11-15 23:52:33,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3030 to 2852. [2019-11-15 23:52:33,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-11-15 23:52:33,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3227 transitions. [2019-11-15 23:52:33,788 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3227 transitions. Word has length 309 [2019-11-15 23:52:33,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:33,789 INFO L462 AbstractCegarLoop]: Abstraction has 2852 states and 3227 transitions. [2019-11-15 23:52:33,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:52:33,789 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3227 transitions. [2019-11-15 23:52:33,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-11-15 23:52:33,795 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:33,796 INFO L380 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, 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] [2019-11-15 23:52:33,999 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:34,000 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:34,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:34,000 INFO L82 PathProgramCache]: Analyzing trace with hash -369817949, now seen corresponding path program 1 times [2019-11-15 23:52:34,000 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:34,001 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808791087] [2019-11-15 23:52:34,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:34,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:34,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:34,609 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 337 proven. 4 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-15 23:52:34,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808791087] [2019-11-15 23:52:34,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360721328] [2019-11-15 23:52:34,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b83e986-8c50-44a5-ae80-88b44ebbadc7/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:34,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:34,706 INFO L256 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 23:52:34,712 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:34,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:35,070 INFO L134 CoverageAnalysis]: Checked inductivity of 391 backedges. 318 proven. 23 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2019-11-15 23:52:35,070 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:35,071 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2019-11-15 23:52:35,071 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173992430] [2019-11-15 23:52:35,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:52:35,072 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:35,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:52:35,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:52:35,073 INFO L87 Difference]: Start difference. First operand 2852 states and 3227 transitions. Second operand 8 states. [2019-11-15 23:52:37,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:37,041 INFO L93 Difference]: Finished difference Result 5744 states and 6499 transitions. [2019-11-15 23:52:37,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:52:37,042 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 356 [2019-11-15 23:52:37,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:37,058 INFO L225 Difference]: With dead ends: 5744 [2019-11-15 23:52:37,059 INFO L226 Difference]: Without dead ends: 3072 [2019-11-15 23:52:37,063 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 364 GetRequests, 353 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:52:37,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3072 states. [2019-11-15 23:52:37,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3072 to 2852. [2019-11-15 23:52:37,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-11-15 23:52:37,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3222 transitions. [2019-11-15 23:52:37,129 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3222 transitions. Word has length 356 [2019-11-15 23:52:37,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:37,129 INFO L462 AbstractCegarLoop]: Abstraction has 2852 states and 3222 transitions. [2019-11-15 23:52:37,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:52:37,130 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3222 transitions. [2019-11-15 23:52:37,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 575 [2019-11-15 23:52:37,143 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:37,144 INFO L380 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, 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, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:37,347 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:37,347 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:37,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:37,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1129963505, now seen corresponding path program 1 times [2019-11-15 23:52:37,348 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:37,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815386405] [2019-11-15 23:52:37,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:37,348 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:37,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:38,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 797 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2019-11-15 23:52:38,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815386405] [2019-11-15 23:52:38,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:38,745 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:52:38,745 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536366341] [2019-11-15 23:52:38,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:52:38,746 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:38,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:52:38,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:52:38,747 INFO L87 Difference]: Start difference. First operand 2852 states and 3222 transitions. Second operand 8 states. [2019-11-15 23:52:40,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:40,274 INFO L93 Difference]: Finished difference Result 5530 states and 6269 transitions. [2019-11-15 23:52:40,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:52:40,275 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 574 [2019-11-15 23:52:40,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:40,292 INFO L225 Difference]: With dead ends: 5530 [2019-11-15 23:52:40,292 INFO L226 Difference]: Without dead ends: 2858 [2019-11-15 23:52:40,295 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:52:40,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2019-11-15 23:52:40,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2852. [2019-11-15 23:52:40,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2852 states. [2019-11-15 23:52:40,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2852 states to 2852 states and 3214 transitions. [2019-11-15 23:52:40,353 INFO L78 Accepts]: Start accepts. Automaton has 2852 states and 3214 transitions. Word has length 574 [2019-11-15 23:52:40,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:40,354 INFO L462 AbstractCegarLoop]: Abstraction has 2852 states and 3214 transitions. [2019-11-15 23:52:40,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:52:40,355 INFO L276 IsEmpty]: Start isEmpty. Operand 2852 states and 3214 transitions. [2019-11-15 23:52:40,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2019-11-15 23:52:40,369 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:40,369 INFO L380 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, 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, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:40,369 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:40,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:40,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1958858224, now seen corresponding path program 1 times [2019-11-15 23:52:40,370 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:40,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864630827] [2019-11-15 23:52:40,371 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:40,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:40,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:41,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 578 proven. 260 refuted. 0 times theorem prover too weak. 323 trivial. 0 not checked. [2019-11-15 23:52:41,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864630827] [2019-11-15 23:52:41,351 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892988144] [2019-11-15 23:52:41,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b83e986-8c50-44a5-ae80-88b44ebbadc7/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:41,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:52:41,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:41,875 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 524 proven. 0 refuted. 0 times theorem prover too weak. 637 trivial. 0 not checked. [2019-11-15 23:52:41,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:52:41,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-11-15 23:52:41,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055440163] [2019-11-15 23:52:41,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:52:41,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:41,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:52:41,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:52:41,877 INFO L87 Difference]: Start difference. First operand 2852 states and 3214 transitions. Second operand 4 states. [2019-11-15 23:52:42,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:42,627 INFO L93 Difference]: Finished difference Result 7304 states and 8336 transitions. [2019-11-15 23:52:42,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:52:42,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 600 [2019-11-15 23:52:42,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:42,650 INFO L225 Difference]: With dead ends: 7304 [2019-11-15 23:52:42,650 INFO L226 Difference]: Without dead ends: 4632 [2019-11-15 23:52:42,654 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 599 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:52:42,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2019-11-15 23:52:42,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4632. [2019-11-15 23:52:42,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4632 states. [2019-11-15 23:52:42,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4632 states to 4632 states and 5055 transitions. [2019-11-15 23:52:42,745 INFO L78 Accepts]: Start accepts. Automaton has 4632 states and 5055 transitions. Word has length 600 [2019-11-15 23:52:42,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:42,746 INFO L462 AbstractCegarLoop]: Abstraction has 4632 states and 5055 transitions. [2019-11-15 23:52:42,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:52:42,746 INFO L276 IsEmpty]: Start isEmpty. Operand 4632 states and 5055 transitions. [2019-11-15 23:52:42,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2019-11-15 23:52:42,768 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:42,768 INFO L380 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2019-11-15 23:52:42,975 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:42,975 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:42,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:42,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1310836641, now seen corresponding path program 1 times [2019-11-15 23:52:42,976 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:42,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593223478] [2019-11-15 23:52:42,976 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:42,977 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:42,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:43,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1316 backedges. 892 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-11-15 23:52:43,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593223478] [2019-11-15 23:52:43,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631455075] [2019-11-15 23:52:43,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b83e986-8c50-44a5-ae80-88b44ebbadc7/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:43,784 INFO L256 TraceCheckSpWp]: Trace formula consists of 794 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:52:43,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:44,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1316 backedges. 892 proven. 110 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-11-15 23:52:44,147 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:52:44,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-11-15 23:52:44,148 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581882431] [2019-11-15 23:52:44,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:52:44,149 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:44,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:52:44,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:52:44,150 INFO L87 Difference]: Start difference. First operand 4632 states and 5055 transitions. Second operand 5 states. [2019-11-15 23:52:45,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:45,732 INFO L93 Difference]: Finished difference Result 11398 states and 12490 transitions. [2019-11-15 23:52:45,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:52:45,733 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 641 [2019-11-15 23:52:45,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:45,781 INFO L225 Difference]: With dead ends: 11398 [2019-11-15 23:52:45,781 INFO L226 Difference]: Without dead ends: 6946 [2019-11-15 23:52:45,787 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 646 GetRequests, 643 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:52:45,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2019-11-15 23:52:45,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 5878. [2019-11-15 23:52:45,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5878 states. [2019-11-15 23:52:45,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5878 states to 5878 states and 6406 transitions. [2019-11-15 23:52:45,888 INFO L78 Accepts]: Start accepts. Automaton has 5878 states and 6406 transitions. Word has length 641 [2019-11-15 23:52:45,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:45,889 INFO L462 AbstractCegarLoop]: Abstraction has 5878 states and 6406 transitions. [2019-11-15 23:52:45,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:52:45,890 INFO L276 IsEmpty]: Start isEmpty. Operand 5878 states and 6406 transitions. [2019-11-15 23:52:45,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2019-11-15 23:52:45,897 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:45,897 INFO L380 BasicCegarLoop]: trace histogram [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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 3, 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] [2019-11-15 23:52:46,112 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:46,112 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:46,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:46,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1502121497, now seen corresponding path program 1 times [2019-11-15 23:52:46,113 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:46,113 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482401357] [2019-11-15 23:52:46,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:46,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:46,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:46,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:47,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 1095 proven. 260 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-11-15 23:52:47,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482401357] [2019-11-15 23:52:47,418 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725794811] [2019-11-15 23:52:47,418 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b83e986-8c50-44a5-ae80-88b44ebbadc7/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:47,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:47,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:52:47,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:48,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 1146 proven. 0 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2019-11-15 23:52:48,018 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:52:48,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-11-15 23:52:48,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550083417] [2019-11-15 23:52:48,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:52:48,019 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:48,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:52:48,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:52:48,020 INFO L87 Difference]: Start difference. First operand 5878 states and 6406 transitions. Second operand 3 states. [2019-11-15 23:52:48,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:48,665 INFO L93 Difference]: Finished difference Result 11754 states and 12811 transitions. [2019-11-15 23:52:48,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:52:48,666 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 651 [2019-11-15 23:52:48,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:48,676 INFO L225 Difference]: With dead ends: 11754 [2019-11-15 23:52:48,677 INFO L226 Difference]: Without dead ends: 6056 [2019-11-15 23:52:48,683 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 659 GetRequests, 652 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:52:48,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6056 states. [2019-11-15 23:52:48,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6056 to 5700. [2019-11-15 23:52:48,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5700 states. [2019-11-15 23:52:48,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5700 states to 5700 states and 6162 transitions. [2019-11-15 23:52:48,762 INFO L78 Accepts]: Start accepts. Automaton has 5700 states and 6162 transitions. Word has length 651 [2019-11-15 23:52:48,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:48,763 INFO L462 AbstractCegarLoop]: Abstraction has 5700 states and 6162 transitions. [2019-11-15 23:52:48,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:52:48,764 INFO L276 IsEmpty]: Start isEmpty. Operand 5700 states and 6162 transitions. [2019-11-15 23:52:48,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2019-11-15 23:52:48,770 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:48,771 INFO L380 BasicCegarLoop]: trace histogram [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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 3, 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] [2019-11-15 23:52:48,974 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:48,974 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:48,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:48,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1331694009, now seen corresponding path program 1 times [2019-11-15 23:52:48,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:48,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324214830] [2019-11-15 23:52:48,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:48,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:48,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:49,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:50,030 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 708 proven. 325 refuted. 0 times theorem prover too weak. 554 trivial. 0 not checked. [2019-11-15 23:52:50,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324214830] [2019-11-15 23:52:50,030 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839595228] [2019-11-15 23:52:50,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b83e986-8c50-44a5-ae80-88b44ebbadc7/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:50,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:50,182 INFO L256 TraceCheckSpWp]: Trace formula consists of 865 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:52:50,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:50,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1587 backedges. 643 proven. 0 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2019-11-15 23:52:50,798 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:52:50,799 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2019-11-15 23:52:50,799 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162583057] [2019-11-15 23:52:50,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:52:50,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:50,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:52:50,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:52:50,802 INFO L87 Difference]: Start difference. First operand 5700 states and 6162 transitions. Second operand 4 states. [2019-11-15 23:52:51,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:51,835 INFO L93 Difference]: Finished difference Result 11398 states and 12323 transitions. [2019-11-15 23:52:51,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:52:51,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 695 [2019-11-15 23:52:51,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:51,849 INFO L225 Difference]: With dead ends: 11398 [2019-11-15 23:52:51,849 INFO L226 Difference]: Without dead ends: 5878 [2019-11-15 23:52:51,856 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 704 GetRequests, 694 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:52:51,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5878 states. [2019-11-15 23:52:51,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5878 to 5522. [2019-11-15 23:52:51,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5522 states. [2019-11-15 23:52:51,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5522 states to 5522 states and 5956 transitions. [2019-11-15 23:52:51,954 INFO L78 Accepts]: Start accepts. Automaton has 5522 states and 5956 transitions. Word has length 695 [2019-11-15 23:52:51,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:51,955 INFO L462 AbstractCegarLoop]: Abstraction has 5522 states and 5956 transitions. [2019-11-15 23:52:51,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:52:51,956 INFO L276 IsEmpty]: Start isEmpty. Operand 5522 states and 5956 transitions. [2019-11-15 23:52:51,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 759 [2019-11-15 23:52:51,966 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:51,967 INFO L380 BasicCegarLoop]: trace histogram [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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:52,170 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:52,171 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:52,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:52,172 INFO L82 PathProgramCache]: Analyzing trace with hash -1867062169, now seen corresponding path program 1 times [2019-11-15 23:52:52,172 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:52,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823029976] [2019-11-15 23:52:52,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:52,172 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:52,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:52,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1758 backedges. 1071 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2019-11-15 23:52:52,871 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823029976] [2019-11-15 23:52:52,871 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:52:52,871 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:52:52,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121094089] [2019-11-15 23:52:52,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:52:52,872 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:52,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:52:52,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:52:52,873 INFO L87 Difference]: Start difference. First operand 5522 states and 5956 transitions. Second operand 4 states. [2019-11-15 23:52:53,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:53,692 INFO L93 Difference]: Finished difference Result 11754 states and 12725 transitions. [2019-11-15 23:52:53,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:52:53,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 758 [2019-11-15 23:52:53,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:53,703 INFO L225 Difference]: With dead ends: 11754 [2019-11-15 23:52:53,703 INFO L226 Difference]: Without dead ends: 6412 [2019-11-15 23:52:53,709 INFO L600 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-11-15 23:52:53,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6412 states. [2019-11-15 23:52:53,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6412 to 5344. [2019-11-15 23:52:53,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5344 states. [2019-11-15 23:52:53,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5344 states to 5344 states and 5708 transitions. [2019-11-15 23:52:53,776 INFO L78 Accepts]: Start accepts. Automaton has 5344 states and 5708 transitions. Word has length 758 [2019-11-15 23:52:53,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:53,777 INFO L462 AbstractCegarLoop]: Abstraction has 5344 states and 5708 transitions. [2019-11-15 23:52:53,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:52:53,777 INFO L276 IsEmpty]: Start isEmpty. Operand 5344 states and 5708 transitions. [2019-11-15 23:52:53,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 809 [2019-11-15 23:52:53,785 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:53,786 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:53,786 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:53,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:53,786 INFO L82 PathProgramCache]: Analyzing trace with hash -540711606, now seen corresponding path program 1 times [2019-11-15 23:52:53,787 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:53,787 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757260500] [2019-11-15 23:52:53,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:53,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:53,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:53,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:54,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 1215 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2019-11-15 23:52:54,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757260500] [2019-11-15 23:52:54,614 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313875322] [2019-11-15 23:52:54,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b83e986-8c50-44a5-ae80-88b44ebbadc7/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:54,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:54,815 INFO L256 TraceCheckSpWp]: Trace formula consists of 1006 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:52:54,823 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:54,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:54,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:55,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:55,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:52:55,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2231 backedges. 928 proven. 0 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2019-11-15 23:52:55,749 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:52:55,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2019-11-15 23:52:55,750 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896066055] [2019-11-15 23:52:55,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:52:55,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:55,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:52:55,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:52:55,751 INFO L87 Difference]: Start difference. First operand 5344 states and 5708 transitions. Second operand 4 states. [2019-11-15 23:52:56,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:56,968 INFO L93 Difference]: Finished difference Result 11932 states and 12761 transitions. [2019-11-15 23:52:56,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:52:56,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 808 [2019-11-15 23:52:56,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:56,981 INFO L225 Difference]: With dead ends: 11932 [2019-11-15 23:52:56,981 INFO L226 Difference]: Without dead ends: 6768 [2019-11-15 23:52:56,986 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 813 GetRequests, 807 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:52:56,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6768 states. [2019-11-15 23:52:57,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6768 to 6056. [2019-11-15 23:52:57,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6056 states. [2019-11-15 23:52:57,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6056 states to 6056 states and 6465 transitions. [2019-11-15 23:52:57,057 INFO L78 Accepts]: Start accepts. Automaton has 6056 states and 6465 transitions. Word has length 808 [2019-11-15 23:52:57,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:57,058 INFO L462 AbstractCegarLoop]: Abstraction has 6056 states and 6465 transitions. [2019-11-15 23:52:57,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:52:57,058 INFO L276 IsEmpty]: Start isEmpty. Operand 6056 states and 6465 transitions. [2019-11-15 23:52:57,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 811 [2019-11-15 23:52:57,065 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:57,066 INFO L380 BasicCegarLoop]: trace histogram [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, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 23:52:57,269 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:57,269 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:57,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:57,269 INFO L82 PathProgramCache]: Analyzing trace with hash -172725225, now seen corresponding path program 1 times [2019-11-15 23:52:57,269 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:57,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72388903] [2019-11-15 23:52:57,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:57,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:57,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:52:57,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:58,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1954 backedges. 632 proven. 619 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2019-11-15 23:52:58,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72388903] [2019-11-15 23:52:58,493 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428663548] [2019-11-15 23:52:58,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b83e986-8c50-44a5-ae80-88b44ebbadc7/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:52:58,652 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:52:58,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:52:58,987 INFO L134 CoverageAnalysis]: Checked inductivity of 1954 backedges. 839 proven. 0 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2019-11-15 23:52:58,987 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:52:58,988 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2019-11-15 23:52:58,988 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840918039] [2019-11-15 23:52:58,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:52:58,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:52:58,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:52:58,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:52:58,989 INFO L87 Difference]: Start difference. First operand 6056 states and 6465 transitions. Second operand 3 states. [2019-11-15 23:52:59,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:52:59,612 INFO L93 Difference]: Finished difference Result 12288 states and 13155 transitions. [2019-11-15 23:52:59,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:52:59,613 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 810 [2019-11-15 23:52:59,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:52:59,625 INFO L225 Difference]: With dead ends: 12288 [2019-11-15 23:52:59,626 INFO L226 Difference]: Without dead ends: 6412 [2019-11-15 23:52:59,631 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 824 GetRequests, 811 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:52:59,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6412 states. [2019-11-15 23:52:59,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6412 to 5700. [2019-11-15 23:52:59,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5700 states. [2019-11-15 23:52:59,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5700 states to 5700 states and 6060 transitions. [2019-11-15 23:52:59,712 INFO L78 Accepts]: Start accepts. Automaton has 5700 states and 6060 transitions. Word has length 810 [2019-11-15 23:52:59,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:52:59,713 INFO L462 AbstractCegarLoop]: Abstraction has 5700 states and 6060 transitions. [2019-11-15 23:52:59,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:52:59,713 INFO L276 IsEmpty]: Start isEmpty. Operand 5700 states and 6060 transitions. [2019-11-15 23:52:59,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 842 [2019-11-15 23:52:59,722 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:52:59,723 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:52:59,935 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:52:59,935 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:52:59,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:52:59,936 INFO L82 PathProgramCache]: Analyzing trace with hash -2108387026, now seen corresponding path program 1 times [2019-11-15 23:52:59,936 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:52:59,936 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234104793] [2019-11-15 23:52:59,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:59,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:52:59,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:00,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2267 backedges. 1251 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2019-11-15 23:53:00,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234104793] [2019-11-15 23:53:00,856 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883666174] [2019-11-15 23:53:00,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b83e986-8c50-44a5-ae80-88b44ebbadc7/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:53:01,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:01,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 1039 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 23:53:01,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:53:01,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:01,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:01,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:01,254 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:02,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2267 backedges. 964 proven. 0 refuted. 0 times theorem prover too weak. 1303 trivial. 0 not checked. [2019-11-15 23:53:02,284 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 23:53:02,284 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2019-11-15 23:53:02,284 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600606267] [2019-11-15 23:53:02,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:53:02,285 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:02,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:53:02,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:53:02,286 INFO L87 Difference]: Start difference. First operand 5700 states and 6060 transitions. Second operand 4 states. [2019-11-15 23:53:04,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:04,452 INFO L93 Difference]: Finished difference Result 12466 states and 13239 transitions. [2019-11-15 23:53:04,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:53:04,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 841 [2019-11-15 23:53:04,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:04,464 INFO L225 Difference]: With dead ends: 12466 [2019-11-15 23:53:04,464 INFO L226 Difference]: Without dead ends: 6946 [2019-11-15 23:53:04,472 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 846 GetRequests, 840 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:53:04,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6946 states. [2019-11-15 23:53:04,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6946 to 5700. [2019-11-15 23:53:04,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5700 states. [2019-11-15 23:53:04,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5700 states to 5700 states and 6060 transitions. [2019-11-15 23:53:04,565 INFO L78 Accepts]: Start accepts. Automaton has 5700 states and 6060 transitions. Word has length 841 [2019-11-15 23:53:04,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:04,566 INFO L462 AbstractCegarLoop]: Abstraction has 5700 states and 6060 transitions. [2019-11-15 23:53:04,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:53:04,566 INFO L276 IsEmpty]: Start isEmpty. Operand 5700 states and 6060 transitions. [2019-11-15 23:53:04,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 843 [2019-11-15 23:53:04,578 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:04,578 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:53:04,782 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:53:04,782 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:04,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:04,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1692043947, now seen corresponding path program 1 times [2019-11-15 23:53:04,783 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:04,783 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164903502] [2019-11-15 23:53:04,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:04,783 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:04,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2268 backedges. 1252 proven. 72 refuted. 0 times theorem prover too weak. 944 trivial. 0 not checked. [2019-11-15 23:53:05,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164903502] [2019-11-15 23:53:05,780 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667839984] [2019-11-15 23:53:05,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b83e986-8c50-44a5-ae80-88b44ebbadc7/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:53:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:05,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:53:05,978 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:53:06,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,003 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:06,672 WARN L191 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 33 [2019-11-15 23:53:07,617 INFO L134 CoverageAnalysis]: Checked inductivity of 2268 backedges. 1340 proven. 537 refuted. 0 times theorem prover too weak. 391 trivial. 0 not checked. [2019-11-15 23:53:07,618 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:53:07,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2019-11-15 23:53:07,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780417561] [2019-11-15 23:53:07,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:53:07,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:07,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:53:07,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:53:07,620 INFO L87 Difference]: Start difference. First operand 5700 states and 6060 transitions. Second operand 8 states. [2019-11-15 23:53:11,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:11,066 INFO L93 Difference]: Finished difference Result 14602 states and 15496 transitions. [2019-11-15 23:53:11,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:53:11,067 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 842 [2019-11-15 23:53:11,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:11,076 INFO L225 Difference]: With dead ends: 14602 [2019-11-15 23:53:11,076 INFO L226 Difference]: Without dead ends: 9082 [2019-11-15 23:53:11,082 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 851 GetRequests, 841 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:53:11,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9082 states. [2019-11-15 23:53:11,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9082 to 6768. [2019-11-15 23:53:11,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6768 states. [2019-11-15 23:53:11,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6768 states to 6768 states and 7166 transitions. [2019-11-15 23:53:11,184 INFO L78 Accepts]: Start accepts. Automaton has 6768 states and 7166 transitions. Word has length 842 [2019-11-15 23:53:11,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:11,185 INFO L462 AbstractCegarLoop]: Abstraction has 6768 states and 7166 transitions. [2019-11-15 23:53:11,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:53:11,185 INFO L276 IsEmpty]: Start isEmpty. Operand 6768 states and 7166 transitions. [2019-11-15 23:53:11,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 928 [2019-11-15 23:53:11,194 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:11,195 INFO L380 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 5, 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, 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] [2019-11-15 23:53:11,399 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:53:11,399 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:11,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:11,399 INFO L82 PathProgramCache]: Analyzing trace with hash -2126525007, now seen corresponding path program 1 times [2019-11-15 23:53:11,399 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:11,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674641145] [2019-11-15 23:53:11,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:11,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:11,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:11,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:13,149 INFO L134 CoverageAnalysis]: Checked inductivity of 2513 backedges. 219 proven. 1067 refuted. 0 times theorem prover too weak. 1227 trivial. 0 not checked. [2019-11-15 23:53:13,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674641145] [2019-11-15 23:53:13,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122294355] [2019-11-15 23:53:13,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b83e986-8c50-44a5-ae80-88b44ebbadc7/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:53:13,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:13,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 1123 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 23:53:13,330 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:53:13,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:13,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:13,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:13,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:13,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:13,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:13,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:13,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:13,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:13,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:13,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:13,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:13,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:13,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:13,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:13,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:13,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:13,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:13,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:13,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:13,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:13,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:13,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:13,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:13,524 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:13,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,302 WARN L191 SmtUtils]: Spent 6.19 s on a formula simplification. DAG size of input: 131 DAG size of output: 27 [2019-11-15 23:53:20,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:20,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:22,735 INFO L134 CoverageAnalysis]: Checked inductivity of 2513 backedges. 629 proven. 769 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2019-11-15 23:53:22,736 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:53:22,736 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 15 [2019-11-15 23:53:22,736 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585688953] [2019-11-15 23:53:22,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 23:53:22,737 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:22,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:53:22,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:53:22,738 INFO L87 Difference]: Start difference. First operand 6768 states and 7166 transitions. Second operand 16 states. [2019-11-15 23:53:29,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:29,543 INFO L93 Difference]: Finished difference Result 16967 states and 18015 transitions. [2019-11-15 23:53:29,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-15 23:53:29,544 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 927 [2019-11-15 23:53:29,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:29,552 INFO L225 Difference]: With dead ends: 16967 [2019-11-15 23:53:29,552 INFO L226 Difference]: Without dead ends: 10379 [2019-11-15 23:53:29,557 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 951 GetRequests, 922 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=200, Invalid=670, Unknown=0, NotChecked=0, Total=870 [2019-11-15 23:53:29,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10379 states. [2019-11-15 23:53:29,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10379 to 7480. [2019-11-15 23:53:29,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7480 states. [2019-11-15 23:53:29,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7480 states to 7480 states and 7971 transitions. [2019-11-15 23:53:29,640 INFO L78 Accepts]: Start accepts. Automaton has 7480 states and 7971 transitions. Word has length 927 [2019-11-15 23:53:29,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:29,641 INFO L462 AbstractCegarLoop]: Abstraction has 7480 states and 7971 transitions. [2019-11-15 23:53:29,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 23:53:29,641 INFO L276 IsEmpty]: Start isEmpty. Operand 7480 states and 7971 transitions. [2019-11-15 23:53:29,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1035 [2019-11-15 23:53:29,653 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:29,653 INFO L380 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, 10, 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, 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, 5, 4, 4, 4, 4, 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] [2019-11-15 23:53:29,857 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:53:29,857 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:29,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:29,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1713888931, now seen corresponding path program 1 times [2019-11-15 23:53:29,857 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:29,858 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639616822] [2019-11-15 23:53:29,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:29,858 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:29,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:30,849 INFO L134 CoverageAnalysis]: Checked inductivity of 3787 backedges. 1197 proven. 0 refuted. 0 times theorem prover too weak. 2590 trivial. 0 not checked. [2019-11-15 23:53:30,849 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639616822] [2019-11-15 23:53:30,850 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:30,850 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:53:30,850 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476501997] [2019-11-15 23:53:30,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:53:30,851 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:30,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:53:30,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:53:30,852 INFO L87 Difference]: Start difference. First operand 7480 states and 7971 transitions. Second operand 6 states. [2019-11-15 23:53:31,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:31,487 INFO L93 Difference]: Finished difference Result 14824 states and 15792 transitions. [2019-11-15 23:53:31,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:53:31,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1034 [2019-11-15 23:53:31,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:31,494 INFO L225 Difference]: With dead ends: 14824 [2019-11-15 23:53:31,494 INFO L226 Difference]: Without dead ends: 7302 [2019-11-15 23:53:31,498 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:53:31,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7302 states. [2019-11-15 23:53:31,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7302 to 7124. [2019-11-15 23:53:31,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7124 states. [2019-11-15 23:53:31,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7124 states to 7124 states and 7589 transitions. [2019-11-15 23:53:31,570 INFO L78 Accepts]: Start accepts. Automaton has 7124 states and 7589 transitions. Word has length 1034 [2019-11-15 23:53:31,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:31,571 INFO L462 AbstractCegarLoop]: Abstraction has 7124 states and 7589 transitions. [2019-11-15 23:53:31,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:53:31,572 INFO L276 IsEmpty]: Start isEmpty. Operand 7124 states and 7589 transitions. [2019-11-15 23:53:31,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1042 [2019-11-15 23:53:31,583 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:31,584 INFO L380 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, 10, 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, 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, 5, 5, 4, 4, 3, 3, 3, 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] [2019-11-15 23:53:31,584 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:31,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:31,585 INFO L82 PathProgramCache]: Analyzing trace with hash 643265044, now seen corresponding path program 1 times [2019-11-15 23:53:31,585 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:31,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50776824] [2019-11-15 23:53:31,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:31,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:31,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:31,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:32,997 INFO L134 CoverageAnalysis]: Checked inductivity of 3829 backedges. 1839 proven. 0 refuted. 0 times theorem prover too weak. 1990 trivial. 0 not checked. [2019-11-15 23:53:32,997 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50776824] [2019-11-15 23:53:32,997 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:32,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:53:32,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246848678] [2019-11-15 23:53:32,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:53:32,999 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:32,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:53:32,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:53:33,000 INFO L87 Difference]: Start difference. First operand 7124 states and 7589 transitions. Second operand 7 states. [2019-11-15 23:53:33,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:33,630 INFO L93 Difference]: Finished difference Result 14346 states and 15273 transitions. [2019-11-15 23:53:33,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:53:33,631 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 1041 [2019-11-15 23:53:33,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:33,637 INFO L225 Difference]: With dead ends: 14346 [2019-11-15 23:53:33,637 INFO L226 Difference]: Without dead ends: 7174 [2019-11-15 23:53:33,641 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:53:33,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7174 states. [2019-11-15 23:53:33,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7174 to 6996. [2019-11-15 23:53:33,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6996 states. [2019-11-15 23:53:33,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6996 states to 6996 states and 7405 transitions. [2019-11-15 23:53:33,728 INFO L78 Accepts]: Start accepts. Automaton has 6996 states and 7405 transitions. Word has length 1041 [2019-11-15 23:53:33,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:33,729 INFO L462 AbstractCegarLoop]: Abstraction has 6996 states and 7405 transitions. [2019-11-15 23:53:33,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:53:33,730 INFO L276 IsEmpty]: Start isEmpty. Operand 6996 states and 7405 transitions. [2019-11-15 23:53:33,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1057 [2019-11-15 23:53:33,741 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:33,741 INFO L380 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, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:53:33,742 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:33,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:33,742 INFO L82 PathProgramCache]: Analyzing trace with hash -1886227147, now seen corresponding path program 1 times [2019-11-15 23:53:33,743 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:33,743 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255544634] [2019-11-15 23:53:33,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:33,743 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:33,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:33,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:35,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3342 backedges. 27 proven. 854 refuted. 0 times theorem prover too weak. 2461 trivial. 0 not checked. [2019-11-15 23:53:35,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255544634] [2019-11-15 23:53:35,235 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351026713] [2019-11-15 23:53:35,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b83e986-8c50-44a5-ae80-88b44ebbadc7/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:53:35,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:35,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 23:53:35,440 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:53:35,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,572 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,582 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:35,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:53:37,556 INFO L134 CoverageAnalysis]: Checked inductivity of 3342 backedges. 482 proven. 399 refuted. 0 times theorem prover too weak. 2461 trivial. 0 not checked. [2019-11-15 23:53:37,557 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:53:37,557 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-11-15 23:53:37,557 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279106087] [2019-11-15 23:53:37,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:53:37,559 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:37,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:53:37,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:53:37,559 INFO L87 Difference]: Start difference. First operand 6996 states and 7405 transitions. Second operand 10 states. [2019-11-15 23:53:42,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:42,182 INFO L93 Difference]: Finished difference Result 17344 states and 18387 transitions. [2019-11-15 23:53:42,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 23:53:42,182 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1056 [2019-11-15 23:53:42,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:42,190 INFO L225 Difference]: With dead ends: 17344 [2019-11-15 23:53:42,190 INFO L226 Difference]: Without dead ends: 10022 [2019-11-15 23:53:42,193 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1083 GetRequests, 1053 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=232, Invalid=524, Unknown=0, NotChecked=0, Total=756 [2019-11-15 23:53:42,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10022 states. [2019-11-15 23:53:42,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10022 to 6996. [2019-11-15 23:53:42,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6996 states. [2019-11-15 23:53:42,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6996 states to 6996 states and 7374 transitions. [2019-11-15 23:53:42,283 INFO L78 Accepts]: Start accepts. Automaton has 6996 states and 7374 transitions. Word has length 1056 [2019-11-15 23:53:42,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:42,284 INFO L462 AbstractCegarLoop]: Abstraction has 6996 states and 7374 transitions. [2019-11-15 23:53:42,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:53:42,284 INFO L276 IsEmpty]: Start isEmpty. Operand 6996 states and 7374 transitions. [2019-11-15 23:53:42,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2108 [2019-11-15 23:53:42,306 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:42,307 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 10, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 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, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:53:42,511 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:53:42,511 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:42,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:42,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1766247281, now seen corresponding path program 1 times [2019-11-15 23:53:42,512 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:42,512 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384650820] [2019-11-15 23:53:42,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:42,512 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:42,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:42,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:45,789 INFO L134 CoverageAnalysis]: Checked inductivity of 14410 backedges. 3163 proven. 0 refuted. 0 times theorem prover too weak. 11247 trivial. 0 not checked. [2019-11-15 23:53:45,789 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384650820] [2019-11-15 23:53:45,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:45,790 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:53:45,790 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714450816] [2019-11-15 23:53:45,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:53:45,791 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:45,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:53:45,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:53:45,791 INFO L87 Difference]: Start difference. First operand 6996 states and 7374 transitions. Second operand 7 states. [2019-11-15 23:53:46,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:46,423 INFO L93 Difference]: Finished difference Result 13822 states and 14550 transitions. [2019-11-15 23:53:46,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:53:46,424 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 2107 [2019-11-15 23:53:46,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:46,429 INFO L225 Difference]: With dead ends: 13822 [2019-11-15 23:53:46,429 INFO L226 Difference]: Without dead ends: 6640 [2019-11-15 23:53:46,432 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:53:46,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6640 states. [2019-11-15 23:53:46,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6640 to 6640. [2019-11-15 23:53:46,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6640 states. [2019-11-15 23:53:46,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6640 states to 6640 states and 6970 transitions. [2019-11-15 23:53:46,495 INFO L78 Accepts]: Start accepts. Automaton has 6640 states and 6970 transitions. Word has length 2107 [2019-11-15 23:53:46,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:46,497 INFO L462 AbstractCegarLoop]: Abstraction has 6640 states and 6970 transitions. [2019-11-15 23:53:46,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:53:46,497 INFO L276 IsEmpty]: Start isEmpty. Operand 6640 states and 6970 transitions. [2019-11-15 23:53:46,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2142 [2019-11-15 23:53:46,521 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:46,522 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 12, 12, 12, 11, 10, 10, 10, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 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, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:53:46,522 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:46,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:46,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1393034536, now seen corresponding path program 1 times [2019-11-15 23:53:46,523 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:46,523 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13230633] [2019-11-15 23:53:46,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:46,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:46,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:46,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:49,541 INFO L134 CoverageAnalysis]: Checked inductivity of 14857 backedges. 3538 proven. 0 refuted. 0 times theorem prover too weak. 11319 trivial. 0 not checked. [2019-11-15 23:53:49,542 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13230633] [2019-11-15 23:53:49,542 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:53:49,543 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:53:49,543 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431446058] [2019-11-15 23:53:49,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:53:49,544 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:49,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:53:49,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:53:49,545 INFO L87 Difference]: Start difference. First operand 6640 states and 6970 transitions. Second operand 4 states. [2019-11-15 23:53:50,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:53:50,312 INFO L93 Difference]: Finished difference Result 14524 states and 15183 transitions. [2019-11-15 23:53:50,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:53:50,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 2141 [2019-11-15 23:53:50,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:53:50,317 INFO L225 Difference]: With dead ends: 14524 [2019-11-15 23:53:50,317 INFO L226 Difference]: Without dead ends: 5216 [2019-11-15 23:53:50,320 INFO L600 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-11-15 23:53:50,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5216 states. [2019-11-15 23:53:50,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5216 to 5216. [2019-11-15 23:53:50,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5216 states. [2019-11-15 23:53:50,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5216 states to 5216 states and 5322 transitions. [2019-11-15 23:53:50,367 INFO L78 Accepts]: Start accepts. Automaton has 5216 states and 5322 transitions. Word has length 2141 [2019-11-15 23:53:50,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:53:50,369 INFO L462 AbstractCegarLoop]: Abstraction has 5216 states and 5322 transitions. [2019-11-15 23:53:50,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:53:50,369 INFO L276 IsEmpty]: Start isEmpty. Operand 5216 states and 5322 transitions. [2019-11-15 23:53:50,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2202 [2019-11-15 23:53:50,393 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:53:50,394 INFO L380 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 12, 12, 12, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 8, 8, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:53:50,394 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:53:50,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:53:50,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1047725754, now seen corresponding path program 1 times [2019-11-15 23:53:50,395 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:53:50,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651476500] [2019-11-15 23:53:50,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:50,395 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:53:50,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:53:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:54,941 INFO L134 CoverageAnalysis]: Checked inductivity of 15097 backedges. 3815 proven. 38 refuted. 0 times theorem prover too weak. 11244 trivial. 0 not checked. [2019-11-15 23:53:54,941 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651476500] [2019-11-15 23:53:54,941 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190183855] [2019-11-15 23:53:54,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_4b83e986-8c50-44a5-ae80-88b44ebbadc7/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:53:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:53:55,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 2621 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 23:53:55,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:53:58,629 INFO L134 CoverageAnalysis]: Checked inductivity of 15097 backedges. 3787 proven. 66 refuted. 0 times theorem prover too weak. 11244 trivial. 0 not checked. [2019-11-15 23:53:58,629 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 23:53:58,631 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5] total 12 [2019-11-15 23:53:58,631 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551062352] [2019-11-15 23:53:58,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:53:58,633 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:53:58,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:53:58,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:53:58,634 INFO L87 Difference]: Start difference. First operand 5216 states and 5322 transitions. Second operand 12 states. [2019-11-15 23:54:01,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:54:01,700 INFO L93 Difference]: Finished difference Result 10015 states and 10226 transitions. [2019-11-15 23:54:01,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 23:54:01,702 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 2201 [2019-11-15 23:54:01,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:54:01,703 INFO L225 Difference]: With dead ends: 10015 [2019-11-15 23:54:01,703 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:54:01,707 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2222 GetRequests, 2205 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=132, Invalid=210, Unknown=0, NotChecked=0, Total=342 [2019-11-15 23:54:01,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:54:01,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:54:01,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:54:01,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:54:01,708 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2201 [2019-11-15 23:54:01,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:54:01,709 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:54:01,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:54:01,709 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:54:01,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:54:01,913 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 23:54:01,916 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:54:02,570 WARN L191 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 502 DAG size of output: 400 [2019-11-15 23:54:03,130 WARN L191 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 502 DAG size of output: 400 [2019-11-15 23:54:06,204 WARN L191 SmtUtils]: Spent 3.07 s on a formula simplification. DAG size of input: 387 DAG size of output: 100 [2019-11-15 23:54:09,142 WARN L191 SmtUtils]: Spent 2.94 s on a formula simplification. DAG size of input: 387 DAG size of output: 100 [2019-11-15 23:54:09,145 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 870) no Hoare annotation was computed. [2019-11-15 23:54:09,145 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 870) no Hoare annotation was computed. [2019-11-15 23:54:09,145 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,145 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,145 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,145 INFO L443 ceAbstractionStarter]: For program point L235(lines 235 870) no Hoare annotation was computed. [2019-11-15 23:54:09,145 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-15 23:54:09,146 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-15 23:54:09,146 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-15 23:54:09,146 INFO L443 ceAbstractionStarter]: For program point L764(lines 764 870) no Hoare annotation was computed. [2019-11-15 23:54:09,146 INFO L443 ceAbstractionStarter]: For program point L632(lines 632 870) no Hoare annotation was computed. [2019-11-15 23:54:09,146 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 870) no Hoare annotation was computed. [2019-11-15 23:54:09,146 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 870) no Hoare annotation was computed. [2019-11-15 23:54:09,146 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,146 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,146 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,146 INFO L443 ceAbstractionStarter]: For program point L700(lines 700 870) no Hoare annotation was computed. [2019-11-15 23:54:09,146 INFO L443 ceAbstractionStarter]: For program point L568(lines 568 870) no Hoare annotation was computed. [2019-11-15 23:54:09,146 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-15 23:54:09,146 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-15 23:54:09,147 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-15 23:54:09,147 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 870) no Hoare annotation was computed. [2019-11-15 23:54:09,147 INFO L443 ceAbstractionStarter]: For program point L438(lines 438 870) no Hoare annotation was computed. [2019-11-15 23:54:09,147 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 870) no Hoare annotation was computed. [2019-11-15 23:54:09,147 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,147 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,147 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,147 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 870) no Hoare annotation was computed. [2019-11-15 23:54:09,147 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-15 23:54:09,147 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-15 23:54:09,147 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-15 23:54:09,147 INFO L443 ceAbstractionStarter]: For program point L638(lines 638 870) no Hoare annotation was computed. [2019-11-15 23:54:09,147 INFO L443 ceAbstractionStarter]: For program point L506(lines 506 870) no Hoare annotation was computed. [2019-11-15 23:54:09,147 INFO L443 ceAbstractionStarter]: For program point L837(lines 837 870) no Hoare annotation was computed. [2019-11-15 23:54:09,148 INFO L443 ceAbstractionStarter]: For program point L771(lines 771 870) no Hoare annotation was computed. [2019-11-15 23:54:09,148 INFO L443 ceAbstractionStarter]: For program point L573(lines 573 870) no Hoare annotation was computed. [2019-11-15 23:54:09,148 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,148 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,148 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,148 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 870) no Hoare annotation was computed. [2019-11-15 23:54:09,148 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-15 23:54:09,148 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-15 23:54:09,148 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-15 23:54:09,148 INFO L443 ceAbstractionStarter]: For program point L311(lines 311 870) no Hoare annotation was computed. [2019-11-15 23:54:09,148 INFO L443 ceAbstractionStarter]: For program point L444(lines 444 870) no Hoare annotation was computed. [2019-11-15 23:54:09,148 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 870) no Hoare annotation was computed. [2019-11-15 23:54:09,148 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,149 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,149 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,149 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 870) no Hoare annotation was computed. [2019-11-15 23:54:09,149 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-15 23:54:09,149 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-15 23:54:09,149 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-15 23:54:09,149 INFO L443 ceAbstractionStarter]: For program point L842(lines 842 870) no Hoare annotation was computed. [2019-11-15 23:54:09,149 INFO L443 ceAbstractionStarter]: For program point L644(lines 644 870) no Hoare annotation was computed. [2019-11-15 23:54:09,149 INFO L443 ceAbstractionStarter]: For program point L512(lines 512 870) no Hoare annotation was computed. [2019-11-15 23:54:09,149 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 870) no Hoare annotation was computed. [2019-11-15 23:54:09,149 INFO L443 ceAbstractionStarter]: For program point L579(lines 579 870) no Hoare annotation was computed. [2019-11-15 23:54:09,149 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,149 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,149 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,150 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 870) no Hoare annotation was computed. [2019-11-15 23:54:09,150 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-15 23:54:09,150 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-15 23:54:09,150 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-15 23:54:09,150 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 870) no Hoare annotation was computed. [2019-11-15 23:54:09,150 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 870) no Hoare annotation was computed. [2019-11-15 23:54:09,150 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 870) no Hoare annotation was computed. [2019-11-15 23:54:09,150 INFO L443 ceAbstractionStarter]: For program point L252(lines 252 870) no Hoare annotation was computed. [2019-11-15 23:54:09,150 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,150 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,150 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,150 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-15 23:54:09,150 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-15 23:54:09,150 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-15 23:54:09,151 INFO L443 ceAbstractionStarter]: For program point L848(lines 848 870) no Hoare annotation was computed. [2019-11-15 23:54:09,151 INFO L443 ceAbstractionStarter]: For program point L650(lines 650 870) no Hoare annotation was computed. [2019-11-15 23:54:09,151 INFO L443 ceAbstractionStarter]: For program point L518(lines 518 870) no Hoare annotation was computed. [2019-11-15 23:54:09,151 INFO L443 ceAbstractionStarter]: For program point L783(lines 783 870) no Hoare annotation was computed. [2019-11-15 23:54:09,151 INFO L443 ceAbstractionStarter]: For program point L585(lines 585 870) no Hoare annotation was computed. [2019-11-15 23:54:09,151 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,151 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,151 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,151 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 870) no Hoare annotation was computed. [2019-11-15 23:54:09,151 INFO L443 ceAbstractionStarter]: For program point L454(lines 454 870) no Hoare annotation was computed. [2019-11-15 23:54:09,151 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:54:09,151 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-15 23:54:09,151 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-15 23:54:09,151 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-15 23:54:09,152 INFO L443 ceAbstractionStarter]: For program point L323(lines 323 870) no Hoare annotation was computed. [2019-11-15 23:54:09,152 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 870) no Hoare annotation was computed. [2019-11-15 23:54:09,152 INFO L443 ceAbstractionStarter]: For program point L258(lines 258 870) no Hoare annotation was computed. [2019-11-15 23:54:09,152 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,152 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,152 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,152 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-15 23:54:09,152 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-15 23:54:09,152 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-15 23:54:09,152 INFO L443 ceAbstractionStarter]: For program point L854(lines 854 870) no Hoare annotation was computed. [2019-11-15 23:54:09,152 INFO L443 ceAbstractionStarter]: For program point L656(lines 656 870) no Hoare annotation was computed. [2019-11-15 23:54:09,152 INFO L443 ceAbstractionStarter]: For program point L524(lines 524 870) no Hoare annotation was computed. [2019-11-15 23:54:09,152 INFO L443 ceAbstractionStarter]: For program point L789(lines 789 870) no Hoare annotation was computed. [2019-11-15 23:54:09,152 INFO L443 ceAbstractionStarter]: For program point L591(lines 591 870) no Hoare annotation was computed. [2019-11-15 23:54:09,153 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,153 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,153 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,153 INFO L443 ceAbstractionStarter]: For program point L724(lines 724 870) no Hoare annotation was computed. [2019-11-15 23:54:09,153 INFO L443 ceAbstractionStarter]: For program point L460(lines 460 870) no Hoare annotation was computed. [2019-11-15 23:54:09,153 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-15 23:54:09,153 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-15 23:54:09,153 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-15 23:54:09,153 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 870) no Hoare annotation was computed. [2019-11-15 23:54:09,153 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 23:54:09,153 INFO L443 ceAbstractionStarter]: For program point L396(lines 396 870) no Hoare annotation was computed. [2019-11-15 23:54:09,153 INFO L443 ceAbstractionStarter]: For program point L264(lines 264 870) no Hoare annotation was computed. [2019-11-15 23:54:09,153 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,153 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,154 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,154 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 870) no Hoare annotation was computed. [2019-11-15 23:54:09,154 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-15 23:54:09,154 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-15 23:54:09,154 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-15 23:54:09,154 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 870) no Hoare annotation was computed. [2019-11-15 23:54:09,154 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 870) no Hoare annotation was computed. [2019-11-15 23:54:09,154 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 870) no Hoare annotation was computed. [2019-11-15 23:54:09,154 INFO L443 ceAbstractionStarter]: For program point L597(lines 597 870) no Hoare annotation was computed. [2019-11-15 23:54:09,154 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,154 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,154 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,154 INFO L443 ceAbstractionStarter]: For program point L730(lines 730 870) no Hoare annotation was computed. [2019-11-15 23:54:09,155 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-15 23:54:09,155 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-15 23:54:09,155 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-15 23:54:09,155 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 870) no Hoare annotation was computed. [2019-11-15 23:54:09,157 INFO L443 ceAbstractionStarter]: For program point L335(lines 335 870) no Hoare annotation was computed. [2019-11-15 23:54:09,157 INFO L443 ceAbstractionStarter]: For program point L269(lines 269 870) no Hoare annotation was computed. [2019-11-15 23:54:09,157 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 870) no Hoare annotation was computed. [2019-11-15 23:54:09,157 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,157 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,158 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 870) no Hoare annotation was computed. [2019-11-15 23:54:09,158 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-15 23:54:09,158 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-15 23:54:09,158 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 870) no Hoare annotation was computed. [2019-11-15 23:54:09,158 INFO L443 ceAbstractionStarter]: For program point L536(lines 536 870) no Hoare annotation was computed. [2019-11-15 23:54:09,158 INFO L443 ceAbstractionStarter]: For program point L801(lines 801 870) no Hoare annotation was computed. [2019-11-15 23:54:09,158 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 870) no Hoare annotation was computed. [2019-11-15 23:54:09,158 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 870) no Hoare annotation was computed. [2019-11-15 23:54:09,158 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,158 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,158 INFO L443 ceAbstractionStarter]: For program point L472(lines 472 870) no Hoare annotation was computed. [2019-11-15 23:54:09,158 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-15 23:54:09,158 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-15 23:54:09,159 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 870) no Hoare annotation was computed. [2019-11-15 23:54:09,159 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 870) no Hoare annotation was computed. [2019-11-15 23:54:09,159 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 870) no Hoare annotation was computed. [2019-11-15 23:54:09,159 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,159 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,159 INFO L439 ceAbstractionStarter]: At program point L871(lines 20 872) the Hoare annotation is: (let ((.cse19 (+ ~a12~0 43))) (let ((.cse18 (<= .cse19 0)) (.cse2 (<= ~a15~0 8)) (.cse17 (<= ~a21~0 9)) (.cse7 (= ~a21~0 6)) (.cse5 (< 80 ~a12~0)) (.cse6 (= 8 ~a21~0)) (.cse3 (= ~a24~0 1)) (.cse8 (not (= 5 ~a15~0)))) (let ((.cse1 (and .cse6 .cse3 .cse8)) (.cse4 (= ~a15~0 9)) (.cse10 (<= ~a12~0 11)) (.cse15 (= ~a21~0 7)) (.cse11 (< 0 .cse19)) (.cse14 (or (not .cse7) .cse5)) (.cse0 (exists ((v_~a12~0_448 Int)) (and (<= 0 v_~a12~0_448) (< 80 v_~a12~0_448) (<= ~a12~0 (+ (mod v_~a12~0_448 299959) 300039))))) (.cse9 (not (= ~a15~0 8))) (.cse13 (and (or (and (not (= ~a21~0 9)) .cse18) (and .cse18 .cse8) (<= (+ ~a12~0 49) 0)) .cse2 .cse17)) (.cse12 (<= (+ ~a12~0 45156) 0)) (.cse16 (= ~a21~0 10))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and (<= ~a12~0 75) .cse6 .cse3 .cse4) (and (and .cse7 (and .cse3 .cse8) .cse2) .cse9) (and .cse3 .cse9 .cse2 (and (and .cse10 .cse8) .cse11)) (and .cse12 (and .cse13 (<= ~a21~0 6)) .cse9) (and .cse7 .cse14 (and .cse3 .cse2) .cse0) (and .cse1 .cse9 .cse2) (and .cse3 .cse15 .cse10 .cse2) (or (and .cse0 .cse3 .cse16 .cse2 .cse8 .cse11) (and .cse3 .cse16 .cse2 (<= ~a12~0 73281) .cse11)) (and .cse3 .cse16 .cse4 .cse10) (and .cse9 (and .cse3 .cse15 .cse2)) (and (and (and (<= ~a12~0 80) .cse17 (not .cse15)) .cse11) .cse14 .cse3 .cse2) (and .cse0 .cse3 .cse9 .cse2 .cse8 .cse17) (and (= ~a15~0 7) .cse3 .cse16) (and .cse3 (or (or (and (= 8 ~a15~0) (and .cse18 (= 10 ~a21~0))) .cse13) (and .cse12 .cse16 .cse2 .cse8))))))) [2019-11-15 23:54:09,159 INFO L443 ceAbstractionStarter]: For program point L541(lines 541 870) no Hoare annotation was computed. [2019-11-15 23:54:09,160 INFO L443 ceAbstractionStarter]: For program point L211(lines 211 870) no Hoare annotation was computed. [2019-11-15 23:54:09,160 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-15 23:54:09,160 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-15 23:54:09,160 INFO L443 ceAbstractionStarter]: For program point L674(lines 674 870) no Hoare annotation was computed. [2019-11-15 23:54:09,160 INFO L443 ceAbstractionStarter]: For program point L807(lines 807 870) no Hoare annotation was computed. [2019-11-15 23:54:09,160 INFO L443 ceAbstractionStarter]: For program point L741(lines 741 870) no Hoare annotation was computed. [2019-11-15 23:54:09,160 INFO L443 ceAbstractionStarter]: For program point L609(lines 609 870) no Hoare annotation was computed. [2019-11-15 23:54:09,160 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,160 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,160 INFO L446 ceAbstractionStarter]: At program point L874(lines 874 890) the Hoare annotation is: true [2019-11-15 23:54:09,160 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 870) no Hoare annotation was computed. [2019-11-15 23:54:09,160 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 870) no Hoare annotation was computed. [2019-11-15 23:54:09,160 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-15 23:54:09,161 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-15 23:54:09,161 INFO L443 ceAbstractionStarter]: For program point L677(lines 677 870) no Hoare annotation was computed. [2019-11-15 23:54:09,161 INFO L443 ceAbstractionStarter]: For program point L347(lines 347 870) no Hoare annotation was computed. [2019-11-15 23:54:09,161 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 870) no Hoare annotation was computed. [2019-11-15 23:54:09,161 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,161 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,161 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 870) no Hoare annotation was computed. [2019-11-15 23:54:09,161 INFO L443 ceAbstractionStarter]: For program point L217(lines 217 870) no Hoare annotation was computed. [2019-11-15 23:54:09,161 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-15 23:54:09,161 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-15 23:54:09,161 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:54:09,161 INFO L443 ceAbstractionStarter]: For program point L747(lines 747 870) no Hoare annotation was computed. [2019-11-15 23:54:09,161 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 870) no Hoare annotation was computed. [2019-11-15 23:54:09,161 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,162 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,162 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-11-15 23:54:09,162 INFO L443 ceAbstractionStarter]: For program point L21-2(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,162 INFO L443 ceAbstractionStarter]: For program point L814(lines 814 870) no Hoare annotation was computed. [2019-11-15 23:54:09,162 INFO L439 ceAbstractionStarter]: At program point L880-2(lines 880 889) the Hoare annotation is: (let ((.cse19 (+ ~a12~0 43))) (let ((.cse18 (<= .cse19 0)) (.cse2 (<= ~a15~0 8)) (.cse17 (<= ~a21~0 9)) (.cse7 (= ~a21~0 6)) (.cse5 (< 80 ~a12~0)) (.cse6 (= 8 ~a21~0)) (.cse3 (= ~a24~0 1)) (.cse8 (not (= 5 ~a15~0)))) (let ((.cse1 (and .cse6 .cse3 .cse8)) (.cse4 (= ~a15~0 9)) (.cse10 (<= ~a12~0 11)) (.cse15 (= ~a21~0 7)) (.cse11 (< 0 .cse19)) (.cse14 (or (not .cse7) .cse5)) (.cse0 (exists ((v_~a12~0_448 Int)) (and (<= 0 v_~a12~0_448) (< 80 v_~a12~0_448) (<= ~a12~0 (+ (mod v_~a12~0_448 299959) 300039))))) (.cse9 (not (= ~a15~0 8))) (.cse13 (and (or (and (not (= ~a21~0 9)) .cse18) (and .cse18 .cse8) (<= (+ ~a12~0 49) 0)) .cse2 .cse17)) (.cse12 (<= (+ ~a12~0 45156) 0)) (.cse16 (= ~a21~0 10))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and (<= ~a12~0 75) .cse6 .cse3 .cse4) (and (and .cse7 (and .cse3 .cse8) .cse2) .cse9) (and .cse3 .cse9 .cse2 (and (and .cse10 .cse8) .cse11)) (and .cse12 (and .cse13 (<= ~a21~0 6)) .cse9) (and .cse7 .cse14 (and .cse3 .cse2) .cse0) (and .cse1 .cse9 .cse2) (and .cse3 .cse15 .cse10 .cse2) (or (and .cse0 .cse3 .cse16 .cse2 .cse8 .cse11) (and .cse3 .cse16 .cse2 (<= ~a12~0 73281) .cse11)) (and .cse3 .cse16 .cse4 .cse10) (and .cse9 (and .cse3 .cse15 .cse2)) (and (and (and (<= ~a12~0 80) .cse17 (not .cse15)) .cse11) .cse14 .cse3 .cse2) (and .cse0 .cse3 .cse9 .cse2 .cse8 .cse17) (and (= ~a15~0 7) .cse3 .cse16) (and .cse3 (or (or (and (= 8 ~a15~0) (and .cse18 (= 10 ~a21~0))) .cse13) (and .cse12 .cse16 .cse2 .cse8))))))) [2019-11-15 23:54:09,162 INFO L443 ceAbstractionStarter]: For program point L484(lines 484 870) no Hoare annotation was computed. [2019-11-15 23:54:09,162 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 870) no Hoare annotation was computed. [2019-11-15 23:54:09,162 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-15 23:54:09,162 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-15 23:54:09,162 INFO L443 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-11-15 23:54:09,163 INFO L443 ceAbstractionStarter]: For program point L683(lines 683 870) no Hoare annotation was computed. [2019-11-15 23:54:09,163 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 870) no Hoare annotation was computed. [2019-11-15 23:54:09,163 INFO L443 ceAbstractionStarter]: For program point L552(lines 552 870) no Hoare annotation was computed. [2019-11-15 23:54:09,163 INFO L443 ceAbstractionStarter]: For program point L420(lines 420 870) no Hoare annotation was computed. [2019-11-15 23:54:09,163 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,163 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,163 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,163 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 870) no Hoare annotation was computed. [2019-11-15 23:54:09,163 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-15 23:54:09,163 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-15 23:54:09,163 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-15 23:54:09,163 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 870) no Hoare annotation was computed. [2019-11-15 23:54:09,163 INFO L443 ceAbstractionStarter]: For program point L885(line 885) no Hoare annotation was computed. [2019-11-15 23:54:09,163 INFO L443 ceAbstractionStarter]: For program point L819(lines 819 870) no Hoare annotation was computed. [2019-11-15 23:54:09,164 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 870) no Hoare annotation was computed. [2019-11-15 23:54:09,164 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 870) no Hoare annotation was computed. [2019-11-15 23:54:09,164 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 160) no Hoare annotation was computed. [2019-11-15 23:54:09,164 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,164 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,164 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,164 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 870) no Hoare annotation was computed. [2019-11-15 23:54:09,164 INFO L443 ceAbstractionStarter]: For program point L490(lines 490 870) no Hoare annotation was computed. [2019-11-15 23:54:09,164 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-15 23:54:09,164 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-15 23:54:09,164 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:54:09,164 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-15 23:54:09,164 INFO L443 ceAbstractionStarter]: For program point L359(lines 359 870) no Hoare annotation was computed. [2019-11-15 23:54:09,165 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 870) no Hoare annotation was computed. [2019-11-15 23:54:09,165 INFO L443 ceAbstractionStarter]: For program point L426(lines 426 870) no Hoare annotation was computed. [2019-11-15 23:54:09,165 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,165 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,165 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,165 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 870) no Hoare annotation was computed. [2019-11-15 23:54:09,165 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-15 23:54:09,165 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-15 23:54:09,165 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-15 23:54:09,165 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 870) no Hoare annotation was computed. [2019-11-15 23:54:09,165 INFO L443 ceAbstractionStarter]: For program point L626(lines 626 870) no Hoare annotation was computed. [2019-11-15 23:54:09,165 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 870) no Hoare annotation was computed. [2019-11-15 23:54:09,165 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 870) no Hoare annotation was computed. [2019-11-15 23:54:09,165 INFO L443 ceAbstractionStarter]: For program point L495(lines 495 870) no Hoare annotation was computed. [2019-11-15 23:54:09,166 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,166 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,166 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 20 872) no Hoare annotation was computed. [2019-11-15 23:54:09,166 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 870) no Hoare annotation was computed. [2019-11-15 23:54:09,166 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-15 23:54:09,166 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-15 23:54:09,166 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-15 23:54:09,166 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 870) no Hoare annotation was computed. [2019-11-15 23:54:09,175 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,176 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,177 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,177 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,178 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,178 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,178 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,179 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,180 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,193 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,194 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,195 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,196 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,196 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,196 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,197 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,197 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,197 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,204 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,204 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,205 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,206 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,206 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,206 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,207 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,207 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,208 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,211 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,212 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,213 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,214 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,215 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,215 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,215 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,216 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:54:09 BoogieIcfgContainer [2019-11-15 23:54:09,221 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:54:09,221 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:54:09,221 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:54:09,222 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:54:09,222 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:52:24" (3/4) ... [2019-11-15 23:54:09,226 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:54:09,256 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 23:54:09,258 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 23:54:09,291 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039) && (8 == a21 && a24 == 1) && !(5 == a15)) && a15 <= 8) || ((a24 == 1 && a15 == 9) && 80 < a12)) || (((a12 <= 75 && 8 == a21) && a24 == 1) && a15 == 9)) || (((a21 == 6 && a24 == 1 && !(5 == a15)) && a15 <= 8) && !(a15 == 8))) || (((a24 == 1 && !(a15 == 8)) && a15 <= 8) && (a12 <= 11 && !(5 == a15)) && 0 < a12 + 43)) || ((a12 + 45156 <= 0 && (((((!(a21 == 9) && a12 + 43 <= 0) || (a12 + 43 <= 0 && !(5 == a15))) || a12 + 49 <= 0) && a15 <= 8) && a21 <= 9) && a21 <= 6) && !(a15 == 8))) || (((a21 == 6 && (!(a21 == 6) || 80 < a12)) && a24 == 1 && a15 <= 8) && (\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039))) || ((((8 == a21 && a24 == 1) && !(5 == a15)) && !(a15 == 8)) && a15 <= 8)) || (((a24 == 1 && a21 == 7) && a12 <= 11) && a15 <= 8)) || ((((((\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039) && a24 == 1) && a21 == 10) && a15 <= 8) && !(5 == a15)) && 0 < a12 + 43) || ((((a24 == 1 && a21 == 10) && a15 <= 8) && a12 <= 73281) && 0 < a12 + 43)) || (((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11)) || (!(a15 == 8) && (a24 == 1 && a21 == 7) && a15 <= 8)) || ((((((a12 <= 80 && a21 <= 9) && !(a21 == 7)) && 0 < a12 + 43) && (!(a21 == 6) || 80 < a12)) && a24 == 1) && a15 <= 8)) || ((((((\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039) && a24 == 1) && !(a15 == 8)) && a15 <= 8) && !(5 == a15)) && a21 <= 9)) || ((a15 == 7 && a24 == 1) && a21 == 10)) || (a24 == 1 && (((8 == a15 && a12 + 43 <= 0 && 10 == a21) || (((((!(a21 == 9) && a12 + 43 <= 0) || (a12 + 43 <= 0 && !(5 == a15))) || a12 + 49 <= 0) && a15 <= 8) && a21 <= 9)) || (((a12 + 45156 <= 0 && a21 == 10) && a15 <= 8) && !(5 == a15)))) [2019-11-15 23:54:09,295 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039) && (8 == a21 && a24 == 1) && !(5 == a15)) && a15 <= 8) || ((a24 == 1 && a15 == 9) && 80 < a12)) || (((a12 <= 75 && 8 == a21) && a24 == 1) && a15 == 9)) || (((a21 == 6 && a24 == 1 && !(5 == a15)) && a15 <= 8) && !(a15 == 8))) || (((a24 == 1 && !(a15 == 8)) && a15 <= 8) && (a12 <= 11 && !(5 == a15)) && 0 < a12 + 43)) || ((a12 + 45156 <= 0 && (((((!(a21 == 9) && a12 + 43 <= 0) || (a12 + 43 <= 0 && !(5 == a15))) || a12 + 49 <= 0) && a15 <= 8) && a21 <= 9) && a21 <= 6) && !(a15 == 8))) || (((a21 == 6 && (!(a21 == 6) || 80 < a12)) && a24 == 1 && a15 <= 8) && (\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039))) || ((((8 == a21 && a24 == 1) && !(5 == a15)) && !(a15 == 8)) && a15 <= 8)) || (((a24 == 1 && a21 == 7) && a12 <= 11) && a15 <= 8)) || ((((((\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039) && a24 == 1) && a21 == 10) && a15 <= 8) && !(5 == a15)) && 0 < a12 + 43) || ((((a24 == 1 && a21 == 10) && a15 <= 8) && a12 <= 73281) && 0 < a12 + 43)) || (((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11)) || (!(a15 == 8) && (a24 == 1 && a21 == 7) && a15 <= 8)) || ((((((a12 <= 80 && a21 <= 9) && !(a21 == 7)) && 0 < a12 + 43) && (!(a21 == 6) || 80 < a12)) && a24 == 1) && a15 <= 8)) || ((((((\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039) && a24 == 1) && !(a15 == 8)) && a15 <= 8) && !(5 == a15)) && a21 <= 9)) || ((a15 == 7 && a24 == 1) && a21 == 10)) || (a24 == 1 && (((8 == a15 && a12 + 43 <= 0 && 10 == a21) || (((((!(a21 == 9) && a12 + 43 <= 0) || (a12 + 43 <= 0 && !(5 == a15))) || a12 + 49 <= 0) && a15 <= 8) && a21 <= 9)) || (((a12 + 45156 <= 0 && a21 == 10) && a15 <= 8) && !(5 == a15)))) [2019-11-15 23:54:09,405 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_4b83e986-8c50-44a5-ae80-88b44ebbadc7/bin/uautomizer/witness.graphml [2019-11-15 23:54:09,406 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:54:09,407 INFO L168 Benchmark]: Toolchain (without parser) took 107703.73 ms. Allocated memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: 4.0 GB). Free memory was 944.7 MB in the beginning and 871.6 MB in the end (delta: 73.1 MB). Peak memory consumption was 4.1 GB. Max. memory is 11.5 GB. [2019-11-15 23:54:09,407 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:54:09,407 INFO L168 Benchmark]: CACSL2BoogieTranslator took 649.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -143.6 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:54:09,408 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:54:09,408 INFO L168 Benchmark]: Boogie Preprocessor took 121.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:54:09,408 INFO L168 Benchmark]: RCFGBuilder took 1714.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 941.7 MB in the end (delta: 125.8 MB). Peak memory consumption was 125.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:54:09,409 INFO L168 Benchmark]: TraceAbstraction took 104924.16 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 941.7 MB in the beginning and 899.1 MB in the end (delta: 42.7 MB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2019-11-15 23:54:09,409 INFO L168 Benchmark]: Witness Printer took 184.57 ms. Allocated memory is still 5.1 GB. Free memory was 899.1 MB in the beginning and 871.6 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2019-11-15 23:54:09,411 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 649.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -143.6 MB). Peak memory consumption was 24.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 105.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.8 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 121.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1714.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 941.7 MB in the end (delta: 125.8 MB). Peak memory consumption was 125.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 104924.16 ms. Allocated memory was 1.2 GB in the beginning and 5.1 GB in the end (delta: 3.9 GB). Free memory was 941.7 MB in the beginning and 899.1 MB in the end (delta: 42.7 MB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. * Witness Printer took 184.57 ms. Allocated memory is still 5.1 GB. Free memory was 899.1 MB in the beginning and 871.6 MB in the end (delta: 27.5 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 160]: 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: 880]: Loop Invariant [2019-11-15 23:54:09,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,421 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,422 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,423 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,424 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,426 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,427 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,428 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,429 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] Derived loop invariant: (((((((((((((((((\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039) && (8 == a21 && a24 == 1) && !(5 == a15)) && a15 <= 8) || ((a24 == 1 && a15 == 9) && 80 < a12)) || (((a12 <= 75 && 8 == a21) && a24 == 1) && a15 == 9)) || (((a21 == 6 && a24 == 1 && !(5 == a15)) && a15 <= 8) && !(a15 == 8))) || (((a24 == 1 && !(a15 == 8)) && a15 <= 8) && (a12 <= 11 && !(5 == a15)) && 0 < a12 + 43)) || ((a12 + 45156 <= 0 && (((((!(a21 == 9) && a12 + 43 <= 0) || (a12 + 43 <= 0 && !(5 == a15))) || a12 + 49 <= 0) && a15 <= 8) && a21 <= 9) && a21 <= 6) && !(a15 == 8))) || (((a21 == 6 && (!(a21 == 6) || 80 < a12)) && a24 == 1 && a15 <= 8) && (\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039))) || ((((8 == a21 && a24 == 1) && !(5 == a15)) && !(a15 == 8)) && a15 <= 8)) || (((a24 == 1 && a21 == 7) && a12 <= 11) && a15 <= 8)) || ((((((\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039) && a24 == 1) && a21 == 10) && a15 <= 8) && !(5 == a15)) && 0 < a12 + 43) || ((((a24 == 1 && a21 == 10) && a15 <= 8) && a12 <= 73281) && 0 < a12 + 43)) || (((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11)) || (!(a15 == 8) && (a24 == 1 && a21 == 7) && a15 <= 8)) || ((((((a12 <= 80 && a21 <= 9) && !(a21 == 7)) && 0 < a12 + 43) && (!(a21 == 6) || 80 < a12)) && a24 == 1) && a15 <= 8)) || ((((((\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039) && a24 == 1) && !(a15 == 8)) && a15 <= 8) && !(5 == a15)) && a21 <= 9)) || ((a15 == 7 && a24 == 1) && a21 == 10)) || (a24 == 1 && (((8 == a15 && a12 + 43 <= 0 && 10 == a21) || (((((!(a21 == 9) && a12 + 43 <= 0) || (a12 + 43 <= 0 && !(5 == a15))) || a12 + 49 <= 0) && a15 <= 8) && a21 <= 9)) || (((a12 + 45156 <= 0 && a21 == 10) && a15 <= 8) && !(5 == a15)))) - InvariantResult [Line: 20]: Loop Invariant [2019-11-15 23:54:09,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,431 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,432 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,433 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,435 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,435 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,435 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,436 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] [2019-11-15 23:54:09,437 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a12~0_448,QUANTIFIED] Derived loop invariant: (((((((((((((((((\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039) && (8 == a21 && a24 == 1) && !(5 == a15)) && a15 <= 8) || ((a24 == 1 && a15 == 9) && 80 < a12)) || (((a12 <= 75 && 8 == a21) && a24 == 1) && a15 == 9)) || (((a21 == 6 && a24 == 1 && !(5 == a15)) && a15 <= 8) && !(a15 == 8))) || (((a24 == 1 && !(a15 == 8)) && a15 <= 8) && (a12 <= 11 && !(5 == a15)) && 0 < a12 + 43)) || ((a12 + 45156 <= 0 && (((((!(a21 == 9) && a12 + 43 <= 0) || (a12 + 43 <= 0 && !(5 == a15))) || a12 + 49 <= 0) && a15 <= 8) && a21 <= 9) && a21 <= 6) && !(a15 == 8))) || (((a21 == 6 && (!(a21 == 6) || 80 < a12)) && a24 == 1 && a15 <= 8) && (\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039))) || ((((8 == a21 && a24 == 1) && !(5 == a15)) && !(a15 == 8)) && a15 <= 8)) || (((a24 == 1 && a21 == 7) && a12 <= 11) && a15 <= 8)) || ((((((\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039) && a24 == 1) && a21 == 10) && a15 <= 8) && !(5 == a15)) && 0 < a12 + 43) || ((((a24 == 1 && a21 == 10) && a15 <= 8) && a12 <= 73281) && 0 < a12 + 43)) || (((a24 == 1 && a21 == 10) && a15 == 9) && a12 <= 11)) || (!(a15 == 8) && (a24 == 1 && a21 == 7) && a15 <= 8)) || ((((((a12 <= 80 && a21 <= 9) && !(a21 == 7)) && 0 < a12 + 43) && (!(a21 == 6) || 80 < a12)) && a24 == 1) && a15 <= 8)) || ((((((\exists v_~a12~0_448 : int :: (0 <= v_~a12~0_448 && 80 < v_~a12~0_448) && a12 <= v_~a12~0_448 % 299959 + 300039) && a24 == 1) && !(a15 == 8)) && a15 <= 8) && !(5 == a15)) && a21 <= 9)) || ((a15 == 7 && a24 == 1) && a21 == 10)) || (a24 == 1 && (((8 == a15 && a12 + 43 <= 0 && 10 == a21) || (((((!(a21 == 9) && a12 + 43 <= 0) || (a12 + 43 <= 0 && !(5 == a15))) || a12 + 49 <= 0) && a15 <= 8) && a21 <= 9)) || (((a12 + 45156 <= 0 && a21 == 10) && a15 <= 8) && !(5 == a15)))) - InvariantResult [Line: 874]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 245 locations, 1 error locations. Result: SAFE, OverallTime: 104.8s, OverallIterations: 23, TraceHistogramMax: 18, AutomataDifference: 40.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.2s, HoareTripleCheckerStatistics: 1608 SDtfs, 16346 SDslu, 427 SDs, 0 SdLazy, 31391 SolverSat, 3158 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 11211 GetRequests, 11017 SyntacticMatches, 19 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 10.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7480occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.7s AutomataMinimizationTime, 23 MinimizatonAttempts, 15941 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 126 NumberOfFragments, 873 HoareAnnotationTreeSize, 3 FomulaSimplifications, 983308 FormulaSimplificationTreeSizeReduction, 1.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 348416 FormulaSimplificationTreeSizeReductionInter, 6.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 29.4s InterpolantComputationTime, 29972 NumberOfCodeBlocks, 29972 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 29935 ConstructedInterpolants, 441 QuantifiedInterpolants, 99491586 SizeOfPredicates, 20 NumberOfNonLiveVariables, 13573 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 37 InterpolantComputations, 17 PerfectInterpolantSequences, 107109/112774 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...