./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label44.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/working_dir_8a143e6a-e2cf-4d44-b263-808fdfb25639/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8a143e6a-e2cf-4d44-b263-808fdfb25639/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8a143e6a-e2cf-4d44-b263-808fdfb25639/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8a143e6a-e2cf-4d44-b263-808fdfb25639/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label44.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8a143e6a-e2cf-4d44-b263-808fdfb25639/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8a143e6a-e2cf-4d44-b263-808fdfb25639/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 06d11383001c52cfbf19a51eafe2dc3d238c9679 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:58:42,258 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:58:42,259 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:58:42,267 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:58:42,268 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:58:42,268 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:58:42,269 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:58:42,270 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:58:42,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:58:42,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:58:42,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:58:42,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:58:42,274 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:58:42,274 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:58:42,275 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:58:42,276 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:58:42,276 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:58:42,277 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:58:42,278 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:58:42,279 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:58:42,280 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:58:42,281 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:58:42,282 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:58:42,282 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:58:42,284 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:58:42,284 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:58:42,284 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:58:42,285 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:58:42,285 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:58:42,286 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:58:42,286 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:58:42,286 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:58:42,287 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:58:42,287 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:58:42,288 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:58:42,288 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:58:42,289 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:58:42,289 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:58:42,289 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:58:42,290 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:58:42,290 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:58:42,291 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8a143e6a-e2cf-4d44-b263-808fdfb25639/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:58:42,304 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:58:42,304 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:58:42,305 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:58:42,305 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:58:42,305 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:58:42,306 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:58:42,306 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:58:42,306 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:58:42,306 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:58:42,306 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:58:42,306 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:58:42,307 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:58:42,307 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:58:42,307 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:58:42,307 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:58:42,307 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:58:42,307 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:58:42,308 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:58:42,308 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:58:42,308 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:58:42,308 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:58:42,308 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:58:42,308 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:58:42,309 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:58:42,309 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:58:42,309 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:58:42,309 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:58:42,309 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:58:42,309 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/working_dir_8a143e6a-e2cf-4d44-b263-808fdfb25639/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 -> 06d11383001c52cfbf19a51eafe2dc3d238c9679 [2019-10-22 08:58:42,345 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:58:42,354 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:58:42,356 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:58:42,357 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:58:42,358 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:58:42,358 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8a143e6a-e2cf-4d44-b263-808fdfb25639/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label44.c [2019-10-22 08:58:42,409 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8a143e6a-e2cf-4d44-b263-808fdfb25639/bin/uautomizer/data/a4b5dadfd/05eec7266aba41f19a3d4d9ac23aa977/FLAGf835e97ef [2019-10-22 08:58:42,909 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:58:42,911 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8a143e6a-e2cf-4d44-b263-808fdfb25639/sv-benchmarks/c/eca-rers2012/Problem11_label44.c [2019-10-22 08:58:42,922 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8a143e6a-e2cf-4d44-b263-808fdfb25639/bin/uautomizer/data/a4b5dadfd/05eec7266aba41f19a3d4d9ac23aa977/FLAGf835e97ef [2019-10-22 08:58:43,194 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8a143e6a-e2cf-4d44-b263-808fdfb25639/bin/uautomizer/data/a4b5dadfd/05eec7266aba41f19a3d4d9ac23aa977 [2019-10-22 08:58:43,196 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:58:43,197 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:58:43,198 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:43,198 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:58:43,201 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:58:43,202 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:43" (1/1) ... [2019-10-22 08:58:43,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bb01580 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:43, skipping insertion in model container [2019-10-22 08:58:43,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:58:43" (1/1) ... [2019-10-22 08:58:43,210 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:58:43,264 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:58:43,795 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:43,804 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:58:43,938 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:58:43,951 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:58:43,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:43 WrapperNode [2019-10-22 08:58:43,952 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:58:43,952 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:43,953 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:58:43,953 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:58:43,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:43" (1/1) ... [2019-10-22 08:58:43,977 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:43" (1/1) ... [2019-10-22 08:58:44,055 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:58:44,055 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:58:44,055 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:58:44,055 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:58:44,067 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:43" (1/1) ... [2019-10-22 08:58:44,067 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:43" (1/1) ... [2019-10-22 08:58:44,075 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:43" (1/1) ... [2019-10-22 08:58:44,075 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:43" (1/1) ... [2019-10-22 08:58:44,112 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:43" (1/1) ... [2019-10-22 08:58:44,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:43" (1/1) ... [2019-10-22 08:58:44,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:43" (1/1) ... [2019-10-22 08:58:44,154 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:58:44,155 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:58:44,155 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:58:44,155 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:58:44,156 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8a143e6a-e2cf-4d44-b263-808fdfb25639/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-10-22 08:58:44,211 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:58:44,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:58:45,686 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:58:45,687 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 08:58:45,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:45 BoogieIcfgContainer [2019-10-22 08:58:45,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:58:45,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:58:45,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:58:45,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:58:45,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:58:43" (1/3) ... [2019-10-22 08:58:45,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d6dec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:58:45, skipping insertion in model container [2019-10-22 08:58:45,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:58:43" (2/3) ... [2019-10-22 08:58:45,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d6dec8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:58:45, skipping insertion in model container [2019-10-22 08:58:45,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:45" (3/3) ... [2019-10-22 08:58:45,695 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label44.c [2019-10-22 08:58:45,703 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:58:45,710 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 08:58:45,720 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 08:58:45,747 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:58:45,748 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:58:45,748 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:58:45,748 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:58:45,748 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:58:45,748 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:58:45,748 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:58:45,748 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:58:45,766 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-10-22 08:58:45,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 08:58:45,772 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:45,773 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] [2019-10-22 08:58:45,774 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:45,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:45,779 INFO L82 PathProgramCache]: Analyzing trace with hash 678582746, now seen corresponding path program 1 times [2019-10-22 08:58:45,786 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:45,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114331097] [2019-10-22 08:58:45,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:45,787 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:45,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:45,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:45,981 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114331097] [2019-10-22 08:58:45,981 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:45,982 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:45,982 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779776391] [2019-10-22 08:58:45,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:45,985 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:45,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:45,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:45,999 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-10-22 08:58:47,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:47,732 INFO L93 Difference]: Finished difference Result 968 states and 1740 transitions. [2019-10-22 08:58:47,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:47,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-10-22 08:58:47,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:47,748 INFO L225 Difference]: With dead ends: 968 [2019-10-22 08:58:47,748 INFO L226 Difference]: Without dead ends: 602 [2019-10-22 08:58:47,752 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-10-22 08:58:47,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-22 08:58:47,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 407. [2019-10-22 08:58:47,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-10-22 08:58:47,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 590 transitions. [2019-10-22 08:58:47,803 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 590 transitions. Word has length 26 [2019-10-22 08:58:47,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:47,804 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 590 transitions. [2019-10-22 08:58:47,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:47,804 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 590 transitions. [2019-10-22 08:58:47,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-22 08:58:47,809 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:47,809 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 08:58:47,810 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:47,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:47,810 INFO L82 PathProgramCache]: Analyzing trace with hash -308519566, now seen corresponding path program 1 times [2019-10-22 08:58:47,810 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:47,810 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254075382] [2019-10-22 08:58:47,810 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:47,811 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:47,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:47,982 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:47,982 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254075382] [2019-10-22 08:58:47,983 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:47,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:47,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783627606] [2019-10-22 08:58:47,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:47,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:47,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:47,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:47,987 INFO L87 Difference]: Start difference. First operand 407 states and 590 transitions. Second operand 4 states. [2019-10-22 08:58:49,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:49,239 INFO L93 Difference]: Finished difference Result 1567 states and 2285 transitions. [2019-10-22 08:58:49,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:49,239 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2019-10-22 08:58:49,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:49,243 INFO L225 Difference]: With dead ends: 1567 [2019-10-22 08:58:49,243 INFO L226 Difference]: Without dead ends: 1162 [2019-10-22 08:58:49,245 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-10-22 08:58:49,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2019-10-22 08:58:49,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1148. [2019-10-22 08:58:49,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1148 states. [2019-10-22 08:58:49,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1148 states to 1148 states and 1566 transitions. [2019-10-22 08:58:49,286 INFO L78 Accepts]: Start accepts. Automaton has 1148 states and 1566 transitions. Word has length 94 [2019-10-22 08:58:49,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:49,286 INFO L462 AbstractCegarLoop]: Abstraction has 1148 states and 1566 transitions. [2019-10-22 08:58:49,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:49,287 INFO L276 IsEmpty]: Start isEmpty. Operand 1148 states and 1566 transitions. [2019-10-22 08:58:49,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-22 08:58:49,288 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:49,289 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 08:58:49,289 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:49,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:49,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1249111919, now seen corresponding path program 1 times [2019-10-22 08:58:49,289 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:49,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518170097] [2019-10-22 08:58:49,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:49,290 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:49,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:49,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:49,369 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:49,370 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518170097] [2019-10-22 08:58:49,370 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:49,370 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:58:49,370 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408803531] [2019-10-22 08:58:49,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:49,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:49,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:49,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:49,371 INFO L87 Difference]: Start difference. First operand 1148 states and 1566 transitions. Second operand 4 states. [2019-10-22 08:58:50,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:50,593 INFO L93 Difference]: Finished difference Result 4144 states and 5719 transitions. [2019-10-22 08:58:50,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:50,594 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-10-22 08:58:50,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:50,603 INFO L225 Difference]: With dead ends: 4144 [2019-10-22 08:58:50,603 INFO L226 Difference]: Without dead ends: 2998 [2019-10-22 08:58:50,605 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-10-22 08:58:50,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2998 states. [2019-10-22 08:58:50,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2998 to 2998. [2019-10-22 08:58:50,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2998 states. [2019-10-22 08:58:50,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2998 states to 2998 states and 3666 transitions. [2019-10-22 08:58:50,655 INFO L78 Accepts]: Start accepts. Automaton has 2998 states and 3666 transitions. Word has length 97 [2019-10-22 08:58:50,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:50,656 INFO L462 AbstractCegarLoop]: Abstraction has 2998 states and 3666 transitions. [2019-10-22 08:58:50,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:50,656 INFO L276 IsEmpty]: Start isEmpty. Operand 2998 states and 3666 transitions. [2019-10-22 08:58:50,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-22 08:58:50,658 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:50,659 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-22 08:58:50,659 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:50,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:50,659 INFO L82 PathProgramCache]: Analyzing trace with hash -101534449, now seen corresponding path program 1 times [2019-10-22 08:58:50,659 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:50,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952480387] [2019-10-22 08:58:50,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:50,660 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:50,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:50,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952480387] [2019-10-22 08:58:50,798 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:50,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:50,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277092772] [2019-10-22 08:58:50,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:58:50,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:50,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:58:50,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:50,799 INFO L87 Difference]: Start difference. First operand 2998 states and 3666 transitions. Second operand 5 states. [2019-10-22 08:58:52,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:52,341 INFO L93 Difference]: Finished difference Result 9336 states and 11717 transitions. [2019-10-22 08:58:52,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:58:52,341 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-10-22 08:58:52,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:52,360 INFO L225 Difference]: With dead ends: 9336 [2019-10-22 08:58:52,361 INFO L226 Difference]: Without dead ends: 6524 [2019-10-22 08:58:52,364 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-10-22 08:58:52,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6524 states. [2019-10-22 08:58:52,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6524 to 6523. [2019-10-22 08:58:52,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6523 states. [2019-10-22 08:58:52,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6523 states to 6523 states and 7930 transitions. [2019-10-22 08:58:52,467 INFO L78 Accepts]: Start accepts. Automaton has 6523 states and 7930 transitions. Word has length 153 [2019-10-22 08:58:52,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:52,468 INFO L462 AbstractCegarLoop]: Abstraction has 6523 states and 7930 transitions. [2019-10-22 08:58:52,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:58:52,468 INFO L276 IsEmpty]: Start isEmpty. Operand 6523 states and 7930 transitions. [2019-10-22 08:58:52,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-10-22 08:58:52,472 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:52,472 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-22 08:58:52,472 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:52,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:52,472 INFO L82 PathProgramCache]: Analyzing trace with hash -801477748, now seen corresponding path program 1 times [2019-10-22 08:58:52,473 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:52,473 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500833304] [2019-10-22 08:58:52,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:52,473 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:52,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:52,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:52,627 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-22 08:58:52,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500833304] [2019-10-22 08:58:52,628 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:52,628 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:52,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129222714] [2019-10-22 08:58:52,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:52,630 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:52,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:52,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:52,632 INFO L87 Difference]: Start difference. First operand 6523 states and 7930 transitions. Second operand 4 states. [2019-10-22 08:58:53,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:53,766 INFO L93 Difference]: Finished difference Result 14541 states and 17831 transitions. [2019-10-22 08:58:53,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:53,767 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 219 [2019-10-22 08:58:53,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:53,786 INFO L225 Difference]: With dead ends: 14541 [2019-10-22 08:58:53,787 INFO L226 Difference]: Without dead ends: 8204 [2019-10-22 08:58:53,792 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:53,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8204 states. [2019-10-22 08:58:53,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8204 to 7442. [2019-10-22 08:58:53,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7442 states. [2019-10-22 08:58:53,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7442 states to 7442 states and 8862 transitions. [2019-10-22 08:58:53,902 INFO L78 Accepts]: Start accepts. Automaton has 7442 states and 8862 transitions. Word has length 219 [2019-10-22 08:58:53,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:53,902 INFO L462 AbstractCegarLoop]: Abstraction has 7442 states and 8862 transitions. [2019-10-22 08:58:53,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:53,903 INFO L276 IsEmpty]: Start isEmpty. Operand 7442 states and 8862 transitions. [2019-10-22 08:58:53,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-10-22 08:58:53,905 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:53,905 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-22 08:58:53,905 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:53,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:53,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1442400907, now seen corresponding path program 1 times [2019-10-22 08:58:53,906 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:53,906 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853922897] [2019-10-22 08:58:53,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:53,906 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:53,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:54,070 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:54,070 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853922897] [2019-10-22 08:58:54,071 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:54,071 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:54,071 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828167507] [2019-10-22 08:58:54,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:54,071 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:54,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:54,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:54,072 INFO L87 Difference]: Start difference. First operand 7442 states and 8862 transitions. Second operand 4 states. [2019-10-22 08:58:55,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:55,145 INFO L93 Difference]: Finished difference Result 17112 states and 20555 transitions. [2019-10-22 08:58:55,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:58:55,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 230 [2019-10-22 08:58:55,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:55,179 INFO L225 Difference]: With dead ends: 17112 [2019-10-22 08:58:55,183 INFO L226 Difference]: Without dead ends: 9856 [2019-10-22 08:58:55,190 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-10-22 08:58:55,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9856 states. [2019-10-22 08:58:55,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9856 to 9466. [2019-10-22 08:58:55,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9466 states. [2019-10-22 08:58:55,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9466 states to 9466 states and 11150 transitions. [2019-10-22 08:58:55,313 INFO L78 Accepts]: Start accepts. Automaton has 9466 states and 11150 transitions. Word has length 230 [2019-10-22 08:58:55,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:55,314 INFO L462 AbstractCegarLoop]: Abstraction has 9466 states and 11150 transitions. [2019-10-22 08:58:55,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:55,315 INFO L276 IsEmpty]: Start isEmpty. Operand 9466 states and 11150 transitions. [2019-10-22 08:58:55,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-10-22 08:58:55,319 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:55,319 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-22 08:58:55,320 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:55,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:55,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1616620059, now seen corresponding path program 1 times [2019-10-22 08:58:55,324 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:55,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20032770] [2019-10-22 08:58:55,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:55,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:55,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:55,714 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 151 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:55,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20032770] [2019-10-22 08:58:55,715 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:55,715 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:58:55,715 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853871742] [2019-10-22 08:58:55,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:58:55,716 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:55,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:58:55,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:55,716 INFO L87 Difference]: Start difference. First operand 9466 states and 11150 transitions. Second operand 5 states. [2019-10-22 08:58:57,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:57,205 INFO L93 Difference]: Finished difference Result 20253 states and 23894 transitions. [2019-10-22 08:58:57,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:58:57,206 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 258 [2019-10-22 08:58:57,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:57,238 INFO L225 Difference]: With dead ends: 20253 [2019-10-22 08:58:57,238 INFO L226 Difference]: Without dead ends: 12083 [2019-10-22 08:58:57,246 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:57,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12083 states. [2019-10-22 08:58:57,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12083 to 10953. [2019-10-22 08:58:57,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10953 states. [2019-10-22 08:58:57,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10953 states to 10953 states and 12810 transitions. [2019-10-22 08:58:57,368 INFO L78 Accepts]: Start accepts. Automaton has 10953 states and 12810 transitions. Word has length 258 [2019-10-22 08:58:57,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:57,369 INFO L462 AbstractCegarLoop]: Abstraction has 10953 states and 12810 transitions. [2019-10-22 08:58:57,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:58:57,369 INFO L276 IsEmpty]: Start isEmpty. Operand 10953 states and 12810 transitions. [2019-10-22 08:58:57,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2019-10-22 08:58:57,373 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:57,373 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:57,373 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:57,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:57,374 INFO L82 PathProgramCache]: Analyzing trace with hash 292208959, now seen corresponding path program 1 times [2019-10-22 08:58:57,374 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:57,374 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842400027] [2019-10-22 08:58:57,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:57,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:57,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:57,560 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-10-22 08:58:57,560 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842400027] [2019-10-22 08:58:57,560 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:57,560 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:57,561 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413971006] [2019-10-22 08:58:57,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:58:57,561 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:57,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:58:57,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:57,562 INFO L87 Difference]: Start difference. First operand 10953 states and 12810 transitions. Second operand 5 states. [2019-10-22 08:58:59,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:59,292 INFO L93 Difference]: Finished difference Result 34618 states and 40717 transitions. [2019-10-22 08:58:59,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:58:59,293 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 261 [2019-10-22 08:58:59,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:59,329 INFO L225 Difference]: With dead ends: 34618 [2019-10-22 08:58:59,330 INFO L226 Difference]: Without dead ends: 23851 [2019-10-22 08:58:59,342 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-10-22 08:58:59,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23851 states. [2019-10-22 08:58:59,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23851 to 17579. [2019-10-22 08:58:59,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17579 states. [2019-10-22 08:58:59,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17579 states to 17579 states and 20174 transitions. [2019-10-22 08:58:59,575 INFO L78 Accepts]: Start accepts. Automaton has 17579 states and 20174 transitions. Word has length 261 [2019-10-22 08:58:59,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:59,576 INFO L462 AbstractCegarLoop]: Abstraction has 17579 states and 20174 transitions. [2019-10-22 08:58:59,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:58:59,576 INFO L276 IsEmpty]: Start isEmpty. Operand 17579 states and 20174 transitions. [2019-10-22 08:58:59,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2019-10-22 08:58:59,583 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:59,583 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-22 08:58:59,583 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:59,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:59,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1313485887, now seen corresponding path program 1 times [2019-10-22 08:58:59,584 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:59,584 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144654572] [2019-10-22 08:58:59,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:59,584 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:59,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:59,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:59,780 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-10-22 08:58:59,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144654572] [2019-10-22 08:58:59,781 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:59,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:58:59,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307327230] [2019-10-22 08:58:59,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:58:59,782 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:59,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:58:59,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:58:59,783 INFO L87 Difference]: Start difference. First operand 17579 states and 20174 transitions. Second operand 3 states. [2019-10-22 08:59:00,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:00,142 INFO L93 Difference]: Finished difference Result 33484 states and 38341 transitions. [2019-10-22 08:59:00,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:00,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 308 [2019-10-22 08:59:00,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:00,164 INFO L225 Difference]: With dead ends: 33484 [2019-10-22 08:59:00,165 INFO L226 Difference]: Without dead ends: 16649 [2019-10-22 08:59:00,178 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-10-22 08:59:00,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16649 states. [2019-10-22 08:59:00,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16649 to 16645. [2019-10-22 08:59:00,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16645 states. [2019-10-22 08:59:00,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16645 states to 16645 states and 18992 transitions. [2019-10-22 08:59:00,402 INFO L78 Accepts]: Start accepts. Automaton has 16645 states and 18992 transitions. Word has length 308 [2019-10-22 08:59:00,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:00,403 INFO L462 AbstractCegarLoop]: Abstraction has 16645 states and 18992 transitions. [2019-10-22 08:59:00,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:00,403 INFO L276 IsEmpty]: Start isEmpty. Operand 16645 states and 18992 transitions. [2019-10-22 08:59:00,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2019-10-22 08:59:00,425 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:00,425 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:00,425 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:00,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:00,429 INFO L82 PathProgramCache]: Analyzing trace with hash -306541705, now seen corresponding path program 1 times [2019-10-22 08:59:00,429 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:00,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307630725] [2019-10-22 08:59:00,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:00,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:00,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:00,815 INFO L134 CoverageAnalysis]: Checked inductivity of 595 backedges. 503 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-10-22 08:59:00,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307630725] [2019-10-22 08:59:00,816 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:00,816 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:59:00,816 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91629082] [2019-10-22 08:59:00,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:59:00,817 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:00,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:59:00,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:00,817 INFO L87 Difference]: Start difference. First operand 16645 states and 18992 transitions. Second operand 4 states. [2019-10-22 08:59:01,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:01,950 INFO L93 Difference]: Finished difference Result 33131 states and 37836 transitions. [2019-10-22 08:59:01,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:59:01,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 426 [2019-10-22 08:59:01,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:01,968 INFO L225 Difference]: With dead ends: 33131 [2019-10-22 08:59:01,968 INFO L226 Difference]: Without dead ends: 16672 [2019-10-22 08:59:01,978 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:59:01,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16672 states. [2019-10-22 08:59:02,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16672 to 16645. [2019-10-22 08:59:02,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16645 states. [2019-10-22 08:59:02,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16645 states to 16645 states and 18734 transitions. [2019-10-22 08:59:02,143 INFO L78 Accepts]: Start accepts. Automaton has 16645 states and 18734 transitions. Word has length 426 [2019-10-22 08:59:02,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:02,143 INFO L462 AbstractCegarLoop]: Abstraction has 16645 states and 18734 transitions. [2019-10-22 08:59:02,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:59:02,143 INFO L276 IsEmpty]: Start isEmpty. Operand 16645 states and 18734 transitions. [2019-10-22 08:59:02,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2019-10-22 08:59:02,162 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:02,162 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:02,163 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:02,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:02,163 INFO L82 PathProgramCache]: Analyzing trace with hash -758299991, now seen corresponding path program 1 times [2019-10-22 08:59:02,164 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:02,164 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049800661] [2019-10-22 08:59:02,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:02,164 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:02,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:02,397 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 529 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-10-22 08:59:02,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049800661] [2019-10-22 08:59:02,398 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:02,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:02,398 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321106313] [2019-10-22 08:59:02,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:02,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:02,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:02,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:02,399 INFO L87 Difference]: Start difference. First operand 16645 states and 18734 transitions. Second operand 3 states. [2019-10-22 08:59:03,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:03,217 INFO L93 Difference]: Finished difference Result 32536 states and 36592 transitions. [2019-10-22 08:59:03,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:03,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 441 [2019-10-22 08:59:03,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:03,230 INFO L225 Difference]: With dead ends: 32536 [2019-10-22 08:59:03,231 INFO L226 Difference]: Without dead ends: 15157 [2019-10-22 08:59:03,239 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-10-22 08:59:03,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15157 states. [2019-10-22 08:59:03,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15157 to 11657. [2019-10-22 08:59:03,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11657 states. [2019-10-22 08:59:03,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11657 states to 11657 states and 12837 transitions. [2019-10-22 08:59:03,364 INFO L78 Accepts]: Start accepts. Automaton has 11657 states and 12837 transitions. Word has length 441 [2019-10-22 08:59:03,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:03,364 INFO L462 AbstractCegarLoop]: Abstraction has 11657 states and 12837 transitions. [2019-10-22 08:59:03,364 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:03,364 INFO L276 IsEmpty]: Start isEmpty. Operand 11657 states and 12837 transitions. [2019-10-22 08:59:03,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-10-22 08:59:03,376 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:03,377 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:03,377 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:03,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:03,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1640817050, now seen corresponding path program 1 times [2019-10-22 08:59:03,377 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:03,377 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646371629] [2019-10-22 08:59:03,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:03,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:03,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:03,796 INFO L134 CoverageAnalysis]: Checked inductivity of 488 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2019-10-22 08:59:03,798 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646371629] [2019-10-22 08:59:03,798 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:03,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:03,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447785396] [2019-10-22 08:59:03,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:03,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:03,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:03,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:03,799 INFO L87 Difference]: Start difference. First operand 11657 states and 12837 transitions. Second operand 3 states. [2019-10-22 08:59:04,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:04,131 INFO L93 Difference]: Finished difference Result 22569 states and 24860 transitions. [2019-10-22 08:59:04,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:04,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 496 [2019-10-22 08:59:04,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:04,132 INFO L225 Difference]: With dead ends: 22569 [2019-10-22 08:59:04,132 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:59:04,137 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-10-22 08:59:04,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:59:04,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:59:04,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:59:04,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:59:04,138 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 496 [2019-10-22 08:59:04,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:04,139 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:59:04,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:04,139 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:59:04,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:59:04,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 08:59:04,270 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 256 DAG size of output: 123 [2019-10-22 08:59:04,379 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 256 DAG size of output: 123 [2019-10-22 08:59:04,847 WARN L191 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 55 [2019-10-22 08:59:05,323 WARN L191 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 55 [2019-10-22 08:59:05,324 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-10-22 08:59:05,324 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-10-22 08:59:05,324 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-10-22 08:59:05,325 INFO L446 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-10-22 08:59:05,325 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,325 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,325 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,325 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,325 INFO L443 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,325 INFO L443 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,325 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,325 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-10-22 08:59:05,325 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-10-22 08:59:05,325 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-10-22 08:59:05,325 INFO L443 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,325 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,326 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,326 INFO L443 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,326 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,326 INFO L443 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,326 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,326 INFO L443 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,326 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,326 INFO L443 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-10-22 08:59:05,326 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-10-22 08:59:05,326 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-10-22 08:59:05,327 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,328 INFO L439 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse4 (= ~a25~0 9))) (let ((.cse7 (< 245 ~a29~0)) (.cse1 (<= ~a29~0 140)) (.cse10 (= 10 ~a25~0)) (.cse8 (not .cse4)) (.cse5 (<= ~a23~0 138)) (.cse3 (= 1 ~a4~0)) (.cse9 (<= 130 ~a29~0)) (.cse11 (<= 312 ~a23~0)) (.cse0 (= 1 ~a3~0)) (.cse6 (= 12 ~a25~0)) (.cse2 (= 15 ~a8~0))) (or (and .cse0 (or (and .cse1 (<= ~a23~0 312) .cse2 .cse3 (< 138 ~a23~0)) (and .cse4 .cse5 .cse2 .cse3) (and .cse6 .cse2 .cse3))) (and .cse1 .cse4 .cse0 .cse5 .cse2) (and (and .cse5 .cse7) .cse0 .cse2) (and .cse8 .cse0 .cse2 .cse3 .cse9) (and .cse0 .cse2 .cse3 .cse7) (and .cse5 .cse10 .cse2 .cse3) (and .cse1 .cse0 .cse10 .cse2) (and .cse8 (not (= ~a25~0 11)) .cse0 .cse2 .cse3 .cse11) (and .cse8 .cse0 .cse5 .cse2 (not (= ~a4~0 1))) (and .cse0 .cse2 .cse3 .cse9 .cse11) (and .cse0 (and .cse6 (<= ~a4~0 0)) .cse2)))) [2019-10-22 08:59:05,328 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,328 INFO L443 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,328 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,328 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,328 INFO L443 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,328 INFO L443 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,329 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,329 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,329 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-10-22 08:59:05,329 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-10-22 08:59:05,329 INFO L443 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-10-22 08:59:05,329 INFO L443 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-10-22 08:59:05,329 INFO L443 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-10-22 08:59:05,329 INFO L443 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-10-22 08:59:05,329 INFO L443 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-10-22 08:59:05,329 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,329 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,329 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,329 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,330 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,330 INFO L443 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,330 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,330 INFO L443 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,330 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,330 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,330 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-10-22 08:59:05,330 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-10-22 08:59:05,330 INFO L443 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-10-22 08:59:05,330 INFO L443 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-10-22 08:59:05,331 INFO L443 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,331 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,331 INFO L443 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,331 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,331 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,331 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-10-22 08:59:05,331 INFO L443 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-10-22 08:59:05,331 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-10-22 08:59:05,331 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,331 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,332 INFO L443 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,332 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,332 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-10-22 08:59:05,332 INFO L443 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-10-22 08:59:05,332 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,332 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,332 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,332 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,332 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,332 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,332 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-10-22 08:59:05,333 INFO L443 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-10-22 08:59:05,333 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,333 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,333 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-10-22 08:59:05,333 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-10-22 08:59:05,333 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-10-22 08:59:05,333 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,333 INFO L443 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,333 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,333 INFO L443 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,334 INFO L443 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,334 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,334 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,334 INFO L443 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-10-22 08:59:05,334 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-10-22 08:59:05,334 INFO L443 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-10-22 08:59:05,334 INFO L443 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-10-22 08:59:05,334 INFO L443 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-10-22 08:59:05,335 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-10-22 08:59:05,335 INFO L443 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-10-22 08:59:05,336 INFO L443 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,336 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,336 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 08:59:05,336 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-10-22 08:59:05,336 INFO L443 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-10-22 08:59:05,336 INFO L443 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,336 INFO L443 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,336 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,336 INFO L443 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,336 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,337 INFO L443 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-10-22 08:59:05,337 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-10-22 08:59:05,337 INFO L443 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-10-22 08:59:05,337 INFO L443 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,337 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,337 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,337 INFO L443 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,337 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,337 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,337 INFO L443 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-10-22 08:59:05,337 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-10-22 08:59:05,338 INFO L443 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-10-22 08:59:05,338 INFO L443 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,338 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,338 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,338 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,338 INFO L443 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,338 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,338 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,338 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 08:59:05,339 INFO L443 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,339 INFO L443 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-10-22 08:59:05,339 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-10-22 08:59:05,339 INFO L443 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-10-22 08:59:05,339 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,339 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,340 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,340 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,340 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,340 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,340 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,340 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,340 INFO L443 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,340 INFO L443 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,340 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,340 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-10-22 08:59:05,341 INFO L443 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-10-22 08:59:05,341 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-10-22 08:59:05,341 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-10-22 08:59:05,341 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-10-22 08:59:05,341 INFO L443 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,341 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,341 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,341 INFO L443 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,341 INFO L443 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,341 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,342 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,342 INFO L443 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-10-22 08:59:05,342 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-10-22 08:59:05,342 INFO L443 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-10-22 08:59:05,342 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,342 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,342 INFO L443 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,342 INFO L443 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-10-22 08:59:05,342 INFO L443 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-10-22 08:59:05,342 INFO L443 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,342 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,342 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,342 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,342 INFO L443 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,342 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-10-22 08:59:05,342 INFO L443 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-10-22 08:59:05,342 INFO L443 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,343 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,343 INFO L443 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-10-22 08:59:05,343 INFO L443 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-10-22 08:59:05,343 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,343 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 84) no Hoare annotation was computed. [2019-10-22 08:59:05,343 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,343 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,343 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,343 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,344 INFO L443 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,344 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-10-22 08:59:05,344 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-10-22 08:59:05,344 INFO L443 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-10-22 08:59:05,344 INFO L443 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-10-22 08:59:05,344 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,344 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,344 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,344 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,344 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,344 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,345 INFO L443 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,345 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,345 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-10-22 08:59:05,345 INFO L443 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-10-22 08:59:05,345 INFO L443 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-10-22 08:59:05,345 INFO L443 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-10-22 08:59:05,345 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-10-22 08:59:05,345 INFO L443 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-10-22 08:59:05,345 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,345 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,345 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,345 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,346 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,346 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,346 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,346 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-10-22 08:59:05,346 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-10-22 08:59:05,346 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 08:59:05,346 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,346 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,346 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,346 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,346 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,346 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,346 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-10-22 08:59:05,346 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-10-22 08:59:05,346 INFO L443 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,346 INFO L443 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,347 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,347 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,347 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,347 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,347 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,347 INFO L443 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-10-22 08:59:05,347 INFO L443 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,347 INFO L443 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,347 INFO L443 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,348 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-10-22 08:59:05,348 INFO L443 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-10-22 08:59:05,348 INFO L443 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-10-22 08:59:05,348 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,348 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-10-22 08:59:05,348 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,348 INFO L443 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-10-22 08:59:05,348 INFO L443 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,348 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,348 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,348 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,348 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,348 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,348 INFO L443 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-10-22 08:59:05,349 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-10-22 08:59:05,349 INFO L443 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-10-22 08:59:05,349 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,349 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,349 INFO L443 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,349 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 08:59:05,349 INFO L443 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,349 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,349 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,350 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,350 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,350 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,350 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,350 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-10-22 08:59:05,350 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-10-22 08:59:05,350 INFO L443 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-10-22 08:59:05,350 INFO L443 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,350 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-10-22 08:59:05,350 INFO L443 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-10-22 08:59:05,351 INFO L443 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,351 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,351 INFO L443 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,351 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,351 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,351 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,351 INFO L443 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-10-22 08:59:05,351 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-10-22 08:59:05,351 INFO L443 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-10-22 08:59:05,351 INFO L443 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,352 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,352 INFO L443 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,352 INFO L439 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse4 (= ~a25~0 9))) (let ((.cse7 (< 245 ~a29~0)) (.cse1 (<= ~a29~0 140)) (.cse10 (= 10 ~a25~0)) (.cse8 (not .cse4)) (.cse5 (<= ~a23~0 138)) (.cse3 (= 1 ~a4~0)) (.cse9 (<= 130 ~a29~0)) (.cse11 (<= 312 ~a23~0)) (.cse0 (= 1 ~a3~0)) (.cse6 (= 12 ~a25~0)) (.cse2 (= 15 ~a8~0))) (or (and .cse0 (or (and .cse1 (<= ~a23~0 312) .cse2 .cse3 (< 138 ~a23~0)) (and .cse4 .cse5 .cse2 .cse3) (and .cse6 .cse2 .cse3))) (and .cse1 .cse4 .cse0 .cse5 .cse2) (and (and .cse5 .cse7) .cse0 .cse2) (and .cse8 .cse0 .cse2 .cse3 .cse9) (and .cse0 .cse2 .cse3 .cse7) (and .cse5 .cse10 .cse2 .cse3) (and .cse1 .cse0 .cse10 .cse2) (and .cse8 (not (= ~a25~0 11)) .cse0 .cse2 .cse3 .cse11) (and .cse8 .cse0 .cse5 .cse2 (not (= ~a4~0 1))) (and .cse0 .cse2 .cse3 .cse9 .cse11) (and .cse0 (and .cse6 (<= ~a4~0 0)) .cse2)))) [2019-10-22 08:59:05,352 INFO L443 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,352 INFO L443 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-10-22 08:59:05,352 INFO L443 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-10-22 08:59:05,352 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,352 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,352 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-10-22 08:59:05,352 INFO L443 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,352 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,352 INFO L443 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-10-22 08:59:05,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:59:05 BoogieIcfgContainer [2019-10-22 08:59:05,373 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:59:05,373 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:59:05,374 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:59:05,374 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:59:05,374 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:58:45" (3/4) ... [2019-10-22 08:59:05,377 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 08:59:05,397 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 08:59:05,398 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 08:59:05,542 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8a143e6a-e2cf-4d44-b263-808fdfb25639/bin/uautomizer/witness.graphml [2019-10-22 08:59:05,542 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:59:05,543 INFO L168 Benchmark]: Toolchain (without parser) took 22346.19 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 986.7 MB). Free memory was 940.5 MB in the beginning and 801.8 MB in the end (delta: 138.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-10-22 08:59:05,544 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:05,544 INFO L168 Benchmark]: CACSL2BoogieTranslator took 753.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -127.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:05,544 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:05,544 INFO L168 Benchmark]: Boogie Preprocessor took 99.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:05,545 INFO L168 Benchmark]: RCFGBuilder took 1533.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 866.2 MB in the end (delta: 174.1 MB). Peak memory consumption was 174.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:05,545 INFO L168 Benchmark]: TraceAbstraction took 19684.14 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 866.1 MB). Free memory was 866.2 MB in the beginning and 832.3 MB in the end (delta: 33.9 MB). Peak memory consumption was 900.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:05,546 INFO L168 Benchmark]: Witness Printer took 168.83 ms. Allocated memory is still 2.0 GB. Free memory was 832.3 MB in the beginning and 801.8 MB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:05,547 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 753.81 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 940.5 MB in the beginning and 1.1 GB in the end (delta: -127.3 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 102.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 20.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 99.13 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1533.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 866.2 MB in the end (delta: 174.1 MB). Peak memory consumption was 174.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19684.14 ms. Allocated memory was 1.1 GB in the beginning and 2.0 GB in the end (delta: 866.1 MB). Free memory was 866.2 MB in the beginning and 832.3 MB in the end (delta: 33.9 MB). Peak memory consumption was 900.0 MB. Max. memory is 11.5 GB. * Witness Printer took 168.83 ms. Allocated memory is still 2.0 GB. Free memory was 832.3 MB in the beginning and 801.8 MB in the end (delta: 30.5 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 84]: 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: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant Derived loop invariant: ((((((((((1 == a3 && ((((((a29 <= 140 && a23 <= 312) && 15 == a8) && 1 == a4) && 138 < a23) || (((a25 == 9 && a23 <= 138) && 15 == a8) && 1 == a4)) || ((12 == a25 && 15 == a8) && 1 == a4))) || ((((a29 <= 140 && a25 == 9) && 1 == a3) && a23 <= 138) && 15 == a8)) || (((a23 <= 138 && 245 < a29) && 1 == a3) && 15 == a8)) || ((((!(a25 == 9) && 1 == a3) && 15 == a8) && 1 == a4) && 130 <= a29)) || (((1 == a3 && 15 == a8) && 1 == a4) && 245 < a29)) || (((a23 <= 138 && 10 == a25) && 15 == a8) && 1 == a4)) || (((a29 <= 140 && 1 == a3) && 10 == a25) && 15 == a8)) || (((((!(a25 == 9) && !(a25 == 11)) && 1 == a3) && 15 == a8) && 1 == a4) && 312 <= a23)) || ((((!(a25 == 9) && 1 == a3) && a23 <= 138) && 15 == a8) && !(a4 == 1))) || ((((1 == a3 && 15 == a8) && 1 == a4) && 130 <= a29) && 312 <= a23)) || ((1 == a3 && 12 == a25 && a4 <= 0) && 15 == a8) - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: ((((((((((1 == a3 && ((((((a29 <= 140 && a23 <= 312) && 15 == a8) && 1 == a4) && 138 < a23) || (((a25 == 9 && a23 <= 138) && 15 == a8) && 1 == a4)) || ((12 == a25 && 15 == a8) && 1 == a4))) || ((((a29 <= 140 && a25 == 9) && 1 == a3) && a23 <= 138) && 15 == a8)) || (((a23 <= 138 && 245 < a29) && 1 == a3) && 15 == a8)) || ((((!(a25 == 9) && 1 == a3) && 15 == a8) && 1 == a4) && 130 <= a29)) || (((1 == a3 && 15 == a8) && 1 == a4) && 245 < a29)) || (((a23 <= 138 && 10 == a25) && 15 == a8) && 1 == a4)) || (((a29 <= 140 && 1 == a3) && 10 == a25) && 15 == a8)) || (((((!(a25 == 9) && !(a25 == 11)) && 1 == a3) && 15 == a8) && 1 == a4) && 312 <= a23)) || ((((!(a25 == 9) && 1 == a3) && a23 <= 138) && 15 == a8) && !(a4 == 1))) || ((((1 == a3 && 15 == a8) && 1 == a4) && 130 <= a29) && 312 <= a23)) || ((1 == a3 && 12 == a25 && a4 <= 0) && 15 == a8) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 19.6s, OverallIterations: 12, TraceHistogramMax: 5, AutomataDifference: 14.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, HoareTripleCheckerStatistics: 1520 SDtfs, 4314 SDslu, 466 SDs, 0 SdLazy, 12149 SolverSat, 2313 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17579occurred 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: 1.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 12295 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 136 NumberOfFragments, 401 HoareAnnotationTreeSize, 3 FomulaSimplifications, 5174 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 1874 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 3009 NumberOfCodeBlocks, 3009 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 2997 ConstructedInterpolants, 0 QuantifiedInterpolants, 2296024 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 2465/2465 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...