./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label14.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_72d1b742-8f3f-4c2f-8434-886611b32761/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_72d1b742-8f3f-4c2f-8434-886611b32761/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_72d1b742-8f3f-4c2f-8434-886611b32761/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_72d1b742-8f3f-4c2f-8434-886611b32761/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label14.c -s /tmp/vcloud-vcloud-master/worker/run_dir_72d1b742-8f3f-4c2f-8434-886611b32761/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_72d1b742-8f3f-4c2f-8434-886611b32761/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 d50ba566f02e5109971f6a90ba216a95432a7661 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:32:18,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:32:18,112 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:32:18,127 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:32:18,127 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:32:18,128 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:32:18,130 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:32:18,138 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:32:18,140 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:32:18,141 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:32:18,142 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:32:18,145 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:32:18,145 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:32:18,146 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:32:18,146 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:32:18,147 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:32:18,148 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:32:18,149 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:32:18,150 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:32:18,152 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:32:18,154 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:32:18,154 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:32:18,155 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:32:18,156 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:32:18,165 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:32:18,166 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:32:18,167 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:32:18,170 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:32:18,170 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:32:18,172 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:32:18,172 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:32:18,173 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:32:18,173 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:32:18,174 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:32:18,178 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:32:18,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:32:18,178 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:32:18,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:32:18,179 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:32:18,182 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:32:18,184 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:32:18,185 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_72d1b742-8f3f-4c2f-8434-886611b32761/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:32:18,204 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:32:18,204 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:32:18,205 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:32:18,206 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:32:18,206 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:32:18,206 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:32:18,206 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:32:18,207 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:32:18,207 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:32:18,207 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:32:18,208 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:32:18,208 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:32:18,208 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:32:18,209 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:32:18,209 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:32:18,209 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:32:18,209 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:32:18,210 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:32:18,210 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:32:18,210 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:32:18,210 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:32:18,210 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:32:18,211 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:32:18,211 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:32:18,211 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:32:18,211 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:32:18,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:32:18,212 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:32:18,212 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_72d1b742-8f3f-4c2f-8434-886611b32761/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 -> d50ba566f02e5109971f6a90ba216a95432a7661 [2019-11-16 00:32:18,247 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:32:18,263 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:32:18,265 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:32:18,267 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:32:18,267 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:32:18,268 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_72d1b742-8f3f-4c2f-8434-886611b32761/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label14.c [2019-11-16 00:32:18,316 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_72d1b742-8f3f-4c2f-8434-886611b32761/bin/uautomizer/data/f7ce193ef/c91147a2423a45639aa9a7c7e9b68d39/FLAGa2f7cf80d [2019-11-16 00:32:18,800 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:32:18,801 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_72d1b742-8f3f-4c2f-8434-886611b32761/sv-benchmarks/c/eca-rers2012/Problem01_label14.c [2019-11-16 00:32:18,811 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_72d1b742-8f3f-4c2f-8434-886611b32761/bin/uautomizer/data/f7ce193ef/c91147a2423a45639aa9a7c7e9b68d39/FLAGa2f7cf80d [2019-11-16 00:32:19,287 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_72d1b742-8f3f-4c2f-8434-886611b32761/bin/uautomizer/data/f7ce193ef/c91147a2423a45639aa9a7c7e9b68d39 [2019-11-16 00:32:19,289 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:32:19,290 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:32:19,291 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:32:19,291 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:32:19,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:32:19,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:32:19" (1/1) ... [2019-11-16 00:32:19,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6acd85ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:19, skipping insertion in model container [2019-11-16 00:32:19,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:32:19" (1/1) ... [2019-11-16 00:32:19,305 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:32:19,359 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:32:19,843 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:32:19,848 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:32:19,963 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:32:19,977 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:32:19,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:19 WrapperNode [2019-11-16 00:32:19,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:32:19,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:32:19,979 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:32:19,979 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:32:19,987 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:32:19" (1/1) ... [2019-11-16 00:32:20,014 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:32:19" (1/1) ... [2019-11-16 00:32:20,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:32:20,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:32:20,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:32:20,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:32:20,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:19" (1/1) ... [2019-11-16 00:32:20,100 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:19" (1/1) ... [2019-11-16 00:32:20,107 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:19" (1/1) ... [2019-11-16 00:32:20,108 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:19" (1/1) ... [2019-11-16 00:32:20,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:19" (1/1) ... [2019-11-16 00:32:20,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:19" (1/1) ... [2019-11-16 00:32:20,162 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:19" (1/1) ... [2019-11-16 00:32:20,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:32:20,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:32:20,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:32:20,168 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:32:20,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_72d1b742-8f3f-4c2f-8434-886611b32761/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:32:20,243 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:32:20,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:32:21,412 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:32:21,413 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:32:21,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:32:21 BoogieIcfgContainer [2019-11-16 00:32:21,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:32:21,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:32:21,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:32:21,418 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:32:21,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:32:19" (1/3) ... [2019-11-16 00:32:21,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348a4b06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:32:21, skipping insertion in model container [2019-11-16 00:32:21,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:32:19" (2/3) ... [2019-11-16 00:32:21,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@348a4b06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:32:21, skipping insertion in model container [2019-11-16 00:32:21,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:32:21" (3/3) ... [2019-11-16 00:32:21,426 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label14.c [2019-11-16 00:32:21,435 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:32:21,444 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:32:21,454 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:32:21,489 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:32:21,489 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:32:21,489 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:32:21,489 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:32:21,490 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:32:21,490 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:32:21,490 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:32:21,491 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:32:21,512 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-16 00:32:21,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-16 00:32:21,531 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:21,532 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] [2019-11-16 00:32:21,533 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:21,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:21,538 INFO L82 PathProgramCache]: Analyzing trace with hash 2004563326, now seen corresponding path program 1 times [2019-11-16 00:32:21,546 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:21,546 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215892984] [2019-11-16 00:32:21,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:21,546 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:21,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:22,766 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:32:22,767 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215892984] [2019-11-16 00:32:22,768 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:22,768 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-16 00:32:22,768 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622474247] [2019-11-16 00:32:22,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:32:22,772 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:22,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:32:22,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:32:22,786 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 10 states. [2019-11-16 00:32:24,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:24,220 INFO L93 Difference]: Finished difference Result 493 states and 846 transitions. [2019-11-16 00:32:24,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:32:24,222 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 131 [2019-11-16 00:32:24,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:24,240 INFO L225 Difference]: With dead ends: 493 [2019-11-16 00:32:24,240 INFO L226 Difference]: Without dead ends: 193 [2019-11-16 00:32:24,249 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:32:24,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-16 00:32:24,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-11-16 00:32:24,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-16 00:32:24,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 264 transitions. [2019-11-16 00:32:24,323 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 264 transitions. Word has length 131 [2019-11-16 00:32:24,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:24,325 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 264 transitions. [2019-11-16 00:32:24,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:32:24,325 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 264 transitions. [2019-11-16 00:32:24,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-16 00:32:24,337 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:24,338 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-11-16 00:32:24,339 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:24,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:24,339 INFO L82 PathProgramCache]: Analyzing trace with hash 481563718, now seen corresponding path program 1 times [2019-11-16 00:32:24,340 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:24,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008972978] [2019-11-16 00:32:24,340 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:24,341 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:24,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:24,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:24,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:32:24,530 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008972978] [2019-11-16 00:32:24,530 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:24,530 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:32:24,531 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109247542] [2019-11-16 00:32:24,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:32:24,534 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:24,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:32:24,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:32:24,535 INFO L87 Difference]: Start difference. First operand 193 states and 264 transitions. Second operand 3 states. [2019-11-16 00:32:25,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:25,021 INFO L93 Difference]: Finished difference Result 457 states and 661 transitions. [2019-11-16 00:32:25,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:32:25,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2019-11-16 00:32:25,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:25,025 INFO L225 Difference]: With dead ends: 457 [2019-11-16 00:32:25,026 INFO L226 Difference]: Without dead ends: 324 [2019-11-16 00:32:25,027 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:32:25,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-11-16 00:32:25,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2019-11-16 00:32:25,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-11-16 00:32:25,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 443 transitions. [2019-11-16 00:32:25,063 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 443 transitions. Word has length 135 [2019-11-16 00:32:25,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:25,065 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 443 transitions. [2019-11-16 00:32:25,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:32:25,066 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 443 transitions. [2019-11-16 00:32:25,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-16 00:32:25,067 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:25,068 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:32:25,068 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:25,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:25,069 INFO L82 PathProgramCache]: Analyzing trace with hash -892512546, now seen corresponding path program 1 times [2019-11-16 00:32:25,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:25,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795681813] [2019-11-16 00:32:25,070 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:25,071 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:25,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:25,143 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:32:25,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795681813] [2019-11-16 00:32:25,145 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:25,145 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:32:25,145 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979421383] [2019-11-16 00:32:25,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:32:25,147 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:25,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:32:25,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:32:25,151 INFO L87 Difference]: Start difference. First operand 324 states and 443 transitions. Second operand 4 states. [2019-11-16 00:32:25,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:25,683 INFO L93 Difference]: Finished difference Result 850 states and 1198 transitions. [2019-11-16 00:32:25,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:32:25,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-11-16 00:32:25,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:25,693 INFO L225 Difference]: With dead ends: 850 [2019-11-16 00:32:25,693 INFO L226 Difference]: Without dead ends: 586 [2019-11-16 00:32:25,694 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:32:25,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-11-16 00:32:25,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-11-16 00:32:25,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-11-16 00:32:25,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 783 transitions. [2019-11-16 00:32:25,733 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 783 transitions. Word has length 140 [2019-11-16 00:32:25,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:25,733 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 783 transitions. [2019-11-16 00:32:25,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:32:25,734 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 783 transitions. [2019-11-16 00:32:25,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-16 00:32:25,735 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:25,735 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-11-16 00:32:25,735 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:25,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:25,735 INFO L82 PathProgramCache]: Analyzing trace with hash -970300302, now seen corresponding path program 1 times [2019-11-16 00:32:25,736 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:25,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235237472] [2019-11-16 00:32:25,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:25,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:25,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:25,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:25,828 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-16 00:32:25,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235237472] [2019-11-16 00:32:25,829 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:25,829 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-16 00:32:25,830 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936850133] [2019-11-16 00:32:25,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:32:25,831 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:25,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:32:25,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:32:25,832 INFO L87 Difference]: Start difference. First operand 586 states and 783 transitions. Second operand 3 states. [2019-11-16 00:32:26,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:26,328 INFO L93 Difference]: Finished difference Result 1243 states and 1680 transitions. [2019-11-16 00:32:26,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:32:26,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-16 00:32:26,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:26,332 INFO L225 Difference]: With dead ends: 1243 [2019-11-16 00:32:26,333 INFO L226 Difference]: Without dead ends: 717 [2019-11-16 00:32:26,334 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:32:26,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-11-16 00:32:26,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 586. [2019-11-16 00:32:26,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-11-16 00:32:26,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 777 transitions. [2019-11-16 00:32:26,347 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 777 transitions. Word has length 148 [2019-11-16 00:32:26,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:26,347 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 777 transitions. [2019-11-16 00:32:26,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:32:26,347 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 777 transitions. [2019-11-16 00:32:26,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-16 00:32:26,349 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:26,350 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2019-11-16 00:32:26,350 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:26,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:26,350 INFO L82 PathProgramCache]: Analyzing trace with hash -247512496, now seen corresponding path program 1 times [2019-11-16 00:32:26,350 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:26,351 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928347092] [2019-11-16 00:32:26,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:26,351 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:26,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:26,393 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-16 00:32:26,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928347092] [2019-11-16 00:32:26,393 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:26,393 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:32:26,394 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704679727] [2019-11-16 00:32:26,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:32:26,394 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:26,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:32:26,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:32:26,395 INFO L87 Difference]: Start difference. First operand 586 states and 777 transitions. Second operand 4 states. [2019-11-16 00:32:27,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:27,140 INFO L93 Difference]: Finished difference Result 2029 states and 2732 transitions. [2019-11-16 00:32:27,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:32:27,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-11-16 00:32:27,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:27,149 INFO L225 Difference]: With dead ends: 2029 [2019-11-16 00:32:27,149 INFO L226 Difference]: Without dead ends: 1503 [2019-11-16 00:32:27,151 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:32:27,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-11-16 00:32:27,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1372. [2019-11-16 00:32:27,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-11-16 00:32:27,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1768 transitions. [2019-11-16 00:32:27,181 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1768 transitions. Word has length 157 [2019-11-16 00:32:27,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:27,182 INFO L462 AbstractCegarLoop]: Abstraction has 1372 states and 1768 transitions. [2019-11-16 00:32:27,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:32:27,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1768 transitions. [2019-11-16 00:32:27,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-16 00:32:27,185 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:27,185 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:27,186 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:27,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:27,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1736300161, now seen corresponding path program 1 times [2019-11-16 00:32:27,186 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:27,186 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270204812] [2019-11-16 00:32:27,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:27,187 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:27,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:27,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:27,274 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-16 00:32:27,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270204812] [2019-11-16 00:32:27,275 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:27,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:32:27,275 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549428376] [2019-11-16 00:32:27,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:32:27,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:27,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:32:27,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:32:27,276 INFO L87 Difference]: Start difference. First operand 1372 states and 1768 transitions. Second operand 5 states. [2019-11-16 00:32:28,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:28,290 INFO L93 Difference]: Finished difference Result 2815 states and 3620 transitions. [2019-11-16 00:32:28,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:32:28,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 163 [2019-11-16 00:32:28,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:28,298 INFO L225 Difference]: With dead ends: 2815 [2019-11-16 00:32:28,298 INFO L226 Difference]: Without dead ends: 1503 [2019-11-16 00:32:28,300 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:32:28,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-11-16 00:32:28,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2019-11-16 00:32:28,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-16 00:32:28,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1893 transitions. [2019-11-16 00:32:28,333 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1893 transitions. Word has length 163 [2019-11-16 00:32:28,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:28,334 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1893 transitions. [2019-11-16 00:32:28,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:32:28,334 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1893 transitions. [2019-11-16 00:32:28,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-11-16 00:32:28,338 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:28,338 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:28,338 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:28,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:28,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1205837626, now seen corresponding path program 1 times [2019-11-16 00:32:28,345 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:28,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256766955] [2019-11-16 00:32:28,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:28,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:28,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:28,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,408 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-11-16 00:32:28,408 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256766955] [2019-11-16 00:32:28,408 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:28,408 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:32:28,408 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918214507] [2019-11-16 00:32:28,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:32:28,409 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:28,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:32:28,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:32:28,410 INFO L87 Difference]: Start difference. First operand 1503 states and 1893 transitions. Second operand 3 states. [2019-11-16 00:32:28,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:28,818 INFO L93 Difference]: Finished difference Result 3601 states and 4557 transitions. [2019-11-16 00:32:28,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:32:28,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-11-16 00:32:28,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:28,830 INFO L225 Difference]: With dead ends: 3601 [2019-11-16 00:32:28,830 INFO L226 Difference]: Without dead ends: 1896 [2019-11-16 00:32:28,832 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:32:28,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-11-16 00:32:28,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1765. [2019-11-16 00:32:28,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2019-11-16 00:32:28,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2004 transitions. [2019-11-16 00:32:28,867 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2004 transitions. Word has length 166 [2019-11-16 00:32:28,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:28,868 INFO L462 AbstractCegarLoop]: Abstraction has 1765 states and 2004 transitions. [2019-11-16 00:32:28,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:32:28,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2004 transitions. [2019-11-16 00:32:28,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-11-16 00:32:28,872 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:28,872 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:28,872 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:28,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:28,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1300334530, now seen corresponding path program 1 times [2019-11-16 00:32:28,873 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:28,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090107361] [2019-11-16 00:32:28,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:28,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:28,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:28,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:28,991 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:32:28,991 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090107361] [2019-11-16 00:32:28,991 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:28,991 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:32:28,991 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741171013] [2019-11-16 00:32:28,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:32:28,992 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:28,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:32:28,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:32:28,992 INFO L87 Difference]: Start difference. First operand 1765 states and 2004 transitions. Second operand 5 states. [2019-11-16 00:32:29,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:29,791 INFO L93 Difference]: Finished difference Result 4782 states and 5478 transitions. [2019-11-16 00:32:29,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:32:29,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2019-11-16 00:32:29,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:29,805 INFO L225 Difference]: With dead ends: 4782 [2019-11-16 00:32:29,805 INFO L226 Difference]: Without dead ends: 3077 [2019-11-16 00:32:29,807 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:32:29,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3077 states. [2019-11-16 00:32:29,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3077 to 2682. [2019-11-16 00:32:29,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2019-11-16 00:32:29,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 2977 transitions. [2019-11-16 00:32:29,863 INFO L78 Accepts]: Start accepts. Automaton has 2682 states and 2977 transitions. Word has length 181 [2019-11-16 00:32:29,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:29,863 INFO L462 AbstractCegarLoop]: Abstraction has 2682 states and 2977 transitions. [2019-11-16 00:32:29,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:32:29,863 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 2977 transitions. [2019-11-16 00:32:29,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-16 00:32:29,869 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:29,869 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:32:29,869 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:29,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:29,870 INFO L82 PathProgramCache]: Analyzing trace with hash 766976078, now seen corresponding path program 1 times [2019-11-16 00:32:29,870 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:29,870 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820957351] [2019-11-16 00:32:29,870 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:29,871 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:29,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:29,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:29,995 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-11-16 00:32:29,996 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820957351] [2019-11-16 00:32:29,996 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:29,996 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:32:29,996 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235518579] [2019-11-16 00:32:29,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:32:29,997 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:29,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:32:29,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:32:29,998 INFO L87 Difference]: Start difference. First operand 2682 states and 2977 transitions. Second operand 4 states. [2019-11-16 00:32:30,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:30,774 INFO L93 Difference]: Finished difference Result 5699 states and 6349 transitions. [2019-11-16 00:32:30,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:32:30,775 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-11-16 00:32:30,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:30,789 INFO L225 Difference]: With dead ends: 5699 [2019-11-16 00:32:30,789 INFO L226 Difference]: Without dead ends: 2946 [2019-11-16 00:32:30,792 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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:32:30,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2019-11-16 00:32:30,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 2682. [2019-11-16 00:32:30,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2019-11-16 00:32:30,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 2882 transitions. [2019-11-16 00:32:30,846 INFO L78 Accepts]: Start accepts. Automaton has 2682 states and 2882 transitions. Word has length 210 [2019-11-16 00:32:30,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:30,847 INFO L462 AbstractCegarLoop]: Abstraction has 2682 states and 2882 transitions. [2019-11-16 00:32:30,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:32:30,847 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 2882 transitions. [2019-11-16 00:32:30,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-11-16 00:32:30,853 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:30,853 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-16 00:32:30,854 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:30,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:30,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1931153020, now seen corresponding path program 1 times [2019-11-16 00:32:30,855 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:30,855 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392500881] [2019-11-16 00:32:30,855 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:30,856 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:30,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,041 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-16 00:32:31,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392500881] [2019-11-16 00:32:31,042 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:31,043 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:32:31,044 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084132315] [2019-11-16 00:32:31,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:32:31,045 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:31,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:32:31,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:32:31,046 INFO L87 Difference]: Start difference. First operand 2682 states and 2882 transitions. Second operand 3 states. [2019-11-16 00:32:31,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:31,507 INFO L93 Difference]: Finished difference Result 5566 states and 5992 transitions. [2019-11-16 00:32:31,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:32:31,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-11-16 00:32:31,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:31,520 INFO L225 Difference]: With dead ends: 5566 [2019-11-16 00:32:31,520 INFO L226 Difference]: Without dead ends: 2682 [2019-11-16 00:32:31,527 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:32:31,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2019-11-16 00:32:31,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2420. [2019-11-16 00:32:31,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2019-11-16 00:32:31,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 2562 transitions. [2019-11-16 00:32:31,573 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 2562 transitions. Word has length 235 [2019-11-16 00:32:31,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:31,573 INFO L462 AbstractCegarLoop]: Abstraction has 2420 states and 2562 transitions. [2019-11-16 00:32:31,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:32:31,574 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 2562 transitions. [2019-11-16 00:32:31,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-11-16 00:32:31,579 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:31,580 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-16 00:32:31,580 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:31,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:31,580 INFO L82 PathProgramCache]: Analyzing trace with hash 1131445953, now seen corresponding path program 1 times [2019-11-16 00:32:31,580 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:31,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978003014] [2019-11-16 00:32:31,581 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:31,581 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:31,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:31,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:31,692 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-16 00:32:31,692 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978003014] [2019-11-16 00:32:31,692 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:31,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:32:31,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149891216] [2019-11-16 00:32:31,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:32:31,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:31,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:32:31,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:32:31,694 INFO L87 Difference]: Start difference. First operand 2420 states and 2562 transitions. Second operand 4 states. [2019-11-16 00:32:32,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:32,362 INFO L93 Difference]: Finished difference Result 4780 states and 5062 transitions. [2019-11-16 00:32:32,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:32:32,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2019-11-16 00:32:32,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:32,369 INFO L225 Difference]: With dead ends: 4780 [2019-11-16 00:32:32,369 INFO L226 Difference]: Without dead ends: 1634 [2019-11-16 00:32:32,372 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:32:32,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2019-11-16 00:32:32,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1503. [2019-11-16 00:32:32,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-16 00:32:32,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1570 transitions. [2019-11-16 00:32:32,398 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1570 transitions. Word has length 237 [2019-11-16 00:32:32,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:32,399 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1570 transitions. [2019-11-16 00:32:32,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:32:32,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1570 transitions. [2019-11-16 00:32:32,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-11-16 00:32:32,404 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:32,404 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-16 00:32:32,404 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:32,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:32,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1941854154, now seen corresponding path program 1 times [2019-11-16 00:32:32,405 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:32,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102103000] [2019-11-16 00:32:32,405 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:32,406 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:32,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:32,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:32,863 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-11-16 00:32:32,863 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102103000] [2019-11-16 00:32:32,864 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:32,864 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:32:32,864 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110411168] [2019-11-16 00:32:32,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:32:32,865 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:32,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:32:32,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:32:32,865 INFO L87 Difference]: Start difference. First operand 1503 states and 1570 transitions. Second operand 5 states. [2019-11-16 00:32:33,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:33,466 INFO L93 Difference]: Finished difference Result 3023 states and 3163 transitions. [2019-11-16 00:32:33,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:32:33,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 259 [2019-11-16 00:32:33,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:33,475 INFO L225 Difference]: With dead ends: 3023 [2019-11-16 00:32:33,475 INFO L226 Difference]: Without dead ends: 1503 [2019-11-16 00:32:33,477 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:32:33,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-11-16 00:32:33,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2019-11-16 00:32:33,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-16 00:32:33,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1567 transitions. [2019-11-16 00:32:33,510 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1567 transitions. Word has length 259 [2019-11-16 00:32:33,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:33,511 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1567 transitions. [2019-11-16 00:32:33,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:32:33,511 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1567 transitions. [2019-11-16 00:32:33,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-11-16 00:32:33,516 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:33,516 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-16 00:32:33,517 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:33,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:33,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1207165551, now seen corresponding path program 1 times [2019-11-16 00:32:33,518 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:33,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767662398] [2019-11-16 00:32:33,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:33,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:33,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:33,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,573 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 215 proven. 4 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-11-16 00:32:34,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767662398] [2019-11-16 00:32:34,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1473759550] [2019-11-16 00:32:34,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_72d1b742-8f3f-4c2f-8434-886611b32761/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:32:34,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:34,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:32:34,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:32:34,858 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-11-16 00:32:34,858 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:32:34,859 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2019-11-16 00:32:34,859 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223008045] [2019-11-16 00:32:34,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:32:34,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:34,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:32:34,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:32:34,861 INFO L87 Difference]: Start difference. First operand 1503 states and 1567 transitions. Second operand 3 states. [2019-11-16 00:32:35,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:35,251 INFO L93 Difference]: Finished difference Result 1505 states and 1568 transitions. [2019-11-16 00:32:35,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:32:35,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 282 [2019-11-16 00:32:35,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:35,259 INFO L225 Difference]: With dead ends: 1505 [2019-11-16 00:32:35,259 INFO L226 Difference]: Without dead ends: 1503 [2019-11-16 00:32:35,260 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 285 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-11-16 00:32:35,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-11-16 00:32:35,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1372. [2019-11-16 00:32:35,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-11-16 00:32:35,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1430 transitions. [2019-11-16 00:32:35,289 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1430 transitions. Word has length 282 [2019-11-16 00:32:35,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:35,289 INFO L462 AbstractCegarLoop]: Abstraction has 1372 states and 1430 transitions. [2019-11-16 00:32:35,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:32:35,290 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1430 transitions. [2019-11-16 00:32:35,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-11-16 00:32:35,297 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:32:35,298 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2019-11-16 00:32:35,502 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:32:35,502 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:32:35,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:32:35,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1143025436, now seen corresponding path program 1 times [2019-11-16 00:32:35,503 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:32:35,503 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038450391] [2019-11-16 00:32:35,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:35,504 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:32:35,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:32:35,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:32:35,965 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-11-16 00:32:35,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038450391] [2019-11-16 00:32:35,966 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:32:35,966 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:32:35,966 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290060702] [2019-11-16 00:32:35,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:32:35,967 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:32:35,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:32:35,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:32:35,968 INFO L87 Difference]: Start difference. First operand 1372 states and 1430 transitions. Second operand 5 states. [2019-11-16 00:32:36,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:32:36,467 INFO L93 Difference]: Finished difference Result 2631 states and 2747 transitions. [2019-11-16 00:32:36,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:32:36,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 295 [2019-11-16 00:32:36,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:32:36,469 INFO L225 Difference]: With dead ends: 2631 [2019-11-16 00:32:36,469 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:32:36,471 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:32:36,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:32:36,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:32:36,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:32:36,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:32:36,472 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 295 [2019-11-16 00:32:36,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:32:36,472 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:32:36,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:32:36,473 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:32:36,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:32:36,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:32:36,983 WARN L191 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-11-16 00:32:37,398 WARN L191 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-11-16 00:32:37,400 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-16 00:32:37,400 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-16 00:32:37,400 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,400 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,400 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,400 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,401 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,401 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,401 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-16 00:32:37,401 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-16 00:32:37,401 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-16 00:32:37,401 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-16 00:32:37,401 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-16 00:32:37,401 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-16 00:32:37,401 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-16 00:32:37,401 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-16 00:32:37,402 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-16 00:32:37,402 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-16 00:32:37,402 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 569) no Hoare annotation was computed. [2019-11-16 00:32:37,402 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,402 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,402 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,402 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,402 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,402 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,402 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-16 00:32:37,403 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-16 00:32:37,403 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-16 00:32:37,403 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-16 00:32:37,403 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-16 00:32:37,403 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-16 00:32:37,403 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-16 00:32:37,403 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-16 00:32:37,403 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-16 00:32:37,403 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-16 00:32:37,403 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-16 00:32:37,403 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-16 00:32:37,404 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-16 00:32:37,404 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-16 00:32:37,404 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-16 00:32:37,404 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,404 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,404 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,404 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,404 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,404 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-16 00:32:37,404 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-16 00:32:37,405 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-16 00:32:37,405 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-16 00:32:37,405 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-16 00:32:37,405 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-16 00:32:37,405 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-16 00:32:37,405 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-16 00:32:37,405 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-16 00:32:37,408 INFO L439 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse10 (= ~a16~0 6)) (.cse1 (= ~a17~0 1))) (let ((.cse9 (= ~a20~0 1)) (.cse3 (= 15 ~a8~0)) (.cse15 (not .cse1)) (.cse16 (not .cse10)) (.cse13 (= ~a21~0 1))) (let ((.cse2 (and .cse16 .cse13)) (.cse4 (= ~a16~0 5)) (.cse12 (and .cse9 .cse3 .cse15)) (.cse0 (= 1 ~a7~0)) (.cse6 (<= ~a21~0 0)) (.cse11 (= ~a16~0 4)) (.cse8 (<= ~a17~0 0)) (.cse14 (<= ~a7~0 0)) (.cse5 (not .cse9)) (.cse7 (= ~a12~0 8))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse5 .cse1 .cse2) (and .cse5 .cse4) (and .cse0 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse8 .cse3) (and .cse11 .cse7 .cse8 .cse12) (and .cse8 .cse3 .cse4) (and (or (and .cse0 .cse6 .cse11 .cse8) (and .cse0 .cse8 .cse4)) .cse7) (and .cse11 .cse7 .cse8 .cse13 .cse14 (= 14 ~a8~0)) (and (and .cse1 .cse13) .cse7) (and .cse12 .cse10) (and .cse5 (and .cse11 .cse15)) (and .cse0 .cse6 .cse16 .cse1 .cse7) (and .cse11 (= ~a8~0 13) .cse7 .cse8 .cse13 .cse14) (and .cse5 .cse7 .cse3 .cse10))))) [2019-11-16 00:32:37,408 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,408 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,408 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,409 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,409 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,409 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-16 00:32:37,409 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-16 00:32:37,409 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-16 00:32:37,409 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-16 00:32:37,409 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-16 00:32:37,410 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-16 00:32:37,410 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-16 00:32:37,410 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-16 00:32:37,410 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-16 00:32:37,410 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-16 00:32:37,410 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-16 00:32:37,410 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-16 00:32:37,411 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-16 00:32:37,411 INFO L446 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-16 00:32:37,411 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,411 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,411 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,411 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,411 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,412 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-16 00:32:37,412 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-16 00:32:37,412 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-16 00:32:37,412 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-16 00:32:37,412 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-16 00:32:37,412 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-16 00:32:37,412 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-16 00:32:37,413 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-16 00:32:37,413 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-16 00:32:37,413 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,413 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,413 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,413 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,414 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-16 00:32:37,414 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,414 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-16 00:32:37,414 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-16 00:32:37,414 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-16 00:32:37,414 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-16 00:32:37,414 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-16 00:32:37,415 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-16 00:32:37,415 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-16 00:32:37,415 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:32:37,415 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-16 00:32:37,415 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-16 00:32:37,415 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-16 00:32:37,415 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-16 00:32:37,416 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-16 00:32:37,416 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-16 00:32:37,416 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,416 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse10 (= ~a16~0 6)) (.cse1 (= ~a17~0 1))) (let ((.cse9 (= ~a20~0 1)) (.cse3 (= 15 ~a8~0)) (.cse15 (not .cse1)) (.cse16 (not .cse10)) (.cse13 (= ~a21~0 1))) (let ((.cse2 (and .cse16 .cse13)) (.cse4 (= ~a16~0 5)) (.cse12 (and .cse9 .cse3 .cse15)) (.cse0 (= 1 ~a7~0)) (.cse6 (<= ~a21~0 0)) (.cse11 (= ~a16~0 4)) (.cse8 (<= ~a17~0 0)) (.cse14 (<= ~a7~0 0)) (.cse5 (not .cse9)) (.cse7 (= ~a12~0 8))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse5 .cse1 .cse2) (and .cse5 .cse4) (and .cse0 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse8 .cse3) (and .cse11 .cse7 .cse8 .cse12) (and .cse8 .cse3 .cse4) (and (or (and .cse0 .cse6 .cse11 .cse8) (and .cse0 .cse8 .cse4)) .cse7) (and .cse11 .cse7 .cse8 .cse13 .cse14 (= 14 ~a8~0)) (and (and .cse1 .cse13) .cse7) (and .cse12 .cse10) (and .cse5 (and .cse11 .cse15)) (and .cse0 .cse6 .cse16 .cse1 .cse7) (and .cse11 (= ~a8~0 13) .cse7 .cse8 .cse13 .cse14) (and .cse5 .cse7 .cse3 .cse10))))) [2019-11-16 00:32:37,416 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,417 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,417 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,417 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,417 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-16 00:32:37,417 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-16 00:32:37,417 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-16 00:32:37,418 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-16 00:32:37,418 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-16 00:32:37,418 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-16 00:32:37,418 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-16 00:32:37,418 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-16 00:32:37,419 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,419 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,419 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,419 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,419 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,419 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-16 00:32:37,419 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:32:37,420 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-16 00:32:37,420 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-16 00:32:37,420 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-16 00:32:37,420 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-16 00:32:37,420 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-16 00:32:37,420 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-16 00:32:37,420 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-16 00:32:37,421 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-16 00:32:37,421 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-16 00:32:37,421 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-16 00:32:37,421 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-16 00:32:37,421 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,421 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,421 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,422 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,422 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-16 00:32:37,422 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,422 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,422 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-16 00:32:37,422 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-16 00:32:37,422 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:32:37,423 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-16 00:32:37,423 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-16 00:32:37,423 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-16 00:32:37,423 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-16 00:32:37,423 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-16 00:32:37,423 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-16 00:32:37,424 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-16 00:32:37,424 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-16 00:32:37,424 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-16 00:32:37,424 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-16 00:32:37,424 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,424 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,424 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,425 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,425 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,425 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-16 00:32:37,425 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,425 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-16 00:32:37,425 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-16 00:32:37,425 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-16 00:32:37,426 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-16 00:32:37,426 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-16 00:32:37,426 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-16 00:32:37,426 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-16 00:32:37,426 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-16 00:32:37,426 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-16 00:32:37,426 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-16 00:32:37,427 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-16 00:32:37,427 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:32:37,427 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-16 00:32:37,427 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-16 00:32:37,427 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-16 00:32:37,427 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,427 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,428 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,428 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,428 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,428 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-16 00:32:37,428 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-16 00:32:37,428 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-16 00:32:37,428 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-16 00:32:37,429 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-16 00:32:37,429 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-16 00:32:37,429 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-16 00:32:37,429 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-16 00:32:37,429 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-16 00:32:37,429 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-16 00:32:37,430 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-16 00:32:37,470 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:32:37 BoogieIcfgContainer [2019-11-16 00:32:37,472 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:32:37,473 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:32:37,473 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:32:37,473 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:32:37,474 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:32:21" (3/4) ... [2019-11-16 00:32:37,477 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:32:37,505 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-16 00:32:37,506 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:32:37,714 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_72d1b742-8f3f-4c2f-8434-886611b32761/bin/uautomizer/witness.graphml [2019-11-16 00:32:37,714 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:32:37,715 INFO L168 Benchmark]: Toolchain (without parser) took 18425.13 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 477.6 MB). Free memory was 938.1 MB in the beginning and 857.6 MB in the end (delta: 80.5 MB). Peak memory consumption was 558.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:37,716 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:32:37,716 INFO L168 Benchmark]: CACSL2BoogieTranslator took 687.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -162.0 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:37,717 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:37,717 INFO L168 Benchmark]: Boogie Preprocessor took 77.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:32:37,717 INFO L168 Benchmark]: RCFGBuilder took 1246.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 985.5 MB in the end (delta: 109.2 MB). Peak memory consumption was 109.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:37,718 INFO L168 Benchmark]: TraceAbstraction took 16056.78 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 349.2 MB). Free memory was 985.5 MB in the beginning and 874.4 MB in the end (delta: 111.1 MB). Peak memory consumption was 460.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:37,718 INFO L168 Benchmark]: Witness Printer took 241.37 ms. Allocated memory is still 1.5 GB. Free memory was 874.4 MB in the beginning and 857.6 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:32:37,721 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 687.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 128.5 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -162.0 MB). Peak memory consumption was 18.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 111.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 77.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1246.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 985.5 MB in the end (delta: 109.2 MB). Peak memory consumption was 109.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16056.78 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 349.2 MB). Free memory was 985.5 MB in the beginning and 874.4 MB in the end (delta: 111.1 MB). Peak memory consumption was 460.2 MB. Max. memory is 11.5 GB. * Witness Printer took 241.37 ms. Allocated memory is still 1.5 GB. Free memory was 874.4 MB in the beginning and 857.6 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 569]: 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: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((1 == a7 && a17 == 1) && !(a16 == 6) && a21 == 1) || ((1 == a7 && 15 == a8) && a16 == 5)) || ((!(a20 == 1) && a17 == 1) && !(a16 == 6) && a21 == 1)) || (!(a20 == 1) && a16 == 5)) || (((((1 == a7 && a21 <= 0) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6)) || (((1 == a7 && a16 == 4) && a17 <= 0) && 15 == a8)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && (a20 == 1 && 15 == a8) && !(a17 == 1))) || ((a17 <= 0 && 15 == a8) && a16 == 5)) || (((((1 == a7 && a21 <= 0) && a16 == 4) && a17 <= 0) || ((1 == a7 && a17 <= 0) && a16 == 5)) && a12 == 8)) || (((((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0) && 14 == a8)) || ((a17 == 1 && a21 == 1) && a12 == 8)) || (((a20 == 1 && 15 == a8) && !(a17 == 1)) && a16 == 6)) || (!(a20 == 1) && a16 == 4 && !(a17 == 1))) || ((((1 == a7 && a21 <= 0) && !(a16 == 6)) && a17 == 1) && a12 == 8)) || (((((a16 == 4 && a8 == 13) && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0)) || (((!(a20 == 1) && a12 == 8) && 15 == a8) && a16 == 6) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((1 == a7 && a17 == 1) && !(a16 == 6) && a21 == 1) || ((1 == a7 && 15 == a8) && a16 == 5)) || ((!(a20 == 1) && a17 == 1) && !(a16 == 6) && a21 == 1)) || (!(a20 == 1) && a16 == 5)) || (((((1 == a7 && a21 <= 0) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6)) || (((1 == a7 && a16 == 4) && a17 <= 0) && 15 == a8)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && (a20 == 1 && 15 == a8) && !(a17 == 1))) || ((a17 <= 0 && 15 == a8) && a16 == 5)) || (((((1 == a7 && a21 <= 0) && a16 == 4) && a17 <= 0) || ((1 == a7 && a17 <= 0) && a16 == 5)) && a12 == 8)) || (((((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0) && 14 == a8)) || ((a17 == 1 && a21 == 1) && a12 == 8)) || (((a20 == 1 && 15 == a8) && !(a17 == 1)) && a16 == 6)) || (!(a20 == 1) && a16 == 4 && !(a17 == 1))) || ((((1 == a7 && a21 <= 0) && !(a16 == 6)) && a17 == 1) && a12 == 8)) || (((((a16 == 4 && a8 == 13) && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0)) || (((!(a20 == 1) && a12 == 8) && 15 == a8) && a16 == 6) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 15.9s, OverallIterations: 14, TraceHistogramMax: 6, AutomataDifference: 9.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, HoareTripleCheckerStatistics: 1110 SDtfs, 2796 SDslu, 156 SDs, 0 SdLazy, 7086 SolverSat, 816 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 366 GetRequests, 307 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2682occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 1576 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 50 NumberOfFragments, 499 HoareAnnotationTreeSize, 3 FomulaSimplifications, 858 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 294 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 3021 NumberOfCodeBlocks, 3021 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3006 ConstructedInterpolants, 0 QuantifiedInterpolants, 3254078 SizeOfPredicates, 1 NumberOfNonLiveVariables, 486 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 1895/1899 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...