./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label26.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_419ef3eb-b2db-477c-83a0-e5be0330af8c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_419ef3eb-b2db-477c-83a0-e5be0330af8c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_419ef3eb-b2db-477c-83a0-e5be0330af8c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_419ef3eb-b2db-477c-83a0-e5be0330af8c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label26.c -s /tmp/vcloud-vcloud-master/worker/working_dir_419ef3eb-b2db-477c-83a0-e5be0330af8c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_419ef3eb-b2db-477c-83a0-e5be0330af8c/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 e002fb6463a65ebb6b75b40986db95c31112380a ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:55:52,212 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:55:52,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:55:52,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:55:52,228 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:55:52,229 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:55:52,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:55:52,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:55:52,235 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:55:52,236 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:55:52,238 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:55:52,239 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:55:52,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:55:52,245 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:55:52,246 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:55:52,247 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:55:52,248 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:55:52,248 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:55:52,251 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:55:52,253 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:55:52,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:55:52,255 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:55:52,255 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:55:52,256 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:55:52,262 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:55:52,263 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:55:52,264 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:55:52,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:55:52,266 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:55:52,266 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:55:52,267 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:55:52,268 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:55:52,269 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:55:52,269 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:55:52,270 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:55:52,272 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:55:52,273 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:55:52,273 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:55:52,273 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:55:52,274 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:55:52,275 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:55:52,275 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_419ef3eb-b2db-477c-83a0-e5be0330af8c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:55:52,289 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:55:52,298 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:55:52,299 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:55:52,300 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:55:52,300 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:55:52,300 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:55:52,300 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:55:52,300 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:55:52,300 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:55:52,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:55:52,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:55:52,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:55:52,301 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:55:52,301 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:55:52,301 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:55:52,302 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:55:52,302 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:55:52,302 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:55:52,302 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:55:52,302 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:55:52,302 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:55:52,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:55:52,303 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:55:52,303 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:55:52,303 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:55:52,303 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:55:52,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:55:52,304 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:55:52,304 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_419ef3eb-b2db-477c-83a0-e5be0330af8c/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 -> e002fb6463a65ebb6b75b40986db95c31112380a [2019-10-22 08:55:52,330 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:55:52,340 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:55:52,343 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:55:52,344 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:55:52,344 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:55:52,345 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_419ef3eb-b2db-477c-83a0-e5be0330af8c/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label26.c [2019-10-22 08:55:52,392 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_419ef3eb-b2db-477c-83a0-e5be0330af8c/bin/uautomizer/data/ffb1c5fc7/c04096c871ef4451a3fa7f522aaf6423/FLAG9aeb9f0ad [2019-10-22 08:55:52,855 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:55:52,855 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_419ef3eb-b2db-477c-83a0-e5be0330af8c/sv-benchmarks/c/eca-rers2012/Problem01_label26.c [2019-10-22 08:55:52,864 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_419ef3eb-b2db-477c-83a0-e5be0330af8c/bin/uautomizer/data/ffb1c5fc7/c04096c871ef4451a3fa7f522aaf6423/FLAG9aeb9f0ad [2019-10-22 08:55:53,368 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_419ef3eb-b2db-477c-83a0-e5be0330af8c/bin/uautomizer/data/ffb1c5fc7/c04096c871ef4451a3fa7f522aaf6423 [2019-10-22 08:55:53,371 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:55:53,372 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:55:53,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:53,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:55:53,376 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:55:53,377 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:53" (1/1) ... [2019-10-22 08:55:53,379 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a449db2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:53, skipping insertion in model container [2019-10-22 08:55:53,379 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:53" (1/1) ... [2019-10-22 08:55:53,386 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:55:53,436 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:55:53,804 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:53,819 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:55:53,919 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:53,934 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:55:53,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:53 WrapperNode [2019-10-22 08:55:53,935 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:53,936 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:53,936 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:55:53,936 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:55:53,944 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:53" (1/1) ... [2019-10-22 08:55:53,959 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:53" (1/1) ... [2019-10-22 08:55:54,008 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:54,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:55:54,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:55:54,016 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:55:54,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:53" (1/1) ... [2019-10-22 08:55:54,027 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:53" (1/1) ... [2019-10-22 08:55:54,030 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:53" (1/1) ... [2019-10-22 08:55:54,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:53" (1/1) ... [2019-10-22 08:55:54,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:53" (1/1) ... [2019-10-22 08:55:54,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:53" (1/1) ... [2019-10-22 08:55:54,085 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:53" (1/1) ... [2019-10-22 08:55:54,095 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:55:54,096 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:55:54,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:55:54,097 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:55:54,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_419ef3eb-b2db-477c-83a0-e5be0330af8c/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:55:54,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:55:54,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:55:55,469 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:55:55,470 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 08:55:55,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:55 BoogieIcfgContainer [2019-10-22 08:55:55,471 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:55:55,472 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:55:55,472 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:55:55,475 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:55:55,476 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:55:53" (1/3) ... [2019-10-22 08:55:55,476 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c5dfbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:55:55, skipping insertion in model container [2019-10-22 08:55:55,477 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:53" (2/3) ... [2019-10-22 08:55:55,477 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42c5dfbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:55:55, skipping insertion in model container [2019-10-22 08:55:55,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:55" (3/3) ... [2019-10-22 08:55:55,483 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label26.c [2019-10-22 08:55:55,492 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:55:55,500 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 08:55:55,511 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 08:55:55,540 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:55:55,546 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:55:55,547 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:55:55,547 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:55:55,547 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:55:55,548 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:55:55,548 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:55:55,548 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:55:55,570 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-10-22 08:55:55,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-22 08:55:55,582 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:55,583 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] [2019-10-22 08:55:55,585 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:55,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:55,592 INFO L82 PathProgramCache]: Analyzing trace with hash -583926962, now seen corresponding path program 1 times [2019-10-22 08:55:55,600 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:55,601 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317504561] [2019-10-22 08:55:55,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:55,601 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:55,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:55,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:56,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:56,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317504561] [2019-10-22 08:55:56,022 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:56,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:56,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38177835] [2019-10-22 08:55:56,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:55:56,028 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:56,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:56,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:56,043 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-10-22 08:55:57,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:57,190 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-10-22 08:55:57,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:55:57,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 103 [2019-10-22 08:55:57,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:57,209 INFO L225 Difference]: With dead ends: 662 [2019-10-22 08:55:57,213 INFO L226 Difference]: Without dead ends: 397 [2019-10-22 08:55:57,216 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:57,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-10-22 08:55:57,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2019-10-22 08:55:57,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-10-22 08:55:57,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 553 transitions. [2019-10-22 08:55:57,268 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 553 transitions. Word has length 103 [2019-10-22 08:55:57,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:57,269 INFO L462 AbstractCegarLoop]: Abstraction has 397 states and 553 transitions. [2019-10-22 08:55:57,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:55:57,269 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 553 transitions. [2019-10-22 08:55:57,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-22 08:55:57,272 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:57,273 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 08:55:57,273 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:57,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:57,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1625453403, now seen corresponding path program 1 times [2019-10-22 08:55:57,274 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:57,274 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730184033] [2019-10-22 08:55:57,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:57,274 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:57,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:57,409 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:57,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730184033] [2019-10-22 08:55:57,409 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:57,409 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:55:57,410 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289129040] [2019-10-22 08:55:57,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:55:57,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:57,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:57,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:57,416 INFO L87 Difference]: Start difference. First operand 397 states and 553 transitions. Second operand 4 states. [2019-10-22 08:55:58,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:58,098 INFO L93 Difference]: Finished difference Result 1447 states and 2019 transitions. [2019-10-22 08:55:58,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:55:58,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-10-22 08:55:58,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:58,103 INFO L225 Difference]: With dead ends: 1447 [2019-10-22 08:55:58,103 INFO L226 Difference]: Without dead ends: 1052 [2019-10-22 08:55:58,106 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:58,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-10-22 08:55:58,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 659. [2019-10-22 08:55:58,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-10-22 08:55:58,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 851 transitions. [2019-10-22 08:55:58,142 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 851 transitions. Word has length 110 [2019-10-22 08:55:58,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:58,143 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 851 transitions. [2019-10-22 08:55:58,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:55:58,143 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 851 transitions. [2019-10-22 08:55:58,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-22 08:55:58,148 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:58,148 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 08:55:58,148 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:58,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:58,149 INFO L82 PathProgramCache]: Analyzing trace with hash 733143454, now seen corresponding path program 1 times [2019-10-22 08:55:58,149 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:58,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134820947] [2019-10-22 08:55:58,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:58,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:58,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:58,214 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:58,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134820947] [2019-10-22 08:55:58,215 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:58,215 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:55:58,215 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202896916] [2019-10-22 08:55:58,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:55:58,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:58,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:58,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:58,216 INFO L87 Difference]: Start difference. First operand 659 states and 851 transitions. Second operand 4 states. [2019-10-22 08:55:58,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:58,799 INFO L93 Difference]: Finished difference Result 1578 states and 1998 transitions. [2019-10-22 08:55:58,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:55:58,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-10-22 08:55:58,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:58,802 INFO L225 Difference]: With dead ends: 1578 [2019-10-22 08:55:58,803 INFO L226 Difference]: Without dead ends: 790 [2019-10-22 08:55:58,804 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:58,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-10-22 08:55:58,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-10-22 08:55:58,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-10-22 08:55:58,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 930 transitions. [2019-10-22 08:55:58,827 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 930 transitions. Word has length 124 [2019-10-22 08:55:58,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:58,828 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 930 transitions. [2019-10-22 08:55:58,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:55:58,828 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 930 transitions. [2019-10-22 08:55:58,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-22 08:55:58,832 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:58,832 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:58,832 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:58,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:58,833 INFO L82 PathProgramCache]: Analyzing trace with hash 2001117315, now seen corresponding path program 1 times [2019-10-22 08:55:58,833 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:58,833 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274437878] [2019-10-22 08:55:58,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:58,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:58,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:58,911 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:58,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274437878] [2019-10-22 08:55:58,912 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:58,912 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:58,912 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271402873] [2019-10-22 08:55:58,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:58,915 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:58,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:58,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:58,916 INFO L87 Difference]: Start difference. First operand 790 states and 930 transitions. Second operand 3 states. [2019-10-22 08:55:59,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:59,357 INFO L93 Difference]: Finished difference Result 2233 states and 2643 transitions. [2019-10-22 08:55:59,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:59,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-10-22 08:55:59,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:59,362 INFO L225 Difference]: With dead ends: 2233 [2019-10-22 08:55:59,362 INFO L226 Difference]: Without dead ends: 1445 [2019-10-22 08:55:59,364 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:59,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-10-22 08:55:59,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1183. [2019-10-22 08:55:59,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1183 states. [2019-10-22 08:55:59,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1374 transitions. [2019-10-22 08:55:59,392 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1374 transitions. Word has length 125 [2019-10-22 08:55:59,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:59,393 INFO L462 AbstractCegarLoop]: Abstraction has 1183 states and 1374 transitions. [2019-10-22 08:55:59,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:59,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1374 transitions. [2019-10-22 08:55:59,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-22 08:55:59,397 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:59,397 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-22 08:55:59,398 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:59,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:59,398 INFO L82 PathProgramCache]: Analyzing trace with hash 891303243, now seen corresponding path program 1 times [2019-10-22 08:55:59,398 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:59,398 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922882145] [2019-10-22 08:55:59,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:59,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:59,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:59,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:59,442 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 08:55:59,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922882145] [2019-10-22 08:55:59,443 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:59,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:59,443 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291048397] [2019-10-22 08:55:59,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:59,444 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:59,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:59,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:59,444 INFO L87 Difference]: Start difference. First operand 1183 states and 1374 transitions. Second operand 3 states. [2019-10-22 08:55:59,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:59,826 INFO L93 Difference]: Finished difference Result 3150 states and 3674 transitions. [2019-10-22 08:55:59,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:59,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-10-22 08:55:59,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:59,839 INFO L225 Difference]: With dead ends: 3150 [2019-10-22 08:55:59,839 INFO L226 Difference]: Without dead ends: 1969 [2019-10-22 08:55:59,841 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:59,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-10-22 08:55:59,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1445. [2019-10-22 08:55:59,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-10-22 08:55:59,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1682 transitions. [2019-10-22 08:55:59,870 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1682 transitions. Word has length 129 [2019-10-22 08:55:59,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:59,870 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1682 transitions. [2019-10-22 08:55:59,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:59,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1682 transitions. [2019-10-22 08:55:59,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-22 08:55:59,872 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:59,873 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:59,873 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:59,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:59,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1514660785, now seen corresponding path program 1 times [2019-10-22 08:55:59,874 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:59,874 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598266725] [2019-10-22 08:55:59,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:59,874 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:59,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:59,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:59,916 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-22 08:55:59,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598266725] [2019-10-22 08:55:59,917 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:59,917 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:55:59,917 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408337374] [2019-10-22 08:55:59,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:59,918 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:59,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:59,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:59,918 INFO L87 Difference]: Start difference. First operand 1445 states and 1682 transitions. Second operand 3 states. [2019-10-22 08:56:00,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:00,271 INFO L93 Difference]: Finished difference Result 3019 states and 3514 transitions. [2019-10-22 08:56:00,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:00,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-10-22 08:56:00,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:00,276 INFO L225 Difference]: With dead ends: 3019 [2019-10-22 08:56:00,276 INFO L226 Difference]: Without dead ends: 1576 [2019-10-22 08:56:00,278 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:00,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-10-22 08:56:00,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445. [2019-10-22 08:56:00,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-10-22 08:56:00,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1682 transitions. [2019-10-22 08:56:00,304 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1682 transitions. Word has length 131 [2019-10-22 08:56:00,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:00,304 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1682 transitions. [2019-10-22 08:56:00,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:56:00,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1682 transitions. [2019-10-22 08:56:00,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-22 08:56:00,307 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:00,307 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:00,307 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:00,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:00,308 INFO L82 PathProgramCache]: Analyzing trace with hash 263294258, now seen corresponding path program 1 times [2019-10-22 08:56:00,308 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:00,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113071210] [2019-10-22 08:56:00,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:00,308 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:00,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:00,387 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:00,388 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113071210] [2019-10-22 08:56:00,388 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:00,389 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:56:00,389 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289514455] [2019-10-22 08:56:00,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:56:00,389 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:00,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:00,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:00,390 INFO L87 Difference]: Start difference. First operand 1445 states and 1682 transitions. Second operand 3 states. [2019-10-22 08:56:00,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:00,719 INFO L93 Difference]: Finished difference Result 3281 states and 3792 transitions. [2019-10-22 08:56:00,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:00,719 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-10-22 08:56:00,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:00,724 INFO L225 Difference]: With dead ends: 3281 [2019-10-22 08:56:00,724 INFO L226 Difference]: Without dead ends: 1838 [2019-10-22 08:56:00,726 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:00,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-10-22 08:56:00,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2019-10-22 08:56:00,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-10-22 08:56:00,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1965 transitions. [2019-10-22 08:56:00,755 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1965 transitions. Word has length 132 [2019-10-22 08:56:00,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:00,755 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1965 transitions. [2019-10-22 08:56:00,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:56:00,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1965 transitions. [2019-10-22 08:56:00,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-22 08:56:00,759 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:00,759 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:00,759 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:00,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:00,759 INFO L82 PathProgramCache]: Analyzing trace with hash 294946666, now seen corresponding path program 1 times [2019-10-22 08:56:00,760 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:00,760 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000838639] [2019-10-22 08:56:00,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:00,760 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:00,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:00,930 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000838639] [2019-10-22 08:56:00,930 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:00,931 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:56:00,931 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882642436] [2019-10-22 08:56:00,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 08:56:00,931 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:00,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 08:56:00,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:56:00,932 INFO L87 Difference]: Start difference. First operand 1707 states and 1965 transitions. Second operand 8 states. [2019-10-22 08:56:01,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:01,803 INFO L93 Difference]: Finished difference Result 3582 states and 4117 transitions. [2019-10-22 08:56:01,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:56:01,805 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 136 [2019-10-22 08:56:01,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:01,813 INFO L225 Difference]: With dead ends: 3582 [2019-10-22 08:56:01,813 INFO L226 Difference]: Without dead ends: 2008 [2019-10-22 08:56:01,815 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:56:01,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2019-10-22 08:56:01,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1707. [2019-10-22 08:56:01,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-10-22 08:56:01,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1953 transitions. [2019-10-22 08:56:01,847 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1953 transitions. Word has length 136 [2019-10-22 08:56:01,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:01,847 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1953 transitions. [2019-10-22 08:56:01,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 08:56:01,848 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1953 transitions. [2019-10-22 08:56:01,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-10-22 08:56:01,851 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:01,851 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-22 08:56:01,851 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:01,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:01,851 INFO L82 PathProgramCache]: Analyzing trace with hash 2118430365, now seen corresponding path program 1 times [2019-10-22 08:56:01,852 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:01,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595934288] [2019-10-22 08:56:01,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:01,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:01,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:01,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:01,958 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:01,958 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595934288] [2019-10-22 08:56:01,958 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:01,959 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:56:01,959 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295097524] [2019-10-22 08:56:01,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:56:01,960 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:01,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:01,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:01,961 INFO L87 Difference]: Start difference. First operand 1707 states and 1953 transitions. Second operand 3 states. [2019-10-22 08:56:02,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:02,326 INFO L93 Difference]: Finished difference Result 2102 states and 2422 transitions. [2019-10-22 08:56:02,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:02,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-10-22 08:56:02,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:02,336 INFO L225 Difference]: With dead ends: 2102 [2019-10-22 08:56:02,336 INFO L226 Difference]: Without dead ends: 2100 [2019-10-22 08:56:02,337 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:02,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-10-22 08:56:02,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1838. [2019-10-22 08:56:02,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-10-22 08:56:02,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2129 transitions. [2019-10-22 08:56:02,369 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2129 transitions. Word has length 162 [2019-10-22 08:56:02,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:02,369 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2129 transitions. [2019-10-22 08:56:02,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:56:02,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2129 transitions. [2019-10-22 08:56:02,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-22 08:56:02,374 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:02,374 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-10-22 08:56:02,374 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:02,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:02,379 INFO L82 PathProgramCache]: Analyzing trace with hash 172823534, now seen corresponding path program 1 times [2019-10-22 08:56:02,380 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:02,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490924394] [2019-10-22 08:56:02,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:02,380 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:02,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:02,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:02,429 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-10-22 08:56:02,429 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490924394] [2019-10-22 08:56:02,430 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:02,430 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:56:02,435 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36314778] [2019-10-22 08:56:02,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:56:02,436 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:02,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:02,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:02,436 INFO L87 Difference]: Start difference. First operand 1838 states and 2129 transitions. Second operand 3 states. [2019-10-22 08:56:02,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:02,704 INFO L93 Difference]: Finished difference Result 3674 states and 4254 transitions. [2019-10-22 08:56:02,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:02,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 167 [2019-10-22 08:56:02,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:02,710 INFO L225 Difference]: With dead ends: 3674 [2019-10-22 08:56:02,710 INFO L226 Difference]: Without dead ends: 1838 [2019-10-22 08:56:02,712 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:02,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-10-22 08:56:02,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-10-22 08:56:02,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-10-22 08:56:02,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2011 transitions. [2019-10-22 08:56:02,741 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2011 transitions. Word has length 167 [2019-10-22 08:56:02,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:02,742 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2011 transitions. [2019-10-22 08:56:02,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:56:02,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2011 transitions. [2019-10-22 08:56:02,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-10-22 08:56:02,745 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:02,746 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:02,746 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:02,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:02,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1369122589, now seen corresponding path program 1 times [2019-10-22 08:56:02,746 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:02,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779581805] [2019-10-22 08:56:02,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:02,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:02,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:02,861 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-10-22 08:56:02,861 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779581805] [2019-10-22 08:56:02,861 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:02,861 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:56:02,861 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120577694] [2019-10-22 08:56:02,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:56:02,862 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:02,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:02,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:02,862 INFO L87 Difference]: Start difference. First operand 1838 states and 2011 transitions. Second operand 3 states. [2019-10-22 08:56:03,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:03,117 INFO L93 Difference]: Finished difference Result 3674 states and 4020 transitions. [2019-10-22 08:56:03,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:03,117 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 197 [2019-10-22 08:56:03,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:03,120 INFO L225 Difference]: With dead ends: 3674 [2019-10-22 08:56:03,120 INFO L226 Difference]: Without dead ends: 1838 [2019-10-22 08:56:03,122 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:56:03,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-10-22 08:56:03,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707. [2019-10-22 08:56:03,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-10-22 08:56:03,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1855 transitions. [2019-10-22 08:56:03,145 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1855 transitions. Word has length 197 [2019-10-22 08:56:03,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:03,145 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1855 transitions. [2019-10-22 08:56:03,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:56:03,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1855 transitions. [2019-10-22 08:56:03,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-22 08:56:03,149 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:03,150 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2019-10-22 08:56:03,150 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:03,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:03,150 INFO L82 PathProgramCache]: Analyzing trace with hash 2102385007, now seen corresponding path program 1 times [2019-10-22 08:56:03,150 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:03,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50647633] [2019-10-22 08:56:03,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:03,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:03,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:03,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:03,314 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 181 proven. 93 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-22 08:56:03,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50647633] [2019-10-22 08:56:03,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322646541] [2019-10-22 08:56:03,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_419ef3eb-b2db-477c-83a0-e5be0330af8c/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 08:56:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:03,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:56:03,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:03,479 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-10-22 08:56:03,479 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-22 08:56:03,479 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-10-22 08:56:03,479 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508518889] [2019-10-22 08:56:03,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:56:03,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:03,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:56:03,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:56:03,480 INFO L87 Difference]: Start difference. First operand 1707 states and 1855 transitions. Second operand 3 states. [2019-10-22 08:56:03,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:03,813 INFO L93 Difference]: Finished difference Result 3410 states and 3720 transitions. [2019-10-22 08:56:03,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:03,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-10-22 08:56:03,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:03,814 INFO L225 Difference]: With dead ends: 3410 [2019-10-22 08:56:03,814 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:56:03,816 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 227 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:56:03,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:56:03,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:56:03,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:56:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:56:03,816 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 226 [2019-10-22 08:56:03,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:03,817 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:56:03,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:56:03,817 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:56:03,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:56:04,017 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-22 08:56:04,022 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 08:56:04,182 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-10-22 08:56:04,182 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-10-22 08:56:04,183 INFO L443 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,183 INFO L443 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,183 INFO L443 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,183 INFO L443 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,183 INFO L443 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,183 INFO L443 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,183 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-10-22 08:56:04,183 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-10-22 08:56:04,183 INFO L443 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-10-22 08:56:04,183 INFO L443 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-10-22 08:56:04,183 INFO L443 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-10-22 08:56:04,183 INFO L443 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-10-22 08:56:04,184 INFO L443 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-10-22 08:56:04,184 INFO L443 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-10-22 08:56:04,184 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-10-22 08:56:04,184 INFO L443 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-10-22 08:56:04,184 INFO L443 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,184 INFO L443 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,184 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,184 INFO L443 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,184 INFO L443 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,184 INFO L443 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,184 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-10-22 08:56:04,184 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-10-22 08:56:04,184 INFO L443 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-10-22 08:56:04,185 INFO L443 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-10-22 08:56:04,185 INFO L443 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-10-22 08:56:04,185 INFO L443 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-10-22 08:56:04,185 INFO L443 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-10-22 08:56:04,185 INFO L443 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-10-22 08:56:04,185 INFO L443 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-10-22 08:56:04,185 INFO L443 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-10-22 08:56:04,185 INFO L443 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-10-22 08:56:04,185 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-10-22 08:56:04,188 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-10-22 08:56:04,189 INFO L443 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-10-22 08:56:04,189 INFO L443 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-10-22 08:56:04,189 INFO L443 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,189 INFO L443 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,189 INFO L443 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,189 INFO L443 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,189 INFO L443 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,189 INFO L443 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-10-22 08:56:04,189 INFO L443 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-10-22 08:56:04,189 INFO L443 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-10-22 08:56:04,189 INFO L443 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-10-22 08:56:04,189 INFO L443 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-10-22 08:56:04,189 INFO L443 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-10-22 08:56:04,190 INFO L443 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-10-22 08:56:04,190 INFO L443 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-10-22 08:56:04,190 INFO L443 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-10-22 08:56:04,190 INFO L439 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (not (= 15 ~a8~0)) (and (not (= ~a7~0 1)) .cse0 (= ~a20~0 1)) (and .cse0 (<= ~a20~0 0)))) [2019-10-22 08:56:04,190 INFO L443 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,190 INFO L443 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,190 INFO L443 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,190 INFO L443 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,190 INFO L443 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,191 INFO L443 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-10-22 08:56:04,191 INFO L443 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-10-22 08:56:04,191 INFO L443 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-10-22 08:56:04,191 INFO L443 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-10-22 08:56:04,191 INFO L443 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-10-22 08:56:04,191 INFO L443 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-10-22 08:56:04,191 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-10-22 08:56:04,191 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-10-22 08:56:04,191 INFO L443 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-10-22 08:56:04,191 INFO L443 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-10-22 08:56:04,191 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 485) no Hoare annotation was computed. [2019-10-22 08:56:04,191 INFO L443 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-10-22 08:56:04,191 INFO L443 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-10-22 08:56:04,192 INFO L443 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-10-22 08:56:04,192 INFO L446 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-10-22 08:56:04,192 INFO L443 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,192 INFO L443 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,192 INFO L443 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,192 INFO L443 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,192 INFO L443 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,192 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-10-22 08:56:04,192 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-10-22 08:56:04,192 INFO L443 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-10-22 08:56:04,192 INFO L443 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-10-22 08:56:04,192 INFO L443 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-10-22 08:56:04,192 INFO L443 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-10-22 08:56:04,192 INFO L443 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-10-22 08:56:04,193 INFO L443 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-10-22 08:56:04,193 INFO L443 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-10-22 08:56:04,193 INFO L443 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,193 INFO L443 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,193 INFO L443 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,193 INFO L443 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,193 INFO L443 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-10-22 08:56:04,193 INFO L443 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,196 INFO L443 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-10-22 08:56:04,196 INFO L443 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-10-22 08:56:04,196 INFO L443 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-10-22 08:56:04,196 INFO L443 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-10-22 08:56:04,196 INFO L443 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-10-22 08:56:04,196 INFO L443 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-10-22 08:56:04,196 INFO L443 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-10-22 08:56:04,196 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 08:56:04,197 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-10-22 08:56:04,197 INFO L443 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-10-22 08:56:04,197 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-10-22 08:56:04,197 INFO L443 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-10-22 08:56:04,197 INFO L443 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-10-22 08:56:04,197 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-10-22 08:56:04,197 INFO L443 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,197 INFO L439 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (not (= 15 ~a8~0)) (and (not (= ~a7~0 1)) .cse0 (= ~a20~0 1)) (and .cse0 (<= ~a20~0 0)))) [2019-10-22 08:56:04,197 INFO L443 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,197 INFO L443 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,197 INFO L443 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,197 INFO L443 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,198 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-10-22 08:56:04,198 INFO L443 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-10-22 08:56:04,198 INFO L443 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-10-22 08:56:04,198 INFO L443 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-10-22 08:56:04,198 INFO L443 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-10-22 08:56:04,198 INFO L443 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-10-22 08:56:04,198 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-10-22 08:56:04,198 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-10-22 08:56:04,198 INFO L443 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,198 INFO L443 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,198 INFO L443 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,198 INFO L443 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,198 INFO L443 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,198 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-10-22 08:56:04,198 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 08:56:04,199 INFO L443 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-10-22 08:56:04,199 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-10-22 08:56:04,199 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-10-22 08:56:04,199 INFO L443 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-10-22 08:56:04,199 INFO L443 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-10-22 08:56:04,199 INFO L443 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-10-22 08:56:04,199 INFO L443 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-10-22 08:56:04,199 INFO L443 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-10-22 08:56:04,199 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-10-22 08:56:04,199 INFO L443 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-10-22 08:56:04,199 INFO L443 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-10-22 08:56:04,199 INFO L443 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,199 INFO L443 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,199 INFO L443 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,200 INFO L443 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,200 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-10-22 08:56:04,200 INFO L443 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,200 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,200 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-10-22 08:56:04,200 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-10-22 08:56:04,200 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 08:56:04,200 INFO L443 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-10-22 08:56:04,200 INFO L443 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-10-22 08:56:04,200 INFO L443 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-10-22 08:56:04,200 INFO L443 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-10-22 08:56:04,200 INFO L443 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-10-22 08:56:04,200 INFO L443 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-10-22 08:56:04,200 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-10-22 08:56:04,200 INFO L443 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-10-22 08:56:04,201 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-10-22 08:56:04,201 INFO L443 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-10-22 08:56:04,201 INFO L443 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,201 INFO L443 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,201 INFO L443 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,201 INFO L443 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,201 INFO L443 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,201 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-10-22 08:56:04,203 INFO L443 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,203 INFO L443 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-10-22 08:56:04,203 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-10-22 08:56:04,203 INFO L443 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-10-22 08:56:04,203 INFO L443 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-10-22 08:56:04,204 INFO L443 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-10-22 08:56:04,204 INFO L443 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-10-22 08:56:04,204 INFO L443 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-10-22 08:56:04,204 INFO L443 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-10-22 08:56:04,204 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-10-22 08:56:04,204 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-10-22 08:56:04,204 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-10-22 08:56:04,204 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 08:56:04,204 INFO L443 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-10-22 08:56:04,204 INFO L443 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-10-22 08:56:04,204 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-10-22 08:56:04,204 INFO L443 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,204 INFO L443 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,204 INFO L443 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,205 INFO L443 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,205 INFO L443 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,205 INFO L443 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-10-22 08:56:04,205 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-10-22 08:56:04,205 INFO L443 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-10-22 08:56:04,205 INFO L443 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-10-22 08:56:04,205 INFO L443 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-10-22 08:56:04,205 INFO L443 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-10-22 08:56:04,205 INFO L443 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-10-22 08:56:04,205 INFO L443 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-10-22 08:56:04,205 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-10-22 08:56:04,205 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-10-22 08:56:04,205 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-10-22 08:56:04,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:56:04 BoogieIcfgContainer [2019-10-22 08:56:04,228 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:56:04,228 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:56:04,228 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:56:04,229 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:56:04,229 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:55" (3/4) ... [2019-10-22 08:56:04,233 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 08:56:04,256 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 08:56:04,261 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-10-22 08:56:04,386 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_419ef3eb-b2db-477c-83a0-e5be0330af8c/bin/uautomizer/witness.graphml [2019-10-22 08:56:04,389 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:56:04,391 INFO L168 Benchmark]: Toolchain (without parser) took 11018.25 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 407.4 MB). Free memory was 939.1 MB in the beginning and 911.0 MB in the end (delta: 28.1 MB). Peak memory consumption was 435.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:04,391 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:04,392 INFO L168 Benchmark]: CACSL2BoogieTranslator took 562.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -135.0 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:04,392 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:04,393 INFO L168 Benchmark]: Boogie Preprocessor took 80.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:04,393 INFO L168 Benchmark]: RCFGBuilder took 1374.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 956.2 MB in the end (delta: 111.1 MB). Peak memory consumption was 111.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:04,394 INFO L168 Benchmark]: TraceAbstraction took 8756.08 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 294.6 MB). Free memory was 956.2 MB in the beginning and 927.4 MB in the end (delta: 28.8 MB). Peak memory consumption was 323.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:04,394 INFO L168 Benchmark]: Witness Printer took 160.45 ms. Allocated memory is still 1.4 GB. Free memory was 927.4 MB in the beginning and 911.0 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:04,395 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 562.43 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -135.0 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 80.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 80.23 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1374.83 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 956.2 MB in the end (delta: 111.1 MB). Peak memory consumption was 111.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8756.08 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 294.6 MB). Free memory was 956.2 MB in the beginning and 927.4 MB in the end (delta: 28.8 MB). Peak memory consumption was 323.4 MB. Max. memory is 11.5 GB. * Witness Printer took 160.45 ms. Allocated memory is still 1.4 GB. Free memory was 927.4 MB in the beginning and 911.0 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 485]: 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: (!(15 == a8) || ((!(a7 == 1) && a21 == 1) && a20 == 1)) || (a21 == 1 && a20 <= 0) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (!(15 == a8) || ((!(a7 == 1) && a21 == 1) && a20 == 1)) || (a21 == 1 && a20 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 8.6s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 775 SDtfs, 1975 SDslu, 106 SDs, 0 SdLazy, 5458 SolverSat, 856 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 270 GetRequests, 240 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1838occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 2135 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 40 NumberOfFragments, 47 HoareAnnotationTreeSize, 3 FomulaSimplifications, 20956 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1968 NumberOfCodeBlocks, 1968 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1955 ConstructedInterpolants, 0 QuantifiedInterpolants, 719614 SizeOfPredicates, 1 NumberOfNonLiveVariables, 432 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1058/1151 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...