./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label14.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_245207c2-40d1-4c3c-98b1-2ab46a7b45ac/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_245207c2-40d1-4c3c-98b1-2ab46a7b45ac/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_245207c2-40d1-4c3c-98b1-2ab46a7b45ac/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_245207c2-40d1-4c3c-98b1-2ab46a7b45ac/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label14.c -s /tmp/vcloud-vcloud-master/worker/working_dir_245207c2-40d1-4c3c-98b1-2ab46a7b45ac/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_245207c2-40d1-4c3c-98b1-2ab46a7b45ac/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d50ba566f02e5109971f6a90ba216a95432a7661 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:01:19,419 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:01:19,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:01:19,429 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:01:19,429 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:01:19,430 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:01:19,431 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:01:19,432 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:01:19,434 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:01:19,434 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:01:19,435 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:01:19,436 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:01:19,436 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:01:19,440 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:01:19,441 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:01:19,442 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:01:19,443 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:01:19,444 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:01:19,454 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:01:19,458 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:01:19,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:01:19,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:01:19,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:01:19,462 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:01:19,464 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:01:19,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:01:19,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:01:19,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:01:19,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:01:19,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:01:19,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:01:19,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:01:19,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:01:19,470 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:01:19,471 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:01:19,471 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:01:19,472 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:01:19,472 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:01:19,472 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:01:19,473 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:01:19,473 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:01:19,474 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_245207c2-40d1-4c3c-98b1-2ab46a7b45ac/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 09:01:19,486 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:01:19,486 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:01:19,487 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:01:19,487 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:01:19,487 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:01:19,488 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:01:19,488 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:01:19,488 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:01:19,488 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:01:19,488 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:01:19,488 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:01:19,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:01:19,489 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:01:19,489 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:01:19,489 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:01:19,489 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:01:19,489 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:01:19,490 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:01:19,490 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:01:19,490 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:01:19,490 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:01:19,490 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:01:19,490 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:01:19,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:01:19,491 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:01:19,491 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:01:19,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:01:19,491 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:01:19,491 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_245207c2-40d1-4c3c-98b1-2ab46a7b45ac/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d50ba566f02e5109971f6a90ba216a95432a7661 [2019-10-22 09:01:19,525 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:01:19,539 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:01:19,544 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:01:19,546 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:01:19,546 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:01:19,547 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_245207c2-40d1-4c3c-98b1-2ab46a7b45ac/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label14.c [2019-10-22 09:01:19,600 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_245207c2-40d1-4c3c-98b1-2ab46a7b45ac/bin/uautomizer/data/765c6972d/06352b1bc6a946a9986f9c2de205c36b/FLAG334cd7094 [2019-10-22 09:01:20,091 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:01:20,092 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_245207c2-40d1-4c3c-98b1-2ab46a7b45ac/sv-benchmarks/c/eca-rers2012/Problem01_label14.c [2019-10-22 09:01:20,114 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_245207c2-40d1-4c3c-98b1-2ab46a7b45ac/bin/uautomizer/data/765c6972d/06352b1bc6a946a9986f9c2de205c36b/FLAG334cd7094 [2019-10-22 09:01:20,396 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_245207c2-40d1-4c3c-98b1-2ab46a7b45ac/bin/uautomizer/data/765c6972d/06352b1bc6a946a9986f9c2de205c36b [2019-10-22 09:01:20,401 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:01:20,402 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:01:20,403 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:20,403 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:01:20,407 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:01:20,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:20" (1/1) ... [2019-10-22 09:01:20,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c9b2fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:20, skipping insertion in model container [2019-10-22 09:01:20,410 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:01:20" (1/1) ... [2019-10-22 09:01:20,418 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:01:20,475 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:01:20,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:20,892 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:01:20,999 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:01:21,019 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:01:21,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:21 WrapperNode [2019-10-22 09:01:21,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:01:21,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:21,020 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:01:21,020 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:01:21,029 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:21" (1/1) ... [2019-10-22 09:01:21,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:21" (1/1) ... [2019-10-22 09:01:21,101 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:01:21,101 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:01:21,101 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:01:21,101 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:01:21,111 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:21" (1/1) ... [2019-10-22 09:01:21,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:21" (1/1) ... [2019-10-22 09:01:21,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:21" (1/1) ... [2019-10-22 09:01:21,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:21" (1/1) ... [2019-10-22 09:01:21,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:21" (1/1) ... [2019-10-22 09:01:21,166 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:21" (1/1) ... [2019-10-22 09:01:21,181 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:21" (1/1) ... [2019-10-22 09:01:21,195 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:01:21,195 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:01:21,195 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:01:21,195 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:01:21,196 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_245207c2-40d1-4c3c-98b1-2ab46a7b45ac/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 09:01:21,273 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:01:21,273 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:01:22,280 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:01:22,280 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 09:01:22,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:22 BoogieIcfgContainer [2019-10-22 09:01:22,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:01:22,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:01:22,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:01:22,287 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:01:22,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:01:20" (1/3) ... [2019-10-22 09:01:22,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c1a86c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:01:22, skipping insertion in model container [2019-10-22 09:01:22,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:01:21" (2/3) ... [2019-10-22 09:01:22,290 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c1a86c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:01:22, skipping insertion in model container [2019-10-22 09:01:22,290 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:22" (3/3) ... [2019-10-22 09:01:22,292 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label14.c [2019-10-22 09:01:22,303 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:01:22,311 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 09:01:22,321 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 09:01:22,359 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:01:22,359 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:01:22,359 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:01:22,360 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:01:22,360 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:01:22,360 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:01:22,360 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:01:22,360 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:01:22,379 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-10-22 09:01:22,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-22 09:01:22,389 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:22,390 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:22,392 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:22,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:22,398 INFO L82 PathProgramCache]: Analyzing trace with hash 2004563326, now seen corresponding path program 1 times [2019-10-22 09:01:22,407 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:22,407 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462326875] [2019-10-22 09:01:22,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:22,407 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:22,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:23,471 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 09:01:23,472 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462326875] [2019-10-22 09:01:23,473 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:23,474 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 09:01:23,474 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058167712] [2019-10-22 09:01:23,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 09:01:23,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:23,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 09:01:23,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:01:23,493 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 10 states. [2019-10-22 09:01:24,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:24,689 INFO L93 Difference]: Finished difference Result 493 states and 846 transitions. [2019-10-22 09:01:24,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 09:01:24,691 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 131 [2019-10-22 09:01:24,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:24,711 INFO L225 Difference]: With dead ends: 493 [2019-10-22 09:01:24,714 INFO L226 Difference]: Without dead ends: 193 [2019-10-22 09:01:24,718 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2019-10-22 09:01:24,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-10-22 09:01:24,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-10-22 09:01:24,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-10-22 09:01:24,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 264 transitions. [2019-10-22 09:01:24,784 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 264 transitions. Word has length 131 [2019-10-22 09:01:24,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:24,785 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 264 transitions. [2019-10-22 09:01:24,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 09:01:24,786 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 264 transitions. [2019-10-22 09:01:24,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-22 09:01:24,788 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:24,788 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:24,789 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:24,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:24,789 INFO L82 PathProgramCache]: Analyzing trace with hash 481563718, now seen corresponding path program 1 times [2019-10-22 09:01:24,789 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:24,789 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097254042] [2019-10-22 09:01:24,789 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:24,790 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:24,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:24,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:24,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 09:01:24,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097254042] [2019-10-22 09:01:24,923 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:24,923 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:24,924 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962315979] [2019-10-22 09:01:24,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:24,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:24,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:24,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:24,928 INFO L87 Difference]: Start difference. First operand 193 states and 264 transitions. Second operand 3 states. [2019-10-22 09:01:25,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:25,344 INFO L93 Difference]: Finished difference Result 457 states and 661 transitions. [2019-10-22 09:01:25,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:25,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2019-10-22 09:01:25,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:25,347 INFO L225 Difference]: With dead ends: 457 [2019-10-22 09:01:25,347 INFO L226 Difference]: Without dead ends: 324 [2019-10-22 09:01:25,348 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 09:01:25,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-10-22 09:01:25,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 324. [2019-10-22 09:01:25,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2019-10-22 09:01:25,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 443 transitions. [2019-10-22 09:01:25,367 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 443 transitions. Word has length 135 [2019-10-22 09:01:25,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:25,368 INFO L462 AbstractCegarLoop]: Abstraction has 324 states and 443 transitions. [2019-10-22 09:01:25,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:25,368 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 443 transitions. [2019-10-22 09:01:25,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-22 09:01:25,371 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:25,371 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:25,371 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:25,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:25,371 INFO L82 PathProgramCache]: Analyzing trace with hash -892512546, now seen corresponding path program 1 times [2019-10-22 09:01:25,372 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:25,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484227142] [2019-10-22 09:01:25,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:25,372 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:25,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:25,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:25,427 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 09:01:25,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484227142] [2019-10-22 09:01:25,428 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:25,428 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:25,428 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167319539] [2019-10-22 09:01:25,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:25,431 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:25,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:25,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:25,431 INFO L87 Difference]: Start difference. First operand 324 states and 443 transitions. Second operand 4 states. [2019-10-22 09:01:25,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:25,970 INFO L93 Difference]: Finished difference Result 850 states and 1198 transitions. [2019-10-22 09:01:25,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:25,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-22 09:01:25,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:25,973 INFO L225 Difference]: With dead ends: 850 [2019-10-22 09:01:25,973 INFO L226 Difference]: Without dead ends: 586 [2019-10-22 09:01:25,974 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 09:01:25,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2019-10-22 09:01:25,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 586. [2019-10-22 09:01:25,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-10-22 09:01:25,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 783 transitions. [2019-10-22 09:01:25,998 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 783 transitions. Word has length 140 [2019-10-22 09:01:25,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:25,998 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 783 transitions. [2019-10-22 09:01:25,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:25,998 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 783 transitions. [2019-10-22 09:01:26,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-22 09:01:26,002 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:26,002 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:26,002 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:26,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:26,003 INFO L82 PathProgramCache]: Analyzing trace with hash -970300302, now seen corresponding path program 1 times [2019-10-22 09:01:26,003 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:26,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555900195] [2019-10-22 09:01:26,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:26,003 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:26,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:26,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:26,053 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 09:01:26,054 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555900195] [2019-10-22 09:01:26,054 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:26,054 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:01:26,054 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964514857] [2019-10-22 09:01:26,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:26,055 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:26,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:26,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:26,055 INFO L87 Difference]: Start difference. First operand 586 states and 783 transitions. Second operand 3 states. [2019-10-22 09:01:26,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:26,447 INFO L93 Difference]: Finished difference Result 1243 states and 1680 transitions. [2019-10-22 09:01:26,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:26,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-10-22 09:01:26,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:26,450 INFO L225 Difference]: With dead ends: 1243 [2019-10-22 09:01:26,450 INFO L226 Difference]: Without dead ends: 717 [2019-10-22 09:01:26,452 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 09:01:26,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-10-22 09:01:26,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 586. [2019-10-22 09:01:26,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2019-10-22 09:01:26,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 777 transitions. [2019-10-22 09:01:26,471 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 777 transitions. Word has length 148 [2019-10-22 09:01:26,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:26,471 INFO L462 AbstractCegarLoop]: Abstraction has 586 states and 777 transitions. [2019-10-22 09:01:26,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:26,472 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 777 transitions. [2019-10-22 09:01:26,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-22 09:01:26,474 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:26,474 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:26,474 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:26,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:26,475 INFO L82 PathProgramCache]: Analyzing trace with hash -247512496, now seen corresponding path program 1 times [2019-10-22 09:01:26,475 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:26,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323646856] [2019-10-22 09:01:26,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:26,475 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:26,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:26,519 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-22 09:01:26,520 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323646856] [2019-10-22 09:01:26,520 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:26,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:26,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785663151] [2019-10-22 09:01:26,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:26,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:26,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:26,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:26,521 INFO L87 Difference]: Start difference. First operand 586 states and 777 transitions. Second operand 4 states. [2019-10-22 09:01:27,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:27,150 INFO L93 Difference]: Finished difference Result 2029 states and 2732 transitions. [2019-10-22 09:01:27,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:27,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 157 [2019-10-22 09:01:27,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:27,156 INFO L225 Difference]: With dead ends: 2029 [2019-10-22 09:01:27,156 INFO L226 Difference]: Without dead ends: 1503 [2019-10-22 09:01:27,157 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 09:01:27,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-10-22 09:01:27,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1372. [2019-10-22 09:01:27,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-10-22 09:01:27,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1768 transitions. [2019-10-22 09:01:27,191 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1768 transitions. Word has length 157 [2019-10-22 09:01:27,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:27,192 INFO L462 AbstractCegarLoop]: Abstraction has 1372 states and 1768 transitions. [2019-10-22 09:01:27,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:27,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1768 transitions. [2019-10-22 09:01:27,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-22 09:01:27,195 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:27,195 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:27,196 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:27,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:27,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1736300161, now seen corresponding path program 1 times [2019-10-22 09:01:27,196 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:27,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141942407] [2019-10-22 09:01:27,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:27,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:27,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:27,274 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-22 09:01:27,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141942407] [2019-10-22 09:01:27,274 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:27,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:27,276 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658430228] [2019-10-22 09:01:27,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:01:27,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:27,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:01:27,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:27,277 INFO L87 Difference]: Start difference. First operand 1372 states and 1768 transitions. Second operand 5 states. [2019-10-22 09:01:28,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:28,183 INFO L93 Difference]: Finished difference Result 2815 states and 3620 transitions. [2019-10-22 09:01:28,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:01:28,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 163 [2019-10-22 09:01:28,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:28,188 INFO L225 Difference]: With dead ends: 2815 [2019-10-22 09:01:28,188 INFO L226 Difference]: Without dead ends: 1503 [2019-10-22 09:01:28,189 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 09:01:28,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-10-22 09:01:28,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2019-10-22 09:01:28,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-10-22 09:01:28,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1893 transitions. [2019-10-22 09:01:28,218 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1893 transitions. Word has length 163 [2019-10-22 09:01:28,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:28,218 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1893 transitions. [2019-10-22 09:01:28,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:01:28,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1893 transitions. [2019-10-22 09:01:28,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-10-22 09:01:28,222 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:28,222 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:28,222 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:28,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:28,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1205837626, now seen corresponding path program 1 times [2019-10-22 09:01:28,223 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:28,223 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442301047] [2019-10-22 09:01:28,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:28,223 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:28,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:28,263 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-22 09:01:28,263 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442301047] [2019-10-22 09:01:28,264 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:28,264 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:28,264 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667658052] [2019-10-22 09:01:28,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:28,264 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:28,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:28,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:28,265 INFO L87 Difference]: Start difference. First operand 1503 states and 1893 transitions. Second operand 3 states. [2019-10-22 09:01:28,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:28,743 INFO L93 Difference]: Finished difference Result 3601 states and 4557 transitions. [2019-10-22 09:01:28,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:28,744 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-10-22 09:01:28,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:28,750 INFO L225 Difference]: With dead ends: 3601 [2019-10-22 09:01:28,750 INFO L226 Difference]: Without dead ends: 1896 [2019-10-22 09:01:28,753 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 09:01:28,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1896 states. [2019-10-22 09:01:28,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1896 to 1765. [2019-10-22 09:01:28,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2019-10-22 09:01:28,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2004 transitions. [2019-10-22 09:01:28,790 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2004 transitions. Word has length 166 [2019-10-22 09:01:28,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:28,791 INFO L462 AbstractCegarLoop]: Abstraction has 1765 states and 2004 transitions. [2019-10-22 09:01:28,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:28,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2004 transitions. [2019-10-22 09:01:28,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-10-22 09:01:28,795 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:28,795 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:28,795 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:28,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:28,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1300334530, now seen corresponding path program 1 times [2019-10-22 09:01:28,796 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:28,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849734704] [2019-10-22 09:01:28,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:28,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:28,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:28,877 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:01:28,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849734704] [2019-10-22 09:01:28,878 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:28,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:28,878 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187010100] [2019-10-22 09:01:28,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:01:28,879 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:28,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:01:28,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:28,879 INFO L87 Difference]: Start difference. First operand 1765 states and 2004 transitions. Second operand 5 states. [2019-10-22 09:01:29,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:29,673 INFO L93 Difference]: Finished difference Result 4782 states and 5478 transitions. [2019-10-22 09:01:29,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:01:29,673 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 181 [2019-10-22 09:01:29,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:29,682 INFO L225 Difference]: With dead ends: 4782 [2019-10-22 09:01:29,682 INFO L226 Difference]: Without dead ends: 3077 [2019-10-22 09:01:29,684 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 09:01:29,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3077 states. [2019-10-22 09:01:29,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3077 to 2682. [2019-10-22 09:01:29,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2019-10-22 09:01:29,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 2977 transitions. [2019-10-22 09:01:29,734 INFO L78 Accepts]: Start accepts. Automaton has 2682 states and 2977 transitions. Word has length 181 [2019-10-22 09:01:29,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:29,735 INFO L462 AbstractCegarLoop]: Abstraction has 2682 states and 2977 transitions. [2019-10-22 09:01:29,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:01:29,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 2977 transitions. [2019-10-22 09:01:29,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-10-22 09:01:29,741 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:29,741 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:29,741 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:29,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:29,741 INFO L82 PathProgramCache]: Analyzing trace with hash 766976078, now seen corresponding path program 1 times [2019-10-22 09:01:29,742 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:29,742 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618668049] [2019-10-22 09:01:29,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:29,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:29,893 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-22 09:01:29,894 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618668049] [2019-10-22 09:01:29,894 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:29,894 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:29,894 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859401207] [2019-10-22 09:01:29,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:29,895 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:29,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:29,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:29,895 INFO L87 Difference]: Start difference. First operand 2682 states and 2977 transitions. Second operand 4 states. [2019-10-22 09:01:30,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:30,607 INFO L93 Difference]: Finished difference Result 5699 states and 6349 transitions. [2019-10-22 09:01:30,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:30,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-10-22 09:01:30,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:30,616 INFO L225 Difference]: With dead ends: 5699 [2019-10-22 09:01:30,616 INFO L226 Difference]: Without dead ends: 2946 [2019-10-22 09:01:30,618 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:30,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2946 states. [2019-10-22 09:01:30,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2946 to 2682. [2019-10-22 09:01:30,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2019-10-22 09:01:30,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 2882 transitions. [2019-10-22 09:01:30,662 INFO L78 Accepts]: Start accepts. Automaton has 2682 states and 2882 transitions. Word has length 210 [2019-10-22 09:01:30,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:30,663 INFO L462 AbstractCegarLoop]: Abstraction has 2682 states and 2882 transitions. [2019-10-22 09:01:30,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:30,663 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 2882 transitions. [2019-10-22 09:01:30,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-22 09:01:30,668 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:30,668 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:30,668 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:30,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:30,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1931153020, now seen corresponding path program 1 times [2019-10-22 09:01:30,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:30,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139132730] [2019-10-22 09:01:30,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:30,669 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:30,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:30,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:30,808 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-10-22 09:01:30,808 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139132730] [2019-10-22 09:01:30,808 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:30,808 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:01:30,809 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192497646] [2019-10-22 09:01:30,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:30,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:30,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:30,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:01:30,810 INFO L87 Difference]: Start difference. First operand 2682 states and 2882 transitions. Second operand 3 states. [2019-10-22 09:01:31,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:31,142 INFO L93 Difference]: Finished difference Result 5566 states and 5992 transitions. [2019-10-22 09:01:31,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:31,143 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 235 [2019-10-22 09:01:31,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:31,150 INFO L225 Difference]: With dead ends: 5566 [2019-10-22 09:01:31,150 INFO L226 Difference]: Without dead ends: 2682 [2019-10-22 09:01:31,153 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 09:01:31,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2682 states. [2019-10-22 09:01:31,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2682 to 2420. [2019-10-22 09:01:31,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2019-10-22 09:01:31,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 2562 transitions. [2019-10-22 09:01:31,193 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 2562 transitions. Word has length 235 [2019-10-22 09:01:31,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:31,194 INFO L462 AbstractCegarLoop]: Abstraction has 2420 states and 2562 transitions. [2019-10-22 09:01:31,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:31,194 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 2562 transitions. [2019-10-22 09:01:31,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-22 09:01:31,198 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:31,198 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:31,199 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:31,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:31,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1131445953, now seen corresponding path program 1 times [2019-10-22 09:01:31,199 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:31,199 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706015695] [2019-10-22 09:01:31,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:31,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:31,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:31,290 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 161 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-22 09:01:31,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706015695] [2019-10-22 09:01:31,290 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:31,291 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:31,291 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954836126] [2019-10-22 09:01:31,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:01:31,291 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:31,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:01:31,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:01:31,291 INFO L87 Difference]: Start difference. First operand 2420 states and 2562 transitions. Second operand 4 states. [2019-10-22 09:01:31,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:31,841 INFO L93 Difference]: Finished difference Result 4780 states and 5062 transitions. [2019-10-22 09:01:31,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:31,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 237 [2019-10-22 09:01:31,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:31,846 INFO L225 Difference]: With dead ends: 4780 [2019-10-22 09:01:31,846 INFO L226 Difference]: Without dead ends: 1634 [2019-10-22 09:01:31,849 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 09:01:31,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2019-10-22 09:01:31,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1503. [2019-10-22 09:01:31,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-10-22 09:01:31,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1570 transitions. [2019-10-22 09:01:31,878 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1570 transitions. Word has length 237 [2019-10-22 09:01:31,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:31,878 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1570 transitions. [2019-10-22 09:01:31,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:01:31,878 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1570 transitions. [2019-10-22 09:01:31,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-10-22 09:01:31,883 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:31,883 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:31,883 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:31,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:31,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1941854154, now seen corresponding path program 1 times [2019-10-22 09:01:31,884 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:31,884 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270623379] [2019-10-22 09:01:31,884 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:31,884 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:31,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:32,295 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-10-22 09:01:32,295 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270623379] [2019-10-22 09:01:32,295 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:32,296 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:32,296 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966416642] [2019-10-22 09:01:32,296 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:01:32,296 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:32,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:01:32,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:32,297 INFO L87 Difference]: Start difference. First operand 1503 states and 1570 transitions. Second operand 5 states. [2019-10-22 09:01:32,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:32,700 INFO L93 Difference]: Finished difference Result 3023 states and 3163 transitions. [2019-10-22 09:01:32,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:32,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 259 [2019-10-22 09:01:32,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:32,704 INFO L225 Difference]: With dead ends: 3023 [2019-10-22 09:01:32,704 INFO L226 Difference]: Without dead ends: 1503 [2019-10-22 09:01:32,705 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:32,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-10-22 09:01:32,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2019-10-22 09:01:32,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-10-22 09:01:32,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1567 transitions. [2019-10-22 09:01:32,728 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1567 transitions. Word has length 259 [2019-10-22 09:01:32,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:32,728 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1567 transitions. [2019-10-22 09:01:32,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:01:32,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1567 transitions. [2019-10-22 09:01:32,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-10-22 09:01:32,733 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:32,733 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:32,733 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:32,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:32,734 INFO L82 PathProgramCache]: Analyzing trace with hash -1207165551, now seen corresponding path program 1 times [2019-10-22 09:01:32,734 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:32,734 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409324847] [2019-10-22 09:01:32,734 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,734 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:32,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:33,460 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 215 proven. 4 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-22 09:01:33,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409324847] [2019-10-22 09:01:33,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1655467783] [2019-10-22 09:01:33,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_245207c2-40d1-4c3c-98b1-2ab46a7b45ac/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:33,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:33,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 486 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:01:33,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:01:33,652 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-22 09:01:33,652 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 09:01:33,652 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2019-10-22 09:01:33,652 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035855783] [2019-10-22 09:01:33,653 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:01:33,653 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:33,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:01:33,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:01:33,653 INFO L87 Difference]: Start difference. First operand 1503 states and 1567 transitions. Second operand 3 states. [2019-10-22 09:01:33,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:33,938 INFO L93 Difference]: Finished difference Result 1505 states and 1568 transitions. [2019-10-22 09:01:33,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:01:33,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 282 [2019-10-22 09:01:33,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:33,942 INFO L225 Difference]: With dead ends: 1505 [2019-10-22 09:01:33,942 INFO L226 Difference]: Without dead ends: 1503 [2019-10-22 09:01:33,943 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 285 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:01:33,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-10-22 09:01:33,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1372. [2019-10-22 09:01:33,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1372 states. [2019-10-22 09:01:33,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1372 states to 1372 states and 1430 transitions. [2019-10-22 09:01:33,963 INFO L78 Accepts]: Start accepts. Automaton has 1372 states and 1430 transitions. Word has length 282 [2019-10-22 09:01:33,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:33,963 INFO L462 AbstractCegarLoop]: Abstraction has 1372 states and 1430 transitions. [2019-10-22 09:01:33,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:01:33,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1372 states and 1430 transitions. [2019-10-22 09:01:33,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-10-22 09:01:33,967 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:01:33,967 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:01:34,168 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 09:01:34,168 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:01:34,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:01:34,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1143025436, now seen corresponding path program 1 times [2019-10-22 09:01:34,168 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:01:34,168 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133423839] [2019-10-22 09:01:34,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,169 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:01:34,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:01:34,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:01:34,530 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2019-10-22 09:01:34,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133423839] [2019-10-22 09:01:34,531 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:01:34,531 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:01:34,531 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275781106] [2019-10-22 09:01:34,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 09:01:34,532 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:01:34,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:01:34,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:34,532 INFO L87 Difference]: Start difference. First operand 1372 states and 1430 transitions. Second operand 5 states. [2019-10-22 09:01:34,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:01:34,926 INFO L93 Difference]: Finished difference Result 2631 states and 2747 transitions. [2019-10-22 09:01:34,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:01:34,926 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 295 [2019-10-22 09:01:34,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:01:34,927 INFO L225 Difference]: With dead ends: 2631 [2019-10-22 09:01:34,927 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 09:01:34,929 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:01:34,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 09:01:34,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 09:01:34,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 09:01:34,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 09:01:34,929 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 295 [2019-10-22 09:01:34,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:01:34,929 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:01:34,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 09:01:34,930 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:01:34,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 09:01:34,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 09:01:35,260 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-10-22 09:01:35,577 WARN L191 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-10-22 09:01:35,579 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-22 09:01:35,579 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-22 09:01:35,579 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,579 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,579 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,580 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,580 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,580 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,580 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-22 09:01:35,580 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-22 09:01:35,580 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-10-22 09:01:35,580 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-10-22 09:01:35,580 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-10-22 09:01:35,580 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-10-22 09:01:35,580 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-10-22 09:01:35,581 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-10-22 09:01:35,581 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-22 09:01:35,581 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-22 09:01:35,581 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,581 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,581 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,581 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,582 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,582 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,582 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-22 09:01:35,582 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-22 09:01:35,582 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-10-22 09:01:35,582 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-10-22 09:01:35,582 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-10-22 09:01:35,582 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-10-22 09:01:35,582 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-10-22 09:01:35,582 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-10-22 09:01:35,583 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-22 09:01:35,583 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-22 09:01:35,583 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-22 09:01:35,583 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-22 09:01:35,583 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-22 09:01:35,583 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-22 09:01:35,583 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-10-22 09:01:35,583 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,583 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,583 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,583 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,584 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,584 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-22 09:01:35,584 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-22 09:01:35,584 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-10-22 09:01:35,584 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-10-22 09:01:35,584 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-10-22 09:01:35,584 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-10-22 09:01:35,584 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-10-22 09:01:35,584 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-10-22 09:01:35,584 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-22 09:01:35,586 INFO L439 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse10 (= ~a16~0 6)) (.cse1 (= ~a17~0 1))) (let ((.cse9 (= ~a20~0 1)) (.cse3 (= 15 ~a8~0)) (.cse15 (not .cse1)) (.cse16 (not .cse10)) (.cse13 (= ~a21~0 1))) (let ((.cse2 (and .cse16 .cse13)) (.cse4 (= ~a16~0 5)) (.cse12 (and .cse9 .cse3 .cse15)) (.cse0 (= 1 ~a7~0)) (.cse6 (<= ~a21~0 0)) (.cse11 (= ~a16~0 4)) (.cse8 (<= ~a17~0 0)) (.cse14 (<= ~a7~0 0)) (.cse5 (not .cse9)) (.cse7 (= ~a12~0 8))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse5 .cse1 .cse2) (and .cse5 .cse4) (and .cse0 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse8 .cse3) (and .cse11 .cse7 .cse8 .cse12) (and .cse8 .cse3 .cse4) (and (or (and .cse0 .cse6 .cse11 .cse8) (and .cse0 .cse8 .cse4)) .cse7) (and .cse11 .cse7 .cse8 .cse13 .cse14 (= 14 ~a8~0)) (and (and .cse1 .cse13) .cse7) (and .cse12 .cse10) (and .cse5 (and .cse11 .cse15)) (and .cse0 .cse6 .cse16 .cse1 .cse7) (and .cse11 (= ~a8~0 13) .cse7 .cse8 .cse13 .cse14) (and .cse5 .cse7 .cse3 .cse10))))) [2019-10-22 09:01:35,586 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,586 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,586 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,586 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,586 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,586 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-22 09:01:35,587 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-10-22 09:01:35,587 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-10-22 09:01:35,587 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-10-22 09:01:35,587 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-10-22 09:01:35,587 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-10-22 09:01:35,587 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-22 09:01:35,587 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-22 09:01:35,587 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-22 09:01:35,587 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-22 09:01:35,587 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-22 09:01:35,587 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-22 09:01:35,588 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-22 09:01:35,588 INFO L446 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-10-22 09:01:35,588 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,588 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,588 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,588 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,588 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,588 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-22 09:01:35,588 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-22 09:01:35,588 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-22 09:01:35,589 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-10-22 09:01:35,589 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-10-22 09:01:35,589 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-10-22 09:01:35,589 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-10-22 09:01:35,589 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-10-22 09:01:35,590 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 569) no Hoare annotation was computed. [2019-10-22 09:01:35,590 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-22 09:01:35,590 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,590 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,590 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,590 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,590 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-22 09:01:35,590 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,590 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-22 09:01:35,591 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-22 09:01:35,591 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-10-22 09:01:35,591 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-10-22 09:01:35,591 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-10-22 09:01:35,591 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-10-22 09:01:35,591 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-10-22 09:01:35,591 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 09:01:35,591 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-22 09:01:35,591 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-22 09:01:35,591 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-22 09:01:35,591 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-22 09:01:35,592 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-22 09:01:35,592 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-22 09:01:35,592 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,592 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse10 (= ~a16~0 6)) (.cse1 (= ~a17~0 1))) (let ((.cse9 (= ~a20~0 1)) (.cse3 (= 15 ~a8~0)) (.cse15 (not .cse1)) (.cse16 (not .cse10)) (.cse13 (= ~a21~0 1))) (let ((.cse2 (and .cse16 .cse13)) (.cse4 (= ~a16~0 5)) (.cse12 (and .cse9 .cse3 .cse15)) (.cse0 (= 1 ~a7~0)) (.cse6 (<= ~a21~0 0)) (.cse11 (= ~a16~0 4)) (.cse8 (<= ~a17~0 0)) (.cse14 (<= ~a7~0 0)) (.cse5 (not .cse9)) (.cse7 (= ~a12~0 8))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3 .cse4) (and .cse5 .cse1 .cse2) (and .cse5 .cse4) (and .cse0 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse11 .cse8 .cse3) (and .cse11 .cse7 .cse8 .cse12) (and .cse8 .cse3 .cse4) (and (or (and .cse0 .cse6 .cse11 .cse8) (and .cse0 .cse8 .cse4)) .cse7) (and .cse11 .cse7 .cse8 .cse13 .cse14 (= 14 ~a8~0)) (and (and .cse1 .cse13) .cse7) (and .cse12 .cse10) (and .cse5 (and .cse11 .cse15)) (and .cse0 .cse6 .cse16 .cse1 .cse7) (and .cse11 (= ~a8~0 13) .cse7 .cse8 .cse13 .cse14) (and .cse5 .cse7 .cse3 .cse10))))) [2019-10-22 09:01:35,592 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,592 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,592 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,593 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,593 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-22 09:01:35,593 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-10-22 09:01:35,593 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-10-22 09:01:35,594 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-10-22 09:01:35,594 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-10-22 09:01:35,594 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-10-22 09:01:35,594 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-22 09:01:35,594 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-22 09:01:35,594 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,594 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,594 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,594 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,594 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,595 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-22 09:01:35,595 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 09:01:35,595 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-22 09:01:35,595 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-22 09:01:35,595 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-22 09:01:35,595 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-10-22 09:01:35,595 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-10-22 09:01:35,595 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-10-22 09:01:35,595 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-10-22 09:01:35,595 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-10-22 09:01:35,595 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-22 09:01:35,596 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-22 09:01:35,596 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-22 09:01:35,596 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,596 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,596 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,597 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,597 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-10-22 09:01:35,597 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,597 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,597 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-22 09:01:35,597 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-22 09:01:35,597 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 09:01:35,597 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-10-22 09:01:35,597 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-10-22 09:01:35,597 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-10-22 09:01:35,597 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-10-22 09:01:35,598 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-10-22 09:01:35,598 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-10-22 09:01:35,598 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-22 09:01:35,598 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-22 09:01:35,598 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-22 09:01:35,598 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-22 09:01:35,598 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,598 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,598 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,598 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,598 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,599 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-22 09:01:35,599 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,599 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-22 09:01:35,599 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-22 09:01:35,599 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-10-22 09:01:35,599 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-10-22 09:01:35,599 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-10-22 09:01:35,599 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-10-22 09:01:35,599 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-10-22 09:01:35,599 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-10-22 09:01:35,599 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-22 09:01:35,600 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-22 09:01:35,600 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-22 09:01:35,600 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 09:01:35,600 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-22 09:01:35,600 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-22 09:01:35,600 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-22 09:01:35,600 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,600 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,600 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,600 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,601 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,601 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 09:01:35,601 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-22 09:01:35,602 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-10-22 09:01:35,602 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-10-22 09:01:35,602 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-10-22 09:01:35,602 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-10-22 09:01:35,602 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-10-22 09:01:35,602 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-10-22 09:01:35,602 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-22 09:01:35,602 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-22 09:01:35,602 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-22 09:01:35,624 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:01:35 BoogieIcfgContainer [2019-10-22 09:01:35,624 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:01:35,626 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:01:35,627 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:01:35,627 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:01:35,628 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:01:22" (3/4) ... [2019-10-22 09:01:35,631 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 09:01:35,648 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 09:01:35,653 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 09:01:35,802 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_245207c2-40d1-4c3c-98b1-2ab46a7b45ac/bin/uautomizer/witness.graphml [2019-10-22 09:01:35,802 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:01:35,803 INFO L168 Benchmark]: Toolchain (without parser) took 15401.29 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 641.7 MB). Free memory was 937.8 MB in the beginning and 882.4 MB in the end (delta: 55.4 MB). Peak memory consumption was 697.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:35,804 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:35,804 INFO L168 Benchmark]: CACSL2BoogieTranslator took 616.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -191.8 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:35,804 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:01:35,804 INFO L168 Benchmark]: Boogie Preprocessor took 93.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:35,809 INFO L168 Benchmark]: RCFGBuilder took 1086.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.3 MB). Peak memory consumption was 110.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:35,809 INFO L168 Benchmark]: TraceAbstraction took 13343.48 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 480.8 MB). Free memory was 1.0 GB in the beginning and 903.7 MB in the end (delta: 108.7 MB). Peak memory consumption was 589.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:35,809 INFO L168 Benchmark]: Witness Printer took 175.89 ms. Allocated memory is still 1.7 GB. Free memory was 903.7 MB in the beginning and 882.4 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:01:35,811 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 616.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 937.8 MB in the beginning and 1.1 GB in the end (delta: -191.8 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1086.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.3 MB). Peak memory consumption was 110.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13343.48 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 480.8 MB). Free memory was 1.0 GB in the beginning and 903.7 MB in the end (delta: 108.7 MB). Peak memory consumption was 589.5 MB. Max. memory is 11.5 GB. * Witness Printer took 175.89 ms. Allocated memory is still 1.7 GB. Free memory was 903.7 MB in the beginning and 882.4 MB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 569]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((1 == a7 && a17 == 1) && !(a16 == 6) && a21 == 1) || ((1 == a7 && 15 == a8) && a16 == 5)) || ((!(a20 == 1) && a17 == 1) && !(a16 == 6) && a21 == 1)) || (!(a20 == 1) && a16 == 5)) || (((((1 == a7 && a21 <= 0) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6)) || (((1 == a7 && a16 == 4) && a17 <= 0) && 15 == a8)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && (a20 == 1 && 15 == a8) && !(a17 == 1))) || ((a17 <= 0 && 15 == a8) && a16 == 5)) || (((((1 == a7 && a21 <= 0) && a16 == 4) && a17 <= 0) || ((1 == a7 && a17 <= 0) && a16 == 5)) && a12 == 8)) || (((((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0) && 14 == a8)) || ((a17 == 1 && a21 == 1) && a12 == 8)) || (((a20 == 1 && 15 == a8) && !(a17 == 1)) && a16 == 6)) || (!(a20 == 1) && a16 == 4 && !(a17 == 1))) || ((((1 == a7 && a21 <= 0) && !(a16 == 6)) && a17 == 1) && a12 == 8)) || (((((a16 == 4 && a8 == 13) && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0)) || (((!(a20 == 1) && a12 == 8) && 15 == a8) && a16 == 6) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((1 == a7 && a17 == 1) && !(a16 == 6) && a21 == 1) || ((1 == a7 && 15 == a8) && a16 == 5)) || ((!(a20 == 1) && a17 == 1) && !(a16 == 6) && a21 == 1)) || (!(a20 == 1) && a16 == 5)) || (((((1 == a7 && a21 <= 0) && a12 == 8) && a17 <= 0) && a20 == 1) && a16 == 6)) || (((1 == a7 && a16 == 4) && a17 <= 0) && 15 == a8)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && (a20 == 1 && 15 == a8) && !(a17 == 1))) || ((a17 <= 0 && 15 == a8) && a16 == 5)) || (((((1 == a7 && a21 <= 0) && a16 == 4) && a17 <= 0) || ((1 == a7 && a17 <= 0) && a16 == 5)) && a12 == 8)) || (((((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0) && 14 == a8)) || ((a17 == 1 && a21 == 1) && a12 == 8)) || (((a20 == 1 && 15 == a8) && !(a17 == 1)) && a16 == 6)) || (!(a20 == 1) && a16 == 4 && !(a17 == 1))) || ((((1 == a7 && a21 <= 0) && !(a16 == 6)) && a17 == 1) && a12 == 8)) || (((((a16 == 4 && a8 == 13) && a12 == 8) && a17 <= 0) && a21 == 1) && a7 <= 0)) || (((!(a20 == 1) && a12 == 8) && 15 == a8) && a16 == 6) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 13.2s, OverallIterations: 14, TraceHistogramMax: 6, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, HoareTripleCheckerStatistics: 1110 SDtfs, 2796 SDslu, 156 SDs, 0 SdLazy, 7086 SolverSat, 816 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 366 GetRequests, 307 SyntacticMatches, 9 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2682occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 14 MinimizatonAttempts, 1576 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 50 NumberOfFragments, 499 HoareAnnotationTreeSize, 3 FomulaSimplifications, 858 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 294 FormulaSimplificationTreeSizeReductionInter, 0.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 3021 NumberOfCodeBlocks, 3021 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 3006 ConstructedInterpolants, 0 QuantifiedInterpolants, 3254078 SizeOfPredicates, 1 NumberOfNonLiveVariables, 486 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 1895/1899 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...