./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem03_label42.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_fd832890-b192-47f1-84c5-3804a581c063/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fd832890-b192-47f1-84c5-3804a581c063/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fd832890-b192-47f1-84c5-3804a581c063/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fd832890-b192-47f1-84c5-3804a581c063/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem03_label42.c -s /tmp/vcloud-vcloud-master/worker/run_dir_fd832890-b192-47f1-84c5-3804a581c063/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fd832890-b192-47f1-84c5-3804a581c063/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 e264c6bfc59204684e8ff5f8f4a46a363046b0d1 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:26:43,413 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:26:43,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:26:43,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:26:43,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:26:43,436 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:26:43,438 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:26:43,449 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:26:43,455 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:26:43,459 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:26:43,461 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:26:43,462 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:26:43,463 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:26:43,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:26:43,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:26:43,468 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:26:43,469 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:26:43,471 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:26:43,474 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:26:43,478 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:26:43,482 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:26:43,484 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:26:43,487 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:26:43,487 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:26:43,490 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:26:43,490 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:26:43,491 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:26:43,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:26:43,493 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:26:43,494 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:26:43,495 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:26:43,495 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:26:43,496 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:26:43,497 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:26:43,499 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:26:43,499 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:26:43,500 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:26:43,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:26:43,500 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:26:43,501 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:26:43,502 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:26:43,503 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fd832890-b192-47f1-84c5-3804a581c063/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:26:43,534 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:26:43,550 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:26:43,551 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:26:43,551 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:26:43,551 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:26:43,552 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:26:43,552 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:26:43,552 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:26:43,552 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:26:43,553 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:26:43,553 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:26:43,553 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:26:43,553 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:26:43,554 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:26:43,554 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:26:43,554 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:26:43,554 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:26:43,555 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:26:43,555 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:26:43,555 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:26:43,555 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:26:43,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:26:43,556 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:26:43,556 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:26:43,556 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:26:43,557 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:26:43,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:26:43,557 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:26:43,557 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_fd832890-b192-47f1-84c5-3804a581c063/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 -> e264c6bfc59204684e8ff5f8f4a46a363046b0d1 [2019-11-16 00:26:43,588 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:26:43,600 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:26:43,604 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:26:43,606 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:26:43,606 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:26:43,607 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fd832890-b192-47f1-84c5-3804a581c063/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem03_label42.c [2019-11-16 00:26:43,679 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fd832890-b192-47f1-84c5-3804a581c063/bin/uautomizer/data/374fb6982/aa5c437c04c24c8a8a045d3af3572bb9/FLAGd71ece029 [2019-11-16 00:26:44,375 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:26:44,379 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fd832890-b192-47f1-84c5-3804a581c063/sv-benchmarks/c/eca-rers2012/Problem03_label42.c [2019-11-16 00:26:44,401 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fd832890-b192-47f1-84c5-3804a581c063/bin/uautomizer/data/374fb6982/aa5c437c04c24c8a8a045d3af3572bb9/FLAGd71ece029 [2019-11-16 00:26:44,619 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fd832890-b192-47f1-84c5-3804a581c063/bin/uautomizer/data/374fb6982/aa5c437c04c24c8a8a045d3af3572bb9 [2019-11-16 00:26:44,623 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:26:44,625 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:26:44,630 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:26:44,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:26:44,634 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:26:44,635 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:26:44" (1/1) ... [2019-11-16 00:26:44,638 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56110345 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:44, skipping insertion in model container [2019-11-16 00:26:44,639 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:26:44" (1/1) ... [2019-11-16 00:26:44,654 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:26:44,751 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:26:45,555 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:26:45,565 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:26:45,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:26:45,906 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:26:45,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:45 WrapperNode [2019-11-16 00:26:45,908 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:26:45,909 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:26:45,909 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:26:45,909 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:26:45,919 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:45" (1/1) ... [2019-11-16 00:26:45,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:45" (1/1) ... [2019-11-16 00:26:46,078 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:26:46,080 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:26:46,080 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:26:46,080 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:26:46,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:45" (1/1) ... [2019-11-16 00:26:46,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:45" (1/1) ... [2019-11-16 00:26:46,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:45" (1/1) ... [2019-11-16 00:26:46,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:45" (1/1) ... [2019-11-16 00:26:46,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:45" (1/1) ... [2019-11-16 00:26:46,190 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:45" (1/1) ... [2019-11-16 00:26:46,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:45" (1/1) ... [2019-11-16 00:26:46,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:26:46,217 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:26:46,217 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:26:46,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:26:46,218 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd832890-b192-47f1-84c5-3804a581c063/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-16 00:26:46,302 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:26:46,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:26:48,900 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:26:48,901 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:26:48,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:26:48 BoogieIcfgContainer [2019-11-16 00:26:48,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:26:48,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:26:48,904 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:26:48,907 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:26:48,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:26:44" (1/3) ... [2019-11-16 00:26:48,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7984df82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:26:48, skipping insertion in model container [2019-11-16 00:26:48,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:26:45" (2/3) ... [2019-11-16 00:26:48,909 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7984df82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:26:48, skipping insertion in model container [2019-11-16 00:26:48,909 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:26:48" (3/3) ... [2019-11-16 00:26:48,911 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem03_label42.c [2019-11-16 00:26:48,922 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:26:48,930 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:26:48,941 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:26:48,983 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:26:48,983 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:26:48,983 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:26:48,984 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:26:48,984 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:26:48,984 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:26:48,984 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:26:48,984 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:26:49,008 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states. [2019-11-16 00:26:49,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-11-16 00:26:49,030 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:49,032 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:26:49,034 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:49,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:49,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1065786898, now seen corresponding path program 1 times [2019-11-16 00:26:49,049 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:49,050 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798332479] [2019-11-16 00:26:49,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:49,050 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:49,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:49,893 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-16 00:26:49,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798332479] [2019-11-16 00:26:49,895 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:49,895 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:26:49,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551843006] [2019-11-16 00:26:49,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:49,907 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:49,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:49,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:49,920 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 3 states. [2019-11-16 00:26:51,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:51,719 INFO L93 Difference]: Finished difference Result 829 states and 1478 transitions. [2019-11-16 00:26:51,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:51,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 196 [2019-11-16 00:26:51,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:51,743 INFO L225 Difference]: With dead ends: 829 [2019-11-16 00:26:51,743 INFO L226 Difference]: Without dead ends: 463 [2019-11-16 00:26:51,749 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:51,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-11-16 00:26:51,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 449. [2019-11-16 00:26:51,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-16 00:26:51,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 725 transitions. [2019-11-16 00:26:51,838 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 725 transitions. Word has length 196 [2019-11-16 00:26:51,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:51,840 INFO L462 AbstractCegarLoop]: Abstraction has 449 states and 725 transitions. [2019-11-16 00:26:51,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:51,840 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 725 transitions. [2019-11-16 00:26:51,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2019-11-16 00:26:51,848 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:51,848 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:51,849 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:51,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:51,850 INFO L82 PathProgramCache]: Analyzing trace with hash -32063774, now seen corresponding path program 1 times [2019-11-16 00:26:51,850 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:51,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149642481] [2019-11-16 00:26:51,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:51,851 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:51,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:52,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:26:52,085 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149642481] [2019-11-16 00:26:52,085 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:52,086 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:52,086 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076710257] [2019-11-16 00:26:52,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:26:52,101 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:52,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:26:52,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:26:52,104 INFO L87 Difference]: Start difference. First operand 449 states and 725 transitions. Second operand 4 states. [2019-11-16 00:26:54,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:54,242 INFO L93 Difference]: Finished difference Result 1735 states and 2827 transitions. [2019-11-16 00:26:54,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:26:54,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2019-11-16 00:26:54,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:54,250 INFO L225 Difference]: With dead ends: 1735 [2019-11-16 00:26:54,250 INFO L226 Difference]: Without dead ends: 1288 [2019-11-16 00:26:54,256 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-16 00:26:54,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2019-11-16 00:26:54,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 859. [2019-11-16 00:26:54,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2019-11-16 00:26:54,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 1315 transitions. [2019-11-16 00:26:54,333 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 1315 transitions. Word has length 201 [2019-11-16 00:26:54,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:54,334 INFO L462 AbstractCegarLoop]: Abstraction has 859 states and 1315 transitions. [2019-11-16 00:26:54,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:26:54,334 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 1315 transitions. [2019-11-16 00:26:54,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-16 00:26:54,340 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:54,340 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:26:54,341 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:54,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:54,341 INFO L82 PathProgramCache]: Analyzing trace with hash -2017736626, now seen corresponding path program 1 times [2019-11-16 00:26:54,342 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:54,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189421143] [2019-11-16 00:26:54,343 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:54,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:54,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:54,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:54,461 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:26:54,462 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189421143] [2019-11-16 00:26:54,462 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:54,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:26:54,463 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616920406] [2019-11-16 00:26:54,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:54,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:54,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:54,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:54,465 INFO L87 Difference]: Start difference. First operand 859 states and 1315 transitions. Second operand 3 states. [2019-11-16 00:26:55,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:55,111 INFO L93 Difference]: Finished difference Result 1695 states and 2599 transitions. [2019-11-16 00:26:55,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:55,112 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-11-16 00:26:55,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:55,118 INFO L225 Difference]: With dead ends: 1695 [2019-11-16 00:26:55,118 INFO L226 Difference]: Without dead ends: 838 [2019-11-16 00:26:55,120 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:55,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-11-16 00:26:55,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 838. [2019-11-16 00:26:55,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-11-16 00:26:55,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1236 transitions. [2019-11-16 00:26:55,147 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1236 transitions. Word has length 209 [2019-11-16 00:26:55,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:55,147 INFO L462 AbstractCegarLoop]: Abstraction has 838 states and 1236 transitions. [2019-11-16 00:26:55,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:55,148 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1236 transitions. [2019-11-16 00:26:55,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-16 00:26:55,152 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:55,152 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:55,153 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:55,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:55,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1890661660, now seen corresponding path program 1 times [2019-11-16 00:26:55,154 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:55,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584190428] [2019-11-16 00:26:55,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:55,154 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:55,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:55,308 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-16 00:26:55,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584190428] [2019-11-16 00:26:55,309 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:55,309 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:55,309 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040239586] [2019-11-16 00:26:55,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:26:55,311 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:55,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:26:55,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:26:55,312 INFO L87 Difference]: Start difference. First operand 838 states and 1236 transitions. Second operand 4 states. [2019-11-16 00:26:57,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:57,195 INFO L93 Difference]: Finished difference Result 3313 states and 4894 transitions. [2019-11-16 00:26:57,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:26:57,195 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-11-16 00:26:57,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:57,212 INFO L225 Difference]: With dead ends: 3313 [2019-11-16 00:26:57,213 INFO L226 Difference]: Without dead ends: 2477 [2019-11-16 00:26:57,215 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-16 00:26:57,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2477 states. [2019-11-16 00:26:57,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2477 to 1655. [2019-11-16 00:26:57,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1655 states. [2019-11-16 00:26:57,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1655 states to 1655 states and 2337 transitions. [2019-11-16 00:26:57,272 INFO L78 Accepts]: Start accepts. Automaton has 1655 states and 2337 transitions. Word has length 210 [2019-11-16 00:26:57,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:57,272 INFO L462 AbstractCegarLoop]: Abstraction has 1655 states and 2337 transitions. [2019-11-16 00:26:57,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:26:57,273 INFO L276 IsEmpty]: Start isEmpty. Operand 1655 states and 2337 transitions. [2019-11-16 00:26:57,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-11-16 00:26:57,279 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:57,280 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:57,280 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:57,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:57,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1263756579, now seen corresponding path program 1 times [2019-11-16 00:26:57,281 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:57,281 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366398646] [2019-11-16 00:26:57,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:57,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:57,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:57,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:57,405 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-16 00:26:57,406 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366398646] [2019-11-16 00:26:57,406 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:57,406 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:26:57,406 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138967747] [2019-11-16 00:26:57,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:57,407 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:57,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:57,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:57,408 INFO L87 Difference]: Start difference. First operand 1655 states and 2337 transitions. Second operand 3 states. [2019-11-16 00:26:58,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:58,707 INFO L93 Difference]: Finished difference Result 4133 states and 5815 transitions. [2019-11-16 00:26:58,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:58,708 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 213 [2019-11-16 00:26:58,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:58,724 INFO L225 Difference]: With dead ends: 4133 [2019-11-16 00:26:58,724 INFO L226 Difference]: Without dead ends: 2480 [2019-11-16 00:26:58,727 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:58,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2019-11-16 00:26:58,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 2479. [2019-11-16 00:26:58,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2479 states. [2019-11-16 00:26:58,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 3454 transitions. [2019-11-16 00:26:58,808 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 3454 transitions. Word has length 213 [2019-11-16 00:26:58,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:58,808 INFO L462 AbstractCegarLoop]: Abstraction has 2479 states and 3454 transitions. [2019-11-16 00:26:58,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:58,809 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 3454 transitions. [2019-11-16 00:26:58,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2019-11-16 00:26:58,817 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:58,818 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:26:58,818 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:58,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:58,819 INFO L82 PathProgramCache]: Analyzing trace with hash -115502888, now seen corresponding path program 1 times [2019-11-16 00:26:58,819 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:58,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376696843] [2019-11-16 00:26:58,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:58,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:58,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:59,015 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-16 00:26:59,017 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376696843] [2019-11-16 00:26:59,017 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:59,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:26:59,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866379978] [2019-11-16 00:26:59,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:59,019 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:59,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:59,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:59,019 INFO L87 Difference]: Start difference. First operand 2479 states and 3454 transitions. Second operand 3 states. [2019-11-16 00:26:59,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:26:59,513 INFO L93 Difference]: Finished difference Result 7424 states and 10346 transitions. [2019-11-16 00:26:59,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:26:59,514 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 216 [2019-11-16 00:26:59,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:26:59,548 INFO L225 Difference]: With dead ends: 7424 [2019-11-16 00:26:59,548 INFO L226 Difference]: Without dead ends: 4947 [2019-11-16 00:26:59,552 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:59,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4947 states. [2019-11-16 00:26:59,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4947 to 4945. [2019-11-16 00:26:59,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4945 states. [2019-11-16 00:26:59,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4945 states to 4945 states and 6884 transitions. [2019-11-16 00:26:59,683 INFO L78 Accepts]: Start accepts. Automaton has 4945 states and 6884 transitions. Word has length 216 [2019-11-16 00:26:59,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:26:59,683 INFO L462 AbstractCegarLoop]: Abstraction has 4945 states and 6884 transitions. [2019-11-16 00:26:59,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:26:59,684 INFO L276 IsEmpty]: Start isEmpty. Operand 4945 states and 6884 transitions. [2019-11-16 00:26:59,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-16 00:26:59,694 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:26:59,694 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:26:59,694 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:26:59,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:26:59,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1543109555, now seen corresponding path program 1 times [2019-11-16 00:26:59,695 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:26:59,695 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930614931] [2019-11-16 00:26:59,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:59,696 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:26:59,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:26:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:26:59,795 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:26:59,795 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930614931] [2019-11-16 00:26:59,795 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:26:59,796 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:26:59,796 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105262282] [2019-11-16 00:26:59,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:26:59,797 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:26:59,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:26:59,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:26:59,797 INFO L87 Difference]: Start difference. First operand 4945 states and 6884 transitions. Second operand 3 states. [2019-11-16 00:27:01,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:01,031 INFO L93 Difference]: Finished difference Result 14560 states and 20285 transitions. [2019-11-16 00:27:01,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:27:01,031 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 218 [2019-11-16 00:27:01,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:01,094 INFO L225 Difference]: With dead ends: 14560 [2019-11-16 00:27:01,095 INFO L226 Difference]: Without dead ends: 9617 [2019-11-16 00:27:01,103 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:27:01,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9617 states. [2019-11-16 00:27:01,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9617 to 9615. [2019-11-16 00:27:01,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9615 states. [2019-11-16 00:27:01,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9615 states to 9615 states and 12497 transitions. [2019-11-16 00:27:01,334 INFO L78 Accepts]: Start accepts. Automaton has 9615 states and 12497 transitions. Word has length 218 [2019-11-16 00:27:01,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:01,335 INFO L462 AbstractCegarLoop]: Abstraction has 9615 states and 12497 transitions. [2019-11-16 00:27:01,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:27:01,335 INFO L276 IsEmpty]: Start isEmpty. Operand 9615 states and 12497 transitions. [2019-11-16 00:27:01,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-11-16 00:27:01,352 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:01,352 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:01,352 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:01,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:01,353 INFO L82 PathProgramCache]: Analyzing trace with hash 23285592, now seen corresponding path program 2 times [2019-11-16 00:27:01,353 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:01,353 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216015274] [2019-11-16 00:27:01,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:01,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:01,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:01,453 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:27:01,453 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216015274] [2019-11-16 00:27:01,454 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:01,454 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:27:01,454 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428361159] [2019-11-16 00:27:01,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:27:01,455 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:01,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:27:01,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:27:01,456 INFO L87 Difference]: Start difference. First operand 9615 states and 12497 transitions. Second operand 3 states. [2019-11-16 00:27:02,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:02,944 INFO L93 Difference]: Finished difference Result 26540 states and 34570 transitions. [2019-11-16 00:27:02,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:27:02,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-11-16 00:27:02,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:03,019 INFO L225 Difference]: With dead ends: 26540 [2019-11-16 00:27:03,019 INFO L226 Difference]: Without dead ends: 16927 [2019-11-16 00:27:03,033 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:27:03,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16927 states. [2019-11-16 00:27:03,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16927 to 16923. [2019-11-16 00:27:03,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16923 states. [2019-11-16 00:27:03,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16923 states to 16923 states and 20092 transitions. [2019-11-16 00:27:03,378 INFO L78 Accepts]: Start accepts. Automaton has 16923 states and 20092 transitions. Word has length 220 [2019-11-16 00:27:03,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:03,378 INFO L462 AbstractCegarLoop]: Abstraction has 16923 states and 20092 transitions. [2019-11-16 00:27:03,379 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:27:03,379 INFO L276 IsEmpty]: Start isEmpty. Operand 16923 states and 20092 transitions. [2019-11-16 00:27:03,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-11-16 00:27:03,407 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:03,407 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:27:03,407 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:03,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:03,408 INFO L82 PathProgramCache]: Analyzing trace with hash 633556933, now seen corresponding path program 1 times [2019-11-16 00:27:03,408 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:03,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919496528] [2019-11-16 00:27:03,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:03,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:03,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:03,543 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-16 00:27:03,544 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919496528] [2019-11-16 00:27:03,545 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:03,545 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:27:03,545 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407071244] [2019-11-16 00:27:03,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:27:03,546 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:03,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:27:03,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:27:03,548 INFO L87 Difference]: Start difference. First operand 16923 states and 20092 transitions. Second operand 4 states. [2019-11-16 00:27:04,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:04,807 INFO L93 Difference]: Finished difference Result 33846 states and 40186 transitions. [2019-11-16 00:27:04,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:27:04,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 238 [2019-11-16 00:27:04,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:04,840 INFO L225 Difference]: With dead ends: 33846 [2019-11-16 00:27:04,840 INFO L226 Difference]: Without dead ends: 16925 [2019-11-16 00:27:04,862 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-16 00:27:04,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16925 states. [2019-11-16 00:27:05,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16925 to 16923. [2019-11-16 00:27:05,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16923 states. [2019-11-16 00:27:05,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16923 states to 16923 states and 19543 transitions. [2019-11-16 00:27:05,169 INFO L78 Accepts]: Start accepts. Automaton has 16923 states and 19543 transitions. Word has length 238 [2019-11-16 00:27:05,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:05,169 INFO L462 AbstractCegarLoop]: Abstraction has 16923 states and 19543 transitions. [2019-11-16 00:27:05,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:27:05,170 INFO L276 IsEmpty]: Start isEmpty. Operand 16923 states and 19543 transitions. [2019-11-16 00:27:05,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-11-16 00:27:05,198 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:05,198 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:05,199 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:05,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:05,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1654047318, now seen corresponding path program 1 times [2019-11-16 00:27:05,208 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:05,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619652549] [2019-11-16 00:27:05,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:05,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:05,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:05,657 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 50 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:27:05,658 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619652549] [2019-11-16 00:27:05,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2035238854] [2019-11-16 00:27:05,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd832890-b192-47f1-84c5-3804a581c063/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-16 00:27:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:05,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:27:05,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:05,975 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-16 00:27:05,975 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:27:05,976 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-11-16 00:27:05,976 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892413984] [2019-11-16 00:27:05,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:27:05,981 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:05,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:27:05,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:27:05,982 INFO L87 Difference]: Start difference. First operand 16923 states and 19543 transitions. Second operand 3 states. [2019-11-16 00:27:07,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:07,218 INFO L93 Difference]: Finished difference Result 33645 states and 38869 transitions. [2019-11-16 00:27:07,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:27:07,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-11-16 00:27:07,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:07,269 INFO L225 Difference]: With dead ends: 33645 [2019-11-16 00:27:07,269 INFO L226 Difference]: Without dead ends: 16724 [2019-11-16 00:27:07,290 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 243 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:27:07,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16724 states. [2019-11-16 00:27:07,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16724 to 15705. [2019-11-16 00:27:07,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15705 states. [2019-11-16 00:27:07,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15705 states to 15705 states and 17742 transitions. [2019-11-16 00:27:07,567 INFO L78 Accepts]: Start accepts. Automaton has 15705 states and 17742 transitions. Word has length 244 [2019-11-16 00:27:07,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:07,568 INFO L462 AbstractCegarLoop]: Abstraction has 15705 states and 17742 transitions. [2019-11-16 00:27:07,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:27:07,568 INFO L276 IsEmpty]: Start isEmpty. Operand 15705 states and 17742 transitions. [2019-11-16 00:27:07,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2019-11-16 00:27:07,597 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:07,597 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:27:07,806 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:27:07,806 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:07,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:07,807 INFO L82 PathProgramCache]: Analyzing trace with hash 157230195, now seen corresponding path program 1 times [2019-11-16 00:27:07,807 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:07,807 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089296118] [2019-11-16 00:27:07,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:07,807 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:07,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:07,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:08,054 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 76 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-16 00:27:08,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089296118] [2019-11-16 00:27:08,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662582546] [2019-11-16 00:27:08,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fd832890-b192-47f1-84c5-3804a581c063/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-16 00:27:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:08,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:27:08,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:08,359 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-16 00:27:08,360 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:27:08,360 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2019-11-16 00:27:08,360 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376640466] [2019-11-16 00:27:08,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:27:08,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:08,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:27:08,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:27:08,362 INFO L87 Difference]: Start difference. First operand 15705 states and 17742 transitions. Second operand 3 states. [2019-11-16 00:27:09,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:09,198 INFO L93 Difference]: Finished difference Result 45849 states and 51764 transitions. [2019-11-16 00:27:09,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:27:09,199 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 273 [2019-11-16 00:27:09,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:09,249 INFO L225 Difference]: With dead ends: 45849 [2019-11-16 00:27:09,249 INFO L226 Difference]: Without dead ends: 30146 [2019-11-16 00:27:09,265 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 272 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:27:09,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30146 states. [2019-11-16 00:27:09,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30146 to 30144. [2019-11-16 00:27:09,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30144 states. [2019-11-16 00:27:09,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30144 states to 30144 states and 34011 transitions. [2019-11-16 00:27:09,713 INFO L78 Accepts]: Start accepts. Automaton has 30144 states and 34011 transitions. Word has length 273 [2019-11-16 00:27:09,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:09,718 INFO L462 AbstractCegarLoop]: Abstraction has 30144 states and 34011 transitions. [2019-11-16 00:27:09,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:27:09,718 INFO L276 IsEmpty]: Start isEmpty. Operand 30144 states and 34011 transitions. [2019-11-16 00:27:09,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2019-11-16 00:27:09,763 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:09,765 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:09,978 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:27:09,979 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:09,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:09,979 INFO L82 PathProgramCache]: Analyzing trace with hash -1715760606, now seen corresponding path program 1 times [2019-11-16 00:27:09,979 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:09,980 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613135239] [2019-11-16 00:27:09,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:09,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:09,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:10,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:10,360 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-11-16 00:27:10,361 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613135239] [2019-11-16 00:27:10,361 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:10,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:27:10,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650961380] [2019-11-16 00:27:10,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:27:10,362 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:10,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:27:10,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:27:10,363 INFO L87 Difference]: Start difference. First operand 30144 states and 34011 transitions. Second operand 3 states. [2019-11-16 00:27:11,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:11,219 INFO L93 Difference]: Finished difference Result 83876 states and 94508 transitions. [2019-11-16 00:27:11,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:27:11,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 347 [2019-11-16 00:27:11,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:11,283 INFO L225 Difference]: With dead ends: 83876 [2019-11-16 00:27:11,283 INFO L226 Difference]: Without dead ends: 53734 [2019-11-16 00:27:11,303 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:27:11,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53734 states. [2019-11-16 00:27:12,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53734 to 53732. [2019-11-16 00:27:12,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53732 states. [2019-11-16 00:27:12,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53732 states to 53732 states and 60487 transitions. [2019-11-16 00:27:12,349 INFO L78 Accepts]: Start accepts. Automaton has 53732 states and 60487 transitions. Word has length 347 [2019-11-16 00:27:12,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:12,349 INFO L462 AbstractCegarLoop]: Abstraction has 53732 states and 60487 transitions. [2019-11-16 00:27:12,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:27:12,350 INFO L276 IsEmpty]: Start isEmpty. Operand 53732 states and 60487 transitions. [2019-11-16 00:27:12,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2019-11-16 00:27:12,396 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:12,397 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:27:12,397 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:12,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:12,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1270062948, now seen corresponding path program 1 times [2019-11-16 00:27:12,398 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:12,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130319693] [2019-11-16 00:27:12,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:12,398 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:12,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:12,573 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2019-11-16 00:27:12,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130319693] [2019-11-16 00:27:12,574 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:12,574 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:27:12,575 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641276780] [2019-11-16 00:27:12,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:27:12,575 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:12,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:27:12,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:27:12,576 INFO L87 Difference]: Start difference. First operand 53732 states and 60487 transitions. Second operand 4 states. [2019-11-16 00:27:14,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:14,698 INFO L93 Difference]: Finished difference Result 120863 states and 136956 transitions. [2019-11-16 00:27:14,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:27:14,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 359 [2019-11-16 00:27:14,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:14,792 INFO L225 Difference]: With dead ends: 120863 [2019-11-16 00:27:14,793 INFO L226 Difference]: Without dead ends: 67133 [2019-11-16 00:27:14,827 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-16 00:27:14,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67133 states. [2019-11-16 00:27:16,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67133 to 67125. [2019-11-16 00:27:16,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67125 states. [2019-11-16 00:27:16,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67125 states to 67125 states and 74028 transitions. [2019-11-16 00:27:16,170 INFO L78 Accepts]: Start accepts. Automaton has 67125 states and 74028 transitions. Word has length 359 [2019-11-16 00:27:16,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:16,170 INFO L462 AbstractCegarLoop]: Abstraction has 67125 states and 74028 transitions. [2019-11-16 00:27:16,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:27:16,170 INFO L276 IsEmpty]: Start isEmpty. Operand 67125 states and 74028 transitions. [2019-11-16 00:27:16,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2019-11-16 00:27:16,214 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:16,215 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:27:16,215 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:16,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:16,216 INFO L82 PathProgramCache]: Analyzing trace with hash 316644986, now seen corresponding path program 1 times [2019-11-16 00:27:16,216 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:16,216 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882674639] [2019-11-16 00:27:16,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:16,217 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:16,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:16,636 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-11-16 00:27:16,636 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882674639] [2019-11-16 00:27:16,636 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:16,637 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:27:16,637 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343446276] [2019-11-16 00:27:16,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:27:16,638 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:16,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:27:16,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:27:16,638 INFO L87 Difference]: Start difference. First operand 67125 states and 74028 transitions. Second operand 3 states. [2019-11-16 00:27:18,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:18,075 INFO L93 Difference]: Finished difference Result 148092 states and 163567 transitions. [2019-11-16 00:27:18,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:27:18,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 423 [2019-11-16 00:27:18,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:18,077 INFO L225 Difference]: With dead ends: 148092 [2019-11-16 00:27:18,077 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:27:18,127 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:27:18,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:27:18,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:27:18,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:27:18,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:27:18,129 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 423 [2019-11-16 00:27:18,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:18,129 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:27:18,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:27:18,130 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:27:18,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:27:18,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:27:19,754 WARN L191 SmtUtils]: Spent 1.61 s on a formula simplification. DAG size of input: 441 DAG size of output: 146 [2019-11-16 00:27:20,748 WARN L191 SmtUtils]: Spent 991.00 ms on a formula simplification. DAG size of input: 441 DAG size of output: 146 [2019-11-16 00:27:22,069 WARN L191 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 145 DAG size of output: 63 [2019-11-16 00:27:23,052 WARN L191 SmtUtils]: Spent 981.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 63 [2019-11-16 00:27:23,054 INFO L443 ceAbstractionStarter]: For program point L498(lines 498 511) no Hoare annotation was computed. [2019-11-16 00:27:23,054 INFO L443 ceAbstractionStarter]: For program point L498-2(lines 498 511) no Hoare annotation was computed. [2019-11-16 00:27:23,054 INFO L443 ceAbstractionStarter]: For program point L1423(lines 1423 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,055 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,055 INFO L443 ceAbstractionStarter]: For program point L1622-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,055 INFO L443 ceAbstractionStarter]: For program point L1556-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,055 INFO L443 ceAbstractionStarter]: For program point L1490-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,055 INFO L443 ceAbstractionStarter]: For program point L301(lines 301 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,055 INFO L443 ceAbstractionStarter]: For program point L1226(lines 1226 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,055 INFO L443 ceAbstractionStarter]: For program point L1623(line 1623) no Hoare annotation was computed. [2019-11-16 00:27:23,055 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,055 INFO L443 ceAbstractionStarter]: For program point L1557(line 1557) no Hoare annotation was computed. [2019-11-16 00:27:23,055 INFO L443 ceAbstractionStarter]: For program point L1491(line 1491) no Hoare annotation was computed. [2019-11-16 00:27:23,055 INFO L443 ceAbstractionStarter]: For program point L434(lines 434 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,055 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,056 INFO L443 ceAbstractionStarter]: For program point L1095(lines 1095 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,056 INFO L443 ceAbstractionStarter]: For program point L633(lines 633 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,056 INFO L443 ceAbstractionStarter]: For program point L1360(lines 1360 1379) no Hoare annotation was computed. [2019-11-16 00:27:23,056 INFO L443 ceAbstractionStarter]: For program point L1360-2(lines 1360 1379) no Hoare annotation was computed. [2019-11-16 00:27:23,056 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,056 INFO L443 ceAbstractionStarter]: For program point L105(lines 105 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,056 INFO L443 ceAbstractionStarter]: For program point L1625-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,056 INFO L443 ceAbstractionStarter]: For program point L1559-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,056 INFO L443 ceAbstractionStarter]: For program point L1493-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,056 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,056 INFO L443 ceAbstractionStarter]: For program point L172(lines 172 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,057 INFO L443 ceAbstractionStarter]: For program point L1031(lines 1031 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,057 INFO L443 ceAbstractionStarter]: For program point L899(lines 899 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,057 INFO L443 ceAbstractionStarter]: For program point L701(lines 701 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,057 INFO L443 ceAbstractionStarter]: For program point L1626(line 1626) no Hoare annotation was computed. [2019-11-16 00:27:23,058 INFO L443 ceAbstractionStarter]: For program point L1560(line 1560) no Hoare annotation was computed. [2019-11-16 00:27:23,058 INFO L443 ceAbstractionStarter]: For program point L1494(line 1494) no Hoare annotation was computed. [2019-11-16 00:27:23,058 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,058 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,058 INFO L443 ceAbstractionStarter]: For program point L1628-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,058 INFO L443 ceAbstractionStarter]: For program point L1562-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,058 INFO L443 ceAbstractionStarter]: For program point L1496-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,059 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,059 INFO L443 ceAbstractionStarter]: For program point L1629(line 1629) no Hoare annotation was computed. [2019-11-16 00:27:23,059 INFO L443 ceAbstractionStarter]: For program point L1563(line 1563) no Hoare annotation was computed. [2019-11-16 00:27:23,059 INFO L443 ceAbstractionStarter]: For program point L1497(line 1497) no Hoare annotation was computed. [2019-11-16 00:27:23,059 INFO L443 ceAbstractionStarter]: For program point L441(lines 441 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,059 INFO L443 ceAbstractionStarter]: For program point L1432(lines 1432 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,059 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,059 INFO L443 ceAbstractionStarter]: For program point L1631-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,060 INFO L443 ceAbstractionStarter]: For program point L1565-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,060 INFO L443 ceAbstractionStarter]: For program point L1499-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,060 INFO L443 ceAbstractionStarter]: For program point L1632(line 1632) no Hoare annotation was computed. [2019-11-16 00:27:23,060 INFO L443 ceAbstractionStarter]: For program point L1566(line 1566) no Hoare annotation was computed. [2019-11-16 00:27:23,060 INFO L443 ceAbstractionStarter]: For program point L1500(line 1500) no Hoare annotation was computed. [2019-11-16 00:27:23,060 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,060 INFO L443 ceAbstractionStarter]: For program point L1104(lines 1104 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,061 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,061 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 395) no Hoare annotation was computed. [2019-11-16 00:27:23,061 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,061 INFO L443 ceAbstractionStarter]: For program point L378-2(lines 378 395) no Hoare annotation was computed. [2019-11-16 00:27:23,061 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,061 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,061 INFO L443 ceAbstractionStarter]: For program point L1039(lines 1039 1059) no Hoare annotation was computed. [2019-11-16 00:27:23,062 INFO L443 ceAbstractionStarter]: For program point L1039-2(lines 1039 1059) no Hoare annotation was computed. [2019-11-16 00:27:23,062 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,062 INFO L443 ceAbstractionStarter]: For program point L709(lines 709 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,062 INFO L443 ceAbstractionStarter]: For program point L643(lines 643 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,062 INFO L443 ceAbstractionStarter]: For program point L1634-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,062 INFO L443 ceAbstractionStarter]: For program point L1568-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,062 INFO L443 ceAbstractionStarter]: For program point L1502-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,062 INFO L443 ceAbstractionStarter]: For program point L181(lines 181 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,063 INFO L443 ceAbstractionStarter]: For program point L710(lines 710 731) no Hoare annotation was computed. [2019-11-16 00:27:23,063 INFO L443 ceAbstractionStarter]: For program point L710-2(lines 710 731) no Hoare annotation was computed. [2019-11-16 00:27:23,063 INFO L443 ceAbstractionStarter]: For program point L1635(line 1635) no Hoare annotation was computed. [2019-11-16 00:27:23,063 INFO L443 ceAbstractionStarter]: For program point L1569(line 1569) no Hoare annotation was computed. [2019-11-16 00:27:23,063 INFO L443 ceAbstractionStarter]: For program point L1503(line 1503) no Hoare annotation was computed. [2019-11-16 00:27:23,063 INFO L443 ceAbstractionStarter]: For program point L1305(lines 1305 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,063 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,064 INFO L443 ceAbstractionStarter]: For program point L1173(lines 1173 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,064 INFO L443 ceAbstractionStarter]: For program point L975(lines 975 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,064 INFO L443 ceAbstractionStarter]: For program point L777(lines 777 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,064 INFO L443 ceAbstractionStarter]: For program point L513(lines 513 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,064 INFO L443 ceAbstractionStarter]: For program point L844(lines 844 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,064 INFO L443 ceAbstractionStarter]: For program point L1637-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,064 INFO L443 ceAbstractionStarter]: For program point L1571-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,064 INFO L443 ceAbstractionStarter]: For program point L1505-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,065 INFO L443 ceAbstractionStarter]: For program point L1638(line 1638) no Hoare annotation was computed. [2019-11-16 00:27:23,065 INFO L443 ceAbstractionStarter]: For program point L1572(line 1572) no Hoare annotation was computed. [2019-11-16 00:27:23,065 INFO L443 ceAbstractionStarter]: For program point L1506(line 1506) no Hoare annotation was computed. [2019-11-16 00:27:23,065 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,065 INFO L443 ceAbstractionStarter]: For program point L583(lines 583 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,065 INFO L443 ceAbstractionStarter]: For program point L1640-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,065 INFO L443 ceAbstractionStarter]: For program point L1574-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,066 INFO L443 ceAbstractionStarter]: For program point L1508-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,066 INFO L443 ceAbstractionStarter]: For program point L1442(lines 1442 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,066 INFO L443 ceAbstractionStarter]: For program point L319(lines 319 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,066 INFO L443 ceAbstractionStarter]: For program point L1112(lines 1112 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,066 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,066 INFO L443 ceAbstractionStarter]: For program point L1641(line 1641) no Hoare annotation was computed. [2019-11-16 00:27:23,066 INFO L443 ceAbstractionStarter]: For program point L1575(line 1575) no Hoare annotation was computed. [2019-11-16 00:27:23,066 INFO L443 ceAbstractionStarter]: For program point L1509(line 1509) no Hoare annotation was computed. [2019-11-16 00:27:23,067 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 71) no Hoare annotation was computed. [2019-11-16 00:27:23,067 INFO L443 ceAbstractionStarter]: For program point L56-2(lines 56 71) no Hoare annotation was computed. [2019-11-16 00:27:23,067 INFO L443 ceAbstractionStarter]: For program point L784(lines 784 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,067 INFO L443 ceAbstractionStarter]: For program point L1643-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,067 INFO L443 ceAbstractionStarter]: For program point L1577-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,067 INFO L443 ceAbstractionStarter]: For program point L1511-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,067 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,067 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:27:23,068 INFO L443 ceAbstractionStarter]: For program point L983(lines 983 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,068 INFO L443 ceAbstractionStarter]: For program point L917(lines 917 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,068 INFO L443 ceAbstractionStarter]: For program point L653(lines 653 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,068 INFO L443 ceAbstractionStarter]: For program point L1644(line 1644) no Hoare annotation was computed. [2019-11-16 00:27:23,068 INFO L443 ceAbstractionStarter]: For program point L1578(line 1578) no Hoare annotation was computed. [2019-11-16 00:27:23,068 INFO L443 ceAbstractionStarter]: For program point L1512(line 1512) no Hoare annotation was computed. [2019-11-16 00:27:23,068 INFO L443 ceAbstractionStarter]: For program point L257(lines 257 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,069 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,069 INFO L443 ceAbstractionStarter]: For program point L1182(lines 1182 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,069 INFO L443 ceAbstractionStarter]: For program point L918(lines 918 935) no Hoare annotation was computed. [2019-11-16 00:27:23,069 INFO L443 ceAbstractionStarter]: For program point L918-2(lines 918 935) no Hoare annotation was computed. [2019-11-16 00:27:23,069 INFO L443 ceAbstractionStarter]: For program point L522(lines 522 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,069 INFO L443 ceAbstractionStarter]: For program point L1381(lines 1381 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,069 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,070 INFO L443 ceAbstractionStarter]: For program point L192(lines 192 211) no Hoare annotation was computed. [2019-11-16 00:27:23,070 INFO L443 ceAbstractionStarter]: For program point L126(lines 126 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,070 INFO L443 ceAbstractionStarter]: For program point L192-2(lines 192 211) no Hoare annotation was computed. [2019-11-16 00:27:23,070 INFO L443 ceAbstractionStarter]: For program point L853(lines 853 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,070 INFO L443 ceAbstractionStarter]: For program point L1646-1(lines 1646 1648) no Hoare annotation was computed. [2019-11-16 00:27:23,070 INFO L443 ceAbstractionStarter]: For program point L1580-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,070 INFO L443 ceAbstractionStarter]: For program point L1514-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,071 INFO L443 ceAbstractionStarter]: For program point L1382(lines 1382 1400) no Hoare annotation was computed. [2019-11-16 00:27:23,071 INFO L443 ceAbstractionStarter]: For program point L1382-2(lines 1382 1400) no Hoare annotation was computed. [2019-11-16 00:27:23,071 INFO L443 ceAbstractionStarter]: For program point L1250(lines 1250 1272) no Hoare annotation was computed. [2019-11-16 00:27:23,071 INFO L443 ceAbstractionStarter]: For program point L1250-2(lines 1250 1272) no Hoare annotation was computed. [2019-11-16 00:27:23,071 INFO L443 ceAbstractionStarter]: For program point L1647(line 1647) no Hoare annotation was computed. [2019-11-16 00:27:23,071 INFO L443 ceAbstractionStarter]: For program point L1581(line 1581) no Hoare annotation was computed. [2019-11-16 00:27:23,071 INFO L443 ceAbstractionStarter]: For program point L1515(line 1515) no Hoare annotation was computed. [2019-11-16 00:27:23,071 INFO L443 ceAbstractionStarter]: For program point L458(lines 458 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,072 INFO L443 ceAbstractionStarter]: For program point L1120(lines 1120 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,072 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,073 INFO L439 ceAbstractionStarter]: At program point L1649(lines 54 1650) the Hoare annotation is: (let ((.cse1 (= 1 ~a6~0)) (.cse12 (= ~a27~0 1)) (.cse0 (not (= ~a12~0 1)))) (let ((.cse15 (and .cse12 .cse0)) (.cse16 (not .cse1)) (.cse2 (= ~a5~0 1))) (let ((.cse14 (and .cse0 .cse16 .cse2)) (.cse9 (and .cse15 .cse16 .cse2)) (.cse7 (and .cse16 .cse2)) (.cse8 (<= ~a3~0 0)) (.cse4 (= ~a26~0 1)) (.cse6 (= 1 ~a0~0)) (.cse5 (<= ~a11~0 0)) (.cse10 (= 1 ~a4~0)) (.cse13 (= 1 ~a3~0)) (.cse3 (= ~a11~0 1)) (.cse11 (= ~a16~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse4) (and .cse3 .cse4 .cse6 .cse7) (and .cse8 .cse9 .cse3 .cse10) (and .cse8 .cse2 .cse3 .cse4 .cse11 .cse10) (and .cse8 .cse12 .cse1 .cse2 .cse3 .cse6) (and .cse8 .cse5 .cse2 .cse4 .cse11) (and .cse12 .cse1 .cse2 .cse3 .cse11 .cse10) (and .cse8 .cse5 .cse2 .cse6 .cse11) (and .cse5 .cse4 .cse7) (and .cse8 .cse5 .cse7) (and .cse3 .cse4 .cse7 .cse10) (and .cse13 .cse5 .cse6 .cse7) (and .cse1 .cse5 .cse2 .cse6 .cse11 .cse10) (and .cse12 .cse1 .cse5 .cse2 .cse10) (and .cse14 .cse3 .cse6) (and .cse12 .cse5 .cse2 .cse6) (and .cse5 .cse2 .cse4 .cse6) (and .cse0 .cse1 .cse5 .cse2 .cse6) (and .cse14 .cse3 .cse11) (and .cse8 .cse12 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse2 .cse3 .cse4 .cse6) (and .cse9 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse2 .cse11) (and .cse8 .cse3 .cse4 .cse11 .cse7) (and .cse8 .cse1 .cse15 .cse2 .cse3) (and .cse5 .cse2 .cse4 .cse10) (and .cse13 .cse5 .cse2 .cse6 .cse10) (and .cse1 .cse5 .cse15 .cse2) (and .cse12 .cse2 .cse3 .cse4 .cse6 .cse11) (and .cse0 .cse1 .cse5 .cse2 .cse10) (and .cse13 .cse1 .cse2 .cse3 .cse11))))) [2019-11-16 00:27:23,073 INFO L443 ceAbstractionStarter]: For program point L592(lines 592 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,073 INFO L443 ceAbstractionStarter]: For program point L1583-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,073 INFO L443 ceAbstractionStarter]: For program point L1517-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,073 INFO L443 ceAbstractionStarter]: For program point L1584(line 1584) no Hoare annotation was computed. [2019-11-16 00:27:23,073 INFO L443 ceAbstractionStarter]: For program point L1518(line 1518) no Hoare annotation was computed. [2019-11-16 00:27:23,073 INFO L443 ceAbstractionStarter]: For program point L1452(lines 1452 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,074 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,074 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:27:23,074 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,074 INFO L446 ceAbstractionStarter]: At program point L1652(lines 1652 1669) the Hoare annotation is: true [2019-11-16 00:27:23,074 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,074 INFO L443 ceAbstractionStarter]: For program point L1586-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,074 INFO L443 ceAbstractionStarter]: For program point L1520-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,075 INFO L443 ceAbstractionStarter]: For program point L397(lines 397 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,075 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,075 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,075 INFO L443 ceAbstractionStarter]: For program point L1587(line 1587) no Hoare annotation was computed. [2019-11-16 00:27:23,075 INFO L443 ceAbstractionStarter]: For program point L1521(line 1521) no Hoare annotation was computed. [2019-11-16 00:27:23,075 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,075 INFO L443 ceAbstractionStarter]: For program point L135(lines 135 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,075 INFO L443 ceAbstractionStarter]: For program point L994(lines 994 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,076 INFO L443 ceAbstractionStarter]: For program point L1589-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,076 INFO L443 ceAbstractionStarter]: For program point L1523-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,076 INFO L443 ceAbstractionStarter]: For program point L1127(lines 1127 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,076 INFO L443 ceAbstractionStarter]: For program point L1061(lines 1061 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,076 INFO L443 ceAbstractionStarter]: For program point L863(lines 863 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,076 INFO L443 ceAbstractionStarter]: For program point L665(lines 665 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,076 INFO L443 ceAbstractionStarter]: For program point L1590(line 1590) no Hoare annotation was computed. [2019-11-16 00:27:23,077 INFO L443 ceAbstractionStarter]: For program point L1524(line 1524) no Hoare annotation was computed. [2019-11-16 00:27:23,077 INFO L443 ceAbstractionStarter]: For program point L467(lines 467 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,077 INFO L443 ceAbstractionStarter]: For program point L1326(lines 1326 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,077 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 478) no Hoare annotation was computed. [2019-11-16 00:27:23,077 INFO L443 ceAbstractionStarter]: For program point L468-2(lines 468 478) no Hoare annotation was computed. [2019-11-16 00:27:23,077 INFO L443 ceAbstractionStarter]: For program point L733(lines 733 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,078 INFO L439 ceAbstractionStarter]: At program point L1658-2(lines 1658 1668) the Hoare annotation is: (let ((.cse1 (= 1 ~a6~0)) (.cse12 (= ~a27~0 1)) (.cse0 (not (= ~a12~0 1)))) (let ((.cse15 (and .cse12 .cse0)) (.cse16 (not .cse1)) (.cse2 (= ~a5~0 1))) (let ((.cse14 (and .cse0 .cse16 .cse2)) (.cse9 (and .cse15 .cse16 .cse2)) (.cse7 (and .cse16 .cse2)) (.cse8 (<= ~a3~0 0)) (.cse4 (= ~a26~0 1)) (.cse6 (= 1 ~a0~0)) (.cse5 (<= ~a11~0 0)) (.cse10 (= 1 ~a4~0)) (.cse13 (= 1 ~a3~0)) (.cse3 (= ~a11~0 1)) (.cse11 (= ~a16~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse5 .cse2 .cse4) (and .cse3 .cse4 .cse6 .cse7) (and .cse8 .cse9 .cse3 .cse10) (and .cse8 .cse2 .cse3 .cse4 .cse11 .cse10) (and .cse8 .cse12 .cse1 .cse2 .cse3 .cse6) (and .cse8 .cse5 .cse2 .cse4 .cse11) (and .cse12 .cse1 .cse2 .cse3 .cse11 .cse10) (and .cse8 .cse5 .cse2 .cse6 .cse11) (and .cse5 .cse4 .cse7) (and .cse8 .cse5 .cse7) (and .cse3 .cse4 .cse7 .cse10) (and .cse13 .cse5 .cse6 .cse7) (and .cse1 .cse5 .cse2 .cse6 .cse11 .cse10) (and .cse12 .cse1 .cse5 .cse2 .cse10) (and .cse14 .cse3 .cse6) (and .cse12 .cse5 .cse2 .cse6) (and .cse5 .cse2 .cse4 .cse6) (and .cse0 .cse1 .cse5 .cse2 .cse6) (and .cse14 .cse3 .cse11) (and .cse8 .cse12 .cse1 .cse2 .cse3 .cse4) (and .cse8 .cse2 .cse3 .cse4 .cse6) (and .cse9 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse2 .cse11) (and .cse8 .cse3 .cse4 .cse11 .cse7) (and .cse8 .cse1 .cse15 .cse2 .cse3) (and .cse5 .cse2 .cse4 .cse10) (and .cse13 .cse5 .cse2 .cse6 .cse10) (and .cse1 .cse5 .cse15 .cse2) (and .cse12 .cse2 .cse3 .cse4 .cse6 .cse11) (and .cse0 .cse1 .cse5 .cse2 .cse10) (and .cse13 .cse1 .cse2 .cse3 .cse11))))) [2019-11-16 00:27:23,078 INFO L443 ceAbstractionStarter]: For program point L1592-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,078 INFO L443 ceAbstractionStarter]: For program point L1526-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,078 INFO L443 ceAbstractionStarter]: For program point L1460(lines 1460 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,078 INFO L443 ceAbstractionStarter]: For program point L73(lines 73 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,078 INFO L443 ceAbstractionStarter]: For program point L1593(line 1593) no Hoare annotation was computed. [2019-11-16 00:27:23,079 INFO L443 ceAbstractionStarter]: For program point L1527(line 1527) no Hoare annotation was computed. [2019-11-16 00:27:23,079 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,079 INFO L443 ceAbstractionStarter]: For program point L405(lines 405 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,079 INFO L443 ceAbstractionStarter]: For program point L339(lines 339 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,079 INFO L443 ceAbstractionStarter]: For program point L1132(lines 1132 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,079 INFO L443 ceAbstractionStarter]: For program point L1066(lines 1066 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,079 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,079 INFO L443 ceAbstractionStarter]: For program point L1595-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,080 INFO L443 ceAbstractionStarter]: For program point L1529-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,080 INFO L443 ceAbstractionStarter]: For program point L869(lines 869 887) no Hoare annotation was computed. [2019-11-16 00:27:23,080 INFO L443 ceAbstractionStarter]: For program point L869-2(lines 869 887) no Hoare annotation was computed. [2019-11-16 00:27:23,080 INFO L443 ceAbstractionStarter]: For program point L1596(line 1596) no Hoare annotation was computed. [2019-11-16 00:27:23,080 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,080 INFO L443 ceAbstractionStarter]: For program point L1530(line 1530) no Hoare annotation was computed. [2019-11-16 00:27:23,081 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1623) no Hoare annotation was computed. [2019-11-16 00:27:23,081 INFO L443 ceAbstractionStarter]: For program point L1200(lines 1200 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,081 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,081 INFO L443 ceAbstractionStarter]: For program point L1663(line 1663) no Hoare annotation was computed. [2019-11-16 00:27:23,081 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,081 INFO L443 ceAbstractionStarter]: For program point L1003(lines 1003 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,081 INFO L443 ceAbstractionStarter]: For program point L937(lines 937 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,081 INFO L443 ceAbstractionStarter]: For program point L1598-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,082 INFO L443 ceAbstractionStarter]: For program point L1532-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,082 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1468) no Hoare annotation was computed. [2019-11-16 00:27:23,082 INFO L443 ceAbstractionStarter]: For program point L1466-2(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,082 INFO L443 ceAbstractionStarter]: For program point L1599(line 1599) no Hoare annotation was computed. [2019-11-16 00:27:23,082 INFO L443 ceAbstractionStarter]: For program point L1533(line 1533) no Hoare annotation was computed. [2019-11-16 00:27:23,082 INFO L443 ceAbstractionStarter]: For program point L1467(line 1467) no Hoare annotation was computed. [2019-11-16 00:27:23,082 INFO L443 ceAbstractionStarter]: For program point L146(lines 146 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,083 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,083 INFO L443 ceAbstractionStarter]: For program point L1402(lines 1402 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,083 INFO L443 ceAbstractionStarter]: For program point L1336(lines 1336 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,083 INFO L443 ceAbstractionStarter]: For program point L213(lines 213 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,083 INFO L443 ceAbstractionStarter]: For program point L1601-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,083 INFO L443 ceAbstractionStarter]: For program point L1535-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,083 INFO L443 ceAbstractionStarter]: For program point L1469-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,083 INFO L443 ceAbstractionStarter]: For program point L1403(lines 1403 1421) no Hoare annotation was computed. [2019-11-16 00:27:23,084 INFO L443 ceAbstractionStarter]: For program point L1403-2(lines 1403 1421) no Hoare annotation was computed. [2019-11-16 00:27:23,084 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,084 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,084 INFO L443 ceAbstractionStarter]: For program point L1602(line 1602) no Hoare annotation was computed. [2019-11-16 00:27:23,084 INFO L443 ceAbstractionStarter]: For program point L1536(line 1536) no Hoare annotation was computed. [2019-11-16 00:27:23,084 INFO L443 ceAbstractionStarter]: For program point L1470(line 1470) no Hoare annotation was computed. [2019-11-16 00:27:23,084 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,084 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,084 INFO L443 ceAbstractionStarter]: For program point L480(lines 480 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,084 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,084 INFO L443 ceAbstractionStarter]: For program point L348(lines 348 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,084 INFO L443 ceAbstractionStarter]: For program point L1604-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,084 INFO L443 ceAbstractionStarter]: For program point L1538-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,084 INFO L443 ceAbstractionStarter]: For program point L1472-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,084 INFO L443 ceAbstractionStarter]: For program point L1274(lines 1274 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,084 INFO L443 ceAbstractionStarter]: For program point L1142(lines 1142 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,085 INFO L443 ceAbstractionStarter]: For program point L614(lines 614 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,085 INFO L443 ceAbstractionStarter]: For program point L1605(line 1605) no Hoare annotation was computed. [2019-11-16 00:27:23,085 INFO L443 ceAbstractionStarter]: For program point L1539(line 1539) no Hoare annotation was computed. [2019-11-16 00:27:23,085 INFO L443 ceAbstractionStarter]: For program point L1473(line 1473) no Hoare annotation was computed. [2019-11-16 00:27:23,085 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:27:23,085 INFO L443 ceAbstractionStarter]: For program point L284(lines 284 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,085 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,085 INFO L443 ceAbstractionStarter]: For program point L813(lines 813 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,085 INFO L443 ceAbstractionStarter]: For program point L1210(lines 1210 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,085 INFO L443 ceAbstractionStarter]: For program point L1607-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,085 INFO L443 ceAbstractionStarter]: For program point L1541-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,085 INFO L443 ceAbstractionStarter]: For program point L1475-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,085 INFO L443 ceAbstractionStarter]: For program point L1211(lines 1211 1224) no Hoare annotation was computed. [2019-11-16 00:27:23,085 INFO L443 ceAbstractionStarter]: For program point L1211-2(lines 1211 1224) no Hoare annotation was computed. [2019-11-16 00:27:23,085 INFO L443 ceAbstractionStarter]: For program point L947(lines 947 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,085 INFO L443 ceAbstractionStarter]: For program point L1608(line 1608) no Hoare annotation was computed. [2019-11-16 00:27:23,086 INFO L443 ceAbstractionStarter]: For program point L1542(line 1542) no Hoare annotation was computed. [2019-11-16 00:27:23,086 INFO L443 ceAbstractionStarter]: For program point L1476(line 1476) no Hoare annotation was computed. [2019-11-16 00:27:23,086 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,086 INFO L443 ceAbstractionStarter]: For program point L155(lines 155 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,086 INFO L443 ceAbstractionStarter]: For program point L89(lines 89 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,086 INFO L443 ceAbstractionStarter]: For program point L684(lines 684 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,086 INFO L443 ceAbstractionStarter]: For program point L222(lines 222 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,086 INFO L443 ceAbstractionStarter]: For program point L685(lines 685 699) no Hoare annotation was computed. [2019-11-16 00:27:23,087 INFO L443 ceAbstractionStarter]: For program point L685-2(lines 685 699) no Hoare annotation was computed. [2019-11-16 00:27:23,087 INFO L443 ceAbstractionStarter]: For program point L1610-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,087 INFO L443 ceAbstractionStarter]: For program point L1544-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,087 INFO L443 ceAbstractionStarter]: For program point L1478-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,087 INFO L443 ceAbstractionStarter]: For program point L1611(line 1611) no Hoare annotation was computed. [2019-11-16 00:27:23,087 INFO L443 ceAbstractionStarter]: For program point L1545(line 1545) no Hoare annotation was computed. [2019-11-16 00:27:23,087 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,088 INFO L443 ceAbstractionStarter]: For program point L1479(line 1479) no Hoare annotation was computed. [2019-11-16 00:27:23,088 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,088 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,088 INFO L443 ceAbstractionStarter]: For program point L753(lines 753 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,088 INFO L443 ceAbstractionStarter]: For program point L622(lines 622 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,088 INFO L443 ceAbstractionStarter]: For program point L556(lines 556 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,088 INFO L443 ceAbstractionStarter]: For program point L1613-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,088 INFO L443 ceAbstractionStarter]: For program point L1547-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,089 INFO L443 ceAbstractionStarter]: For program point L1481-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,089 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,089 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,089 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:27:23,089 INFO L443 ceAbstractionStarter]: For program point L1614(line 1614) no Hoare annotation was computed. [2019-11-16 00:27:23,089 INFO L443 ceAbstractionStarter]: For program point L1548(line 1548) no Hoare annotation was computed. [2019-11-16 00:27:23,089 INFO L443 ceAbstractionStarter]: For program point L1482(line 1482) no Hoare annotation was computed. [2019-11-16 00:27:23,089 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,089 INFO L443 ceAbstractionStarter]: For program point L1284(lines 1284 1303) no Hoare annotation was computed. [2019-11-16 00:27:23,089 INFO L443 ceAbstractionStarter]: For program point L1284-2(lines 1284 1303) no Hoare annotation was computed. [2019-11-16 00:27:23,089 INFO L443 ceAbstractionStarter]: For program point L1152(lines 1152 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,089 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,090 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,090 INFO L443 ceAbstractionStarter]: For program point L1021(lines 1021 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,090 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,090 INFO L443 ceAbstractionStarter]: For program point L889(lines 889 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,090 INFO L443 ceAbstractionStarter]: For program point L1616-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,090 INFO L443 ceAbstractionStarter]: For program point L1550-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,090 INFO L443 ceAbstractionStarter]: For program point L1484-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,090 INFO L443 ceAbstractionStarter]: For program point L1617(line 1617) no Hoare annotation was computed. [2019-11-16 00:27:23,090 INFO L443 ceAbstractionStarter]: For program point L1551(line 1551) no Hoare annotation was computed. [2019-11-16 00:27:23,090 INFO L443 ceAbstractionStarter]: For program point L1485(line 1485) no Hoare annotation was computed. [2019-11-16 00:27:23,090 INFO L443 ceAbstractionStarter]: For program point L164(lines 164 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,090 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,090 INFO L443 ceAbstractionStarter]: For program point L1619-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,090 INFO L443 ceAbstractionStarter]: For program point L1553-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,090 INFO L443 ceAbstractionStarter]: For program point L1487-1(lines 54 1650) no Hoare annotation was computed. [2019-11-16 00:27:23,090 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,091 INFO L443 ceAbstractionStarter]: For program point L1620(line 1620) no Hoare annotation was computed. [2019-11-16 00:27:23,091 INFO L443 ceAbstractionStarter]: For program point L1554(line 1554) no Hoare annotation was computed. [2019-11-16 00:27:23,091 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,091 INFO L443 ceAbstractionStarter]: For program point L1488(line 1488) no Hoare annotation was computed. [2019-11-16 00:27:23,091 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1465) no Hoare annotation was computed. [2019-11-16 00:27:23,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:27:23 BoogieIcfgContainer [2019-11-16 00:27:23,131 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:27:23,132 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:27:23,132 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:27:23,132 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:27:23,132 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:26:48" (3/4) ... [2019-11-16 00:27:23,136 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:27:23,180 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-16 00:27:23,184 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:27:23,409 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_fd832890-b192-47f1-84c5-3804a581c063/bin/uautomizer/witness.graphml [2019-11-16 00:27:23,409 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:27:23,411 INFO L168 Benchmark]: Toolchain (without parser) took 38786.76 ms. Allocated memory was 1.0 GB in the beginning and 2.5 GB in the end (delta: 1.4 GB). Free memory was 946.1 MB in the beginning and 941.8 MB in the end (delta: 4.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-16 00:27:23,411 INFO L168 Benchmark]: CDTParser took 0.22 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-16 00:27:23,412 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1278.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -126.1 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:27:23,412 INFO L168 Benchmark]: Boogie Procedure Inliner took 170.70 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: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:27:23,413 INFO L168 Benchmark]: Boogie Preprocessor took 136.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:27:23,413 INFO L168 Benchmark]: RCFGBuilder took 2685.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 107.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -157.0 MB). Peak memory consumption was 260.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:27:23,414 INFO L168 Benchmark]: TraceAbstraction took 34227.77 ms. Allocated memory was 1.3 GB in the beginning and 2.5 GB in the end (delta: 1.2 GB). Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 192.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-11-16 00:27:23,414 INFO L168 Benchmark]: Witness Printer took 278.00 ms. Allocated memory is still 2.5 GB. Free memory was 1.0 GB in the beginning and 941.8 MB in the end (delta: 67.7 MB). Peak memory consumption was 67.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:27:23,416 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1278.87 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -126.1 MB). Peak memory consumption was 32.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 170.70 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: 20.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 136.91 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2685.48 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 107.0 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -157.0 MB). Peak memory consumption was 260.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 34227.77 ms. Allocated memory was 1.3 GB in the beginning and 2.5 GB in the end (delta: 1.2 GB). Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 192.2 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 278.00 ms. Allocated memory is still 2.5 GB. Free memory was 1.0 GB in the beginning and 941.8 MB in the end (delta: 67.7 MB). Peak memory consumption was 67.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1623]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1658]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((!(a12 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) || (((!(a12 == 1) && a11 <= 0) && a5 == 1) && a26 == 1)) || (((a11 == 1 && a26 == 1) && 1 == a0) && !(1 == a6) && a5 == 1)) || (((a3 <= 0 && ((a27 == 1 && !(a12 == 1)) && !(1 == a6)) && a5 == 1) && a11 == 1) && 1 == a4)) || (((((a3 <= 0 && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1) && 1 == a4)) || (((((a3 <= 0 && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && 1 == a0)) || ((((a3 <= 0 && a11 <= 0) && a5 == 1) && a26 == 1) && a16 == 1)) || (((((a27 == 1 && 1 == a6) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a4)) || ((((a3 <= 0 && a11 <= 0) && a5 == 1) && 1 == a0) && a16 == 1)) || ((a11 <= 0 && a26 == 1) && !(1 == a6) && a5 == 1)) || ((a3 <= 0 && a11 <= 0) && !(1 == a6) && a5 == 1)) || (((a11 == 1 && a26 == 1) && !(1 == a6) && a5 == 1) && 1 == a4)) || (((1 == a3 && a11 <= 0) && 1 == a0) && !(1 == a6) && a5 == 1)) || (((((1 == a6 && a11 <= 0) && a5 == 1) && 1 == a0) && a16 == 1) && 1 == a4)) || ((((a27 == 1 && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a4)) || ((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && 1 == a0)) || (((a27 == 1 && a11 <= 0) && a5 == 1) && 1 == a0)) || (((a11 <= 0 && a5 == 1) && a26 == 1) && 1 == a0)) || ((((!(a12 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a0)) || ((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && a16 == 1)) || (((((a3 <= 0 && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1)) || ((((a3 <= 0 && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0)) || (((((a27 == 1 && !(a12 == 1)) && !(1 == a6)) && a5 == 1) && a11 == 1) && a26 == 1)) || ((((!(a12 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && a16 == 1)) || ((((a3 <= 0 && a11 == 1) && a26 == 1) && a16 == 1) && !(1 == a6) && a5 == 1)) || ((((a3 <= 0 && 1 == a6) && a27 == 1 && !(a12 == 1)) && a5 == 1) && a11 == 1)) || (((a11 <= 0 && a5 == 1) && a26 == 1) && 1 == a4)) || ((((1 == a3 && a11 <= 0) && a5 == 1) && 1 == a0) && 1 == a4)) || (((1 == a6 && a11 <= 0) && a27 == 1 && !(a12 == 1)) && a5 == 1)) || (((((a27 == 1 && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1)) || ((((!(a12 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a4)) || ((((1 == a3 && 1 == a6) && a5 == 1) && a11 == 1) && a16 == 1) - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((!(a12 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1) || (((!(a12 == 1) && a11 <= 0) && a5 == 1) && a26 == 1)) || (((a11 == 1 && a26 == 1) && 1 == a0) && !(1 == a6) && a5 == 1)) || (((a3 <= 0 && ((a27 == 1 && !(a12 == 1)) && !(1 == a6)) && a5 == 1) && a11 == 1) && 1 == a4)) || (((((a3 <= 0 && a5 == 1) && a11 == 1) && a26 == 1) && a16 == 1) && 1 == a4)) || (((((a3 <= 0 && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && 1 == a0)) || ((((a3 <= 0 && a11 <= 0) && a5 == 1) && a26 == 1) && a16 == 1)) || (((((a27 == 1 && 1 == a6) && a5 == 1) && a11 == 1) && a16 == 1) && 1 == a4)) || ((((a3 <= 0 && a11 <= 0) && a5 == 1) && 1 == a0) && a16 == 1)) || ((a11 <= 0 && a26 == 1) && !(1 == a6) && a5 == 1)) || ((a3 <= 0 && a11 <= 0) && !(1 == a6) && a5 == 1)) || (((a11 == 1 && a26 == 1) && !(1 == a6) && a5 == 1) && 1 == a4)) || (((1 == a3 && a11 <= 0) && 1 == a0) && !(1 == a6) && a5 == 1)) || (((((1 == a6 && a11 <= 0) && a5 == 1) && 1 == a0) && a16 == 1) && 1 == a4)) || ((((a27 == 1 && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a4)) || ((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && 1 == a0)) || (((a27 == 1 && a11 <= 0) && a5 == 1) && 1 == a0)) || (((a11 <= 0 && a5 == 1) && a26 == 1) && 1 == a0)) || ((((!(a12 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a0)) || ((((!(a12 == 1) && !(1 == a6)) && a5 == 1) && a11 == 1) && a16 == 1)) || (((((a3 <= 0 && a27 == 1) && 1 == a6) && a5 == 1) && a11 == 1) && a26 == 1)) || ((((a3 <= 0 && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0)) || (((((a27 == 1 && !(a12 == 1)) && !(1 == a6)) && a5 == 1) && a11 == 1) && a26 == 1)) || ((((!(a12 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && a16 == 1)) || ((((a3 <= 0 && a11 == 1) && a26 == 1) && a16 == 1) && !(1 == a6) && a5 == 1)) || ((((a3 <= 0 && 1 == a6) && a27 == 1 && !(a12 == 1)) && a5 == 1) && a11 == 1)) || (((a11 <= 0 && a5 == 1) && a26 == 1) && 1 == a4)) || ((((1 == a3 && a11 <= 0) && a5 == 1) && 1 == a0) && 1 == a4)) || (((1 == a6 && a11 <= 0) && a27 == 1 && !(a12 == 1)) && a5 == 1)) || (((((a27 == 1 && a5 == 1) && a11 == 1) && a26 == 1) && 1 == a0) && a16 == 1)) || ((((!(a12 == 1) && 1 == a6) && a11 <= 0) && a5 == 1) && 1 == a4)) || ((((1 == a3 && 1 == a6) && a5 == 1) && a11 == 1) && a16 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Result: SAFE, OverallTime: 34.1s, OverallIterations: 14, TraceHistogramMax: 4, AutomataDifference: 19.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.9s, HoareTripleCheckerStatistics: 2602 SDtfs, 4065 SDslu, 901 SDs, 0 SdLazy, 7530 SolverSat, 1813 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 557 GetRequests, 530 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67125occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 2307 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 761 NumberOfFragments, 1127 HoareAnnotationTreeSize, 3 FomulaSimplifications, 23870 FormulaSimplificationTreeSizeReduction, 2.6s HoareSimplificationTime, 3 FomulaSimplificationsInter, 6962 FormulaSimplificationTreeSizeReductionInter, 2.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 4084 NumberOfCodeBlocks, 4084 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 4068 ConstructedInterpolants, 0 QuantifiedInterpolants, 1794842 SizeOfPredicates, 0 NumberOfNonLiveVariables, 892 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 16 InterpolantComputations, 14 PerfectInterpolantSequences, 1195/1202 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...