./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label28.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_88152573-b5b4-4404-b3c1-5f5d19aae2be/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_88152573-b5b4-4404-b3c1-5f5d19aae2be/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_88152573-b5b4-4404-b3c1-5f5d19aae2be/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_88152573-b5b4-4404-b3c1-5f5d19aae2be/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label28.c -s /tmp/vcloud-vcloud-master/worker/run_dir_88152573-b5b4-4404-b3c1-5f5d19aae2be/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_88152573-b5b4-4404-b3c1-5f5d19aae2be/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 3b05d579dd12f755368a6bf22b0fd6149bd3ba2b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 23:54:23,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 23:54:23,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 23:54:23,237 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 23:54:23,238 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 23:54:23,239 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 23:54:23,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 23:54:23,251 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 23:54:23,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 23:54:23,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 23:54:23,261 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 23:54:23,263 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 23:54:23,263 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 23:54:23,265 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 23:54:23,266 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 23:54:23,267 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 23:54:23,268 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 23:54:23,269 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 23:54:23,272 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 23:54:23,276 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 23:54:23,281 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 23:54:23,283 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 23:54:23,286 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 23:54:23,287 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 23:54:23,289 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 23:54:23,289 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 23:54:23,290 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 23:54:23,291 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 23:54:23,292 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 23:54:23,293 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 23:54:23,293 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 23:54:23,293 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 23:54:23,294 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 23:54:23,295 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 23:54:23,296 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 23:54:23,296 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 23:54:23,297 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 23:54:23,297 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 23:54:23,297 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 23:54:23,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 23:54:23,299 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 23:54:23,300 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_88152573-b5b4-4404-b3c1-5f5d19aae2be/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 23:54:23,327 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 23:54:23,338 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 23:54:23,340 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 23:54:23,340 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 23:54:23,340 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 23:54:23,341 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 23:54:23,341 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 23:54:23,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 23:54:23,341 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 23:54:23,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 23:54:23,342 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 23:54:23,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 23:54:23,342 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 23:54:23,342 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 23:54:23,343 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 23:54:23,343 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 23:54:23,343 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 23:54:23,343 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 23:54:23,344 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 23:54:23,344 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 23:54:23,344 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 23:54:23,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 23:54:23,345 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 23:54:23,345 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 23:54:23,345 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 23:54:23,345 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 23:54:23,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 23:54:23,346 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 23:54:23,346 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_88152573-b5b4-4404-b3c1-5f5d19aae2be/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 -> 3b05d579dd12f755368a6bf22b0fd6149bd3ba2b [2019-11-19 23:54:23,543 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 23:54:23,560 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 23:54:23,563 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 23:54:23,565 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 23:54:23,565 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 23:54:23,567 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_88152573-b5b4-4404-b3c1-5f5d19aae2be/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label28.c [2019-11-19 23:54:23,636 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_88152573-b5b4-4404-b3c1-5f5d19aae2be/bin/uautomizer/data/e727083a3/ff01ef26c6d6436a9bbcc905b92a0332/FLAG8c5bb85ae [2019-11-19 23:54:24,270 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 23:54:24,272 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_88152573-b5b4-4404-b3c1-5f5d19aae2be/sv-benchmarks/c/eca-rers2012/Problem01_label28.c [2019-11-19 23:54:24,287 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_88152573-b5b4-4404-b3c1-5f5d19aae2be/bin/uautomizer/data/e727083a3/ff01ef26c6d6436a9bbcc905b92a0332/FLAG8c5bb85ae [2019-11-19 23:54:24,523 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_88152573-b5b4-4404-b3c1-5f5d19aae2be/bin/uautomizer/data/e727083a3/ff01ef26c6d6436a9bbcc905b92a0332 [2019-11-19 23:54:24,526 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 23:54:24,528 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 23:54:24,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 23:54:24,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 23:54:24,533 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 23:54:24,534 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:54:24" (1/1) ... [2019-11-19 23:54:24,536 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f85586a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:54:24, skipping insertion in model container [2019-11-19 23:54:24,537 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 11:54:24" (1/1) ... [2019-11-19 23:54:24,545 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 23:54:24,613 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 23:54:25,131 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:54:25,137 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 23:54:25,270 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 23:54:25,294 INFO L192 MainTranslator]: Completed translation [2019-11-19 23:54:25,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:54:25 WrapperNode [2019-11-19 23:54:25,296 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 23:54:25,297 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 23:54:25,297 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 23:54:25,297 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 23:54:25,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:54:25" (1/1) ... [2019-11-19 23:54:25,346 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:54:25" (1/1) ... [2019-11-19 23:54:25,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 23:54:25,438 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 23:54:25,438 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 23:54:25,438 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 23:54:25,448 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:54:25" (1/1) ... [2019-11-19 23:54:25,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:54:25" (1/1) ... [2019-11-19 23:54:25,455 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:54:25" (1/1) ... [2019-11-19 23:54:25,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:54:25" (1/1) ... [2019-11-19 23:54:25,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:54:25" (1/1) ... [2019-11-19 23:54:25,511 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:54:25" (1/1) ... [2019-11-19 23:54:25,515 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:54:25" (1/1) ... [2019-11-19 23:54:25,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 23:54:25,526 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 23:54:25,526 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 23:54:25,526 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 23:54:25,527 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:54:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_88152573-b5b4-4404-b3c1-5f5d19aae2be/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 23:54:25,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 23:54:25,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 23:54:26,913 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 23:54:26,913 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-19 23:54:26,915 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:54:26 BoogieIcfgContainer [2019-11-19 23:54:26,915 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 23:54:26,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 23:54:26,917 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 23:54:26,920 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 23:54:26,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 11:54:24" (1/3) ... [2019-11-19 23:54:26,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78dcc78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:54:26, skipping insertion in model container [2019-11-19 23:54:26,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 11:54:25" (2/3) ... [2019-11-19 23:54:26,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78dcc78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 11:54:26, skipping insertion in model container [2019-11-19 23:54:26,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:54:26" (3/3) ... [2019-11-19 23:54:26,925 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label28.c [2019-11-19 23:54:26,936 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 23:54:26,943 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-19 23:54:26,955 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-19 23:54:26,998 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 23:54:26,998 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 23:54:26,999 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 23:54:26,999 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 23:54:26,999 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 23:54:27,000 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 23:54:27,000 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 23:54:27,001 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 23:54:27,030 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-19 23:54:27,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-19 23:54:27,044 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:54:27,045 INFO L410 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] [2019-11-19 23:54:27,046 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:54:27,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:54:27,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1601987962, now seen corresponding path program 1 times [2019-11-19 23:54:27,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:54:27,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786857606] [2019-11-19 23:54:27,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:54:27,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:54:27,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:54:27,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786857606] [2019-11-19 23:54:27,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:54:27,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:54:27,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915598832] [2019-11-19 23:54:27,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:54:27,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:54:27,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:54:27,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:54:27,473 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2019-11-19 23:54:28,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:54:28,598 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2019-11-19 23:54:28,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:54:28,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-19 23:54:28,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:54:28,615 INFO L225 Difference]: With dead ends: 528 [2019-11-19 23:54:28,615 INFO L226 Difference]: Without dead ends: 266 [2019-11-19 23:54:28,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:54:28,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-19 23:54:28,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-11-19 23:54:28,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-19 23:54:28,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-11-19 23:54:28,693 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 93 [2019-11-19 23:54:28,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:54:28,694 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-11-19 23:54:28,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:54:28,694 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-11-19 23:54:28,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-19 23:54:28,700 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:54:28,700 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:54:28,701 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:54:28,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:54:28,701 INFO L82 PathProgramCache]: Analyzing trace with hash 1168423854, now seen corresponding path program 1 times [2019-11-19 23:54:28,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:54:28,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11749876] [2019-11-19 23:54:28,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:54:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:54:28,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:54:28,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11749876] [2019-11-19 23:54:28,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:54:28,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:54:28,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983190965] [2019-11-19 23:54:28,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:54:28,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:54:28,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:54:28,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:54:28,783 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-11-19 23:54:29,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:54:29,555 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2019-11-19 23:54:29,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:54:29,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-19 23:54:29,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:54:29,563 INFO L225 Difference]: With dead ends: 792 [2019-11-19 23:54:29,564 INFO L226 Difference]: Without dead ends: 528 [2019-11-19 23:54:29,566 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:54:29,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-19 23:54:29,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-11-19 23:54:29,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-19 23:54:29,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 721 transitions. [2019-11-19 23:54:29,643 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 721 transitions. Word has length 98 [2019-11-19 23:54:29,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:54:29,644 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 721 transitions. [2019-11-19 23:54:29,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:54:29,644 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 721 transitions. [2019-11-19 23:54:29,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-19 23:54:29,656 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:54:29,656 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:54:29,656 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:54:29,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:54:29,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1574089224, now seen corresponding path program 1 times [2019-11-19 23:54:29,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:54:29,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949575100] [2019-11-19 23:54:29,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:54:29,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:54:29,778 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:54:29,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949575100] [2019-11-19 23:54:29,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:54:29,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:54:29,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767555150] [2019-11-19 23:54:29,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:54:29,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:54:29,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:54:29,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:54:29,781 INFO L87 Difference]: Start difference. First operand 528 states and 721 transitions. Second operand 4 states. [2019-11-19 23:54:30,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:54:30,706 INFO L93 Difference]: Finished difference Result 2102 states and 2876 transitions. [2019-11-19 23:54:30,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:54:30,707 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-19 23:54:30,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:54:30,717 INFO L225 Difference]: With dead ends: 2102 [2019-11-19 23:54:30,717 INFO L226 Difference]: Without dead ends: 1576 [2019-11-19 23:54:30,720 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:54:30,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-11-19 23:54:30,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2019-11-19 23:54:30,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-19 23:54:30,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2045 transitions. [2019-11-19 23:54:30,761 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2045 transitions. Word has length 102 [2019-11-19 23:54:30,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:54:30,762 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 2045 transitions. [2019-11-19 23:54:30,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:54:30,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2045 transitions. [2019-11-19 23:54:30,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-19 23:54:30,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:54:30,784 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:54:30,784 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:54:30,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:54:30,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1573040001, now seen corresponding path program 1 times [2019-11-19 23:54:30,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:54:30,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975641363] [2019-11-19 23:54:30,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:54:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:54:30,878 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-19 23:54:30,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975641363] [2019-11-19 23:54:30,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:54:30,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:54:30,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140637499] [2019-11-19 23:54:30,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:54:30,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:54:30,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:54:30,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:54:30,881 INFO L87 Difference]: Start difference. First operand 1576 states and 2045 transitions. Second operand 3 states. [2019-11-19 23:54:31,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:54:31,452 INFO L93 Difference]: Finished difference Result 3412 states and 4452 transitions. [2019-11-19 23:54:31,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:54:31,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-19 23:54:31,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:54:31,464 INFO L225 Difference]: With dead ends: 3412 [2019-11-19 23:54:31,464 INFO L226 Difference]: Without dead ends: 1838 [2019-11-19 23:54:31,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:54:31,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-19 23:54:31,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1314. [2019-11-19 23:54:31,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-11-19 23:54:31,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1699 transitions. [2019-11-19 23:54:31,512 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1699 transitions. Word has length 105 [2019-11-19 23:54:31,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:54:31,512 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1699 transitions. [2019-11-19 23:54:31,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:54:31,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1699 transitions. [2019-11-19 23:54:31,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-19 23:54:31,515 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:54:31,516 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-19 23:54:31,516 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:54:31,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:54:31,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1954141031, now seen corresponding path program 1 times [2019-11-19 23:54:31,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:54:31,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182782114] [2019-11-19 23:54:31,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:54:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:54:31,674 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:54:31,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182782114] [2019-11-19 23:54:31,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:54:31,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:54:31,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880428719] [2019-11-19 23:54:31,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:54:31,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:54:31,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:54:31,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:54:31,679 INFO L87 Difference]: Start difference. First operand 1314 states and 1699 transitions. Second operand 4 states. [2019-11-19 23:54:32,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:54:32,425 INFO L93 Difference]: Finished difference Result 2762 states and 3550 transitions. [2019-11-19 23:54:32,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 23:54:32,426 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-19 23:54:32,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:54:32,435 INFO L225 Difference]: With dead ends: 2762 [2019-11-19 23:54:32,435 INFO L226 Difference]: Without dead ends: 1450 [2019-11-19 23:54:32,439 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:54:32,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-11-19 23:54:32,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1445. [2019-11-19 23:54:32,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-19 23:54:32,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1836 transitions. [2019-11-19 23:54:32,494 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1836 transitions. Word has length 108 [2019-11-19 23:54:32,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:54:32,495 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1836 transitions. [2019-11-19 23:54:32,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:54:32,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1836 transitions. [2019-11-19 23:54:32,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-19 23:54:32,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:54:32,498 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:54:32,498 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:54:32,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:54:32,498 INFO L82 PathProgramCache]: Analyzing trace with hash -376310369, now seen corresponding path program 1 times [2019-11-19 23:54:32,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:54:32,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808150905] [2019-11-19 23:54:32,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:54:32,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:54:32,610 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:54:32,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808150905] [2019-11-19 23:54:32,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:54:32,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:54:32,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811321842] [2019-11-19 23:54:32,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 23:54:32,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:54:32,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 23:54:32,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:54:32,614 INFO L87 Difference]: Start difference. First operand 1445 states and 1836 transitions. Second operand 5 states. [2019-11-19 23:54:33,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:54:33,599 INFO L93 Difference]: Finished difference Result 2757 states and 3533 transitions. [2019-11-19 23:54:33,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 23:54:33,600 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-11-19 23:54:33,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:54:33,608 INFO L225 Difference]: With dead ends: 2757 [2019-11-19 23:54:33,608 INFO L226 Difference]: Without dead ends: 1445 [2019-11-19 23:54:33,610 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-19 23:54:33,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-19 23:54:33,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-11-19 23:54:33,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-19 23:54:33,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1806 transitions. [2019-11-19 23:54:33,643 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1806 transitions. Word has length 112 [2019-11-19 23:54:33,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:54:33,644 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1806 transitions. [2019-11-19 23:54:33,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 23:54:33,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1806 transitions. [2019-11-19 23:54:33,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-19 23:54:33,647 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:54:33,647 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-19 23:54:33,647 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:54:33,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:54:33,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1702667398, now seen corresponding path program 1 times [2019-11-19 23:54:33,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:54:33,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133922652] [2019-11-19 23:54:33,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:54:33,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:54:33,692 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:54:33,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133922652] [2019-11-19 23:54:33,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:54:33,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:54:33,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273527379] [2019-11-19 23:54:33,693 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:54:33,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:54:33,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:54:33,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:54:33,694 INFO L87 Difference]: Start difference. First operand 1445 states and 1806 transitions. Second operand 3 states. [2019-11-19 23:54:34,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:54:34,103 INFO L93 Difference]: Finished difference Result 3150 states and 3956 transitions. [2019-11-19 23:54:34,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:54:34,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-11-19 23:54:34,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:54:34,113 INFO L225 Difference]: With dead ends: 3150 [2019-11-19 23:54:34,113 INFO L226 Difference]: Without dead ends: 1707 [2019-11-19 23:54:34,115 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:54:34,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-19 23:54:34,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1445. [2019-11-19 23:54:34,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-19 23:54:34,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1665 transitions. [2019-11-19 23:54:34,151 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1665 transitions. Word has length 115 [2019-11-19 23:54:34,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:54:34,152 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1665 transitions. [2019-11-19 23:54:34,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:54:34,152 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1665 transitions. [2019-11-19 23:54:34,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-19 23:54:34,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:54:34,156 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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] [2019-11-19 23:54:34,156 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:54:34,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:54:34,156 INFO L82 PathProgramCache]: Analyzing trace with hash 970685544, now seen corresponding path program 1 times [2019-11-19 23:54:34,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:54:34,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573576262] [2019-11-19 23:54:34,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:54:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:54:34,222 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-19 23:54:34,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573576262] [2019-11-19 23:54:34,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:54:34,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 23:54:34,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483227473] [2019-11-19 23:54:34,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:54:34,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:54:34,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:54:34,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:54:34,225 INFO L87 Difference]: Start difference. First operand 1445 states and 1665 transitions. Second operand 3 states. [2019-11-19 23:54:34,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:54:34,711 INFO L93 Difference]: Finished difference Result 2888 states and 3326 transitions. [2019-11-19 23:54:34,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:54:34,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-19 23:54:34,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:54:34,719 INFO L225 Difference]: With dead ends: 2888 [2019-11-19 23:54:34,720 INFO L226 Difference]: Without dead ends: 1445 [2019-11-19 23:54:34,722 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:54:34,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-19 23:54:34,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-11-19 23:54:34,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-19 23:54:34,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1593 transitions. [2019-11-19 23:54:34,758 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1593 transitions. Word has length 123 [2019-11-19 23:54:34,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:54:34,759 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1593 transitions. [2019-11-19 23:54:34,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:54:34,759 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1593 transitions. [2019-11-19 23:54:34,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-19 23:54:34,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:54:34,762 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:54:34,762 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:54:34,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:54:34,763 INFO L82 PathProgramCache]: Analyzing trace with hash 2027458046, now seen corresponding path program 1 times [2019-11-19 23:54:34,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:54:34,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977663782] [2019-11-19 23:54:34,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:54:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:54:35,553 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 23:54:35,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977663782] [2019-11-19 23:54:35,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:54:35,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-19 23:54:35,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594060871] [2019-11-19 23:54:35,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 23:54:35,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:54:35,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 23:54:35,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-11-19 23:54:35,555 INFO L87 Difference]: Start difference. First operand 1445 states and 1593 transitions. Second operand 12 states. [2019-11-19 23:54:36,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:54:36,964 INFO L93 Difference]: Finished difference Result 3260 states and 3653 transitions. [2019-11-19 23:54:36,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-19 23:54:36,965 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 130 [2019-11-19 23:54:36,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:54:36,975 INFO L225 Difference]: With dead ends: 3260 [2019-11-19 23:54:36,975 INFO L226 Difference]: Without dead ends: 1914 [2019-11-19 23:54:36,978 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2019-11-19 23:54:36,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2019-11-19 23:54:37,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1742. [2019-11-19 23:54:37,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2019-11-19 23:54:37,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 1908 transitions. [2019-11-19 23:54:37,015 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 1908 transitions. Word has length 130 [2019-11-19 23:54:37,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:54:37,017 INFO L462 AbstractCegarLoop]: Abstraction has 1742 states and 1908 transitions. [2019-11-19 23:54:37,017 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 23:54:37,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 1908 transitions. [2019-11-19 23:54:37,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-19 23:54:37,024 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:54:37,025 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 23:54:37,025 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:54:37,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:54:37,025 INFO L82 PathProgramCache]: Analyzing trace with hash 591091391, now seen corresponding path program 1 times [2019-11-19 23:54:37,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:54:37,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840962815] [2019-11-19 23:54:37,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:54:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:54:37,229 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-19 23:54:37,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840962815] [2019-11-19 23:54:37,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:54:37,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 23:54:37,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898614057] [2019-11-19 23:54:37,231 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 23:54:37,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:54:37,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 23:54:37,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:54:37,232 INFO L87 Difference]: Start difference. First operand 1742 states and 1908 transitions. Second operand 4 states. [2019-11-19 23:54:37,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:54:37,931 INFO L93 Difference]: Finished difference Result 3613 states and 3988 transitions. [2019-11-19 23:54:37,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 23:54:37,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2019-11-19 23:54:37,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:54:37,945 INFO L225 Difference]: With dead ends: 3613 [2019-11-19 23:54:37,945 INFO L226 Difference]: Without dead ends: 1873 [2019-11-19 23:54:37,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-19 23:54:37,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2019-11-19 23:54:37,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1742. [2019-11-19 23:54:37,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2019-11-19 23:54:37,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 1878 transitions. [2019-11-19 23:54:37,981 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 1878 transitions. Word has length 200 [2019-11-19 23:54:37,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:54:37,982 INFO L462 AbstractCegarLoop]: Abstraction has 1742 states and 1878 transitions. [2019-11-19 23:54:37,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 23:54:37,982 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 1878 transitions. [2019-11-19 23:54:37,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-19 23:54:37,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:54:37,987 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-19 23:54:37,988 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:54:37,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:54:37,988 INFO L82 PathProgramCache]: Analyzing trace with hash 490719990, now seen corresponding path program 1 times [2019-11-19 23:54:37,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:54:37,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674057724] [2019-11-19 23:54:37,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:54:38,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:54:38,143 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-19 23:54:38,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674057724] [2019-11-19 23:54:38,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 23:54:38,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 23:54:38,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711994486] [2019-11-19 23:54:38,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:54:38,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:54:38,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:54:38,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:54:38,146 INFO L87 Difference]: Start difference. First operand 1742 states and 1878 transitions. Second operand 3 states. [2019-11-19 23:54:38,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:54:38,562 INFO L93 Difference]: Finished difference Result 1744 states and 1879 transitions. [2019-11-19 23:54:38,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:54:38,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-11-19 23:54:38,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:54:38,573 INFO L225 Difference]: With dead ends: 1744 [2019-11-19 23:54:38,573 INFO L226 Difference]: Without dead ends: 1742 [2019-11-19 23:54:38,574 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 23:54:38,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2019-11-19 23:54:38,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1742. [2019-11-19 23:54:38,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2019-11-19 23:54:38,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 1877 transitions. [2019-11-19 23:54:38,606 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 1877 transitions. Word has length 208 [2019-11-19 23:54:38,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:54:38,607 INFO L462 AbstractCegarLoop]: Abstraction has 1742 states and 1877 transitions. [2019-11-19 23:54:38,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:54:38,608 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 1877 transitions. [2019-11-19 23:54:38,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-11-19 23:54:38,614 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 23:54:38,615 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-19 23:54:38,615 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 23:54:38,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 23:54:38,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1524272564, now seen corresponding path program 1 times [2019-11-19 23:54:38,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 23:54:38,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568401763] [2019-11-19 23:54:38,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 23:54:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:54:39,740 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 351 proven. 8 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-19 23:54:39,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568401763] [2019-11-19 23:54:39,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2144307673] [2019-11-19 23:54:39,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_88152573-b5b4-4404-b3c1-5f5d19aae2be/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:54:39,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 23:54:39,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 23:54:39,919 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 23:54:40,051 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-11-19 23:54:40,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 23:54:40,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2019-11-19 23:54:40,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518203803] [2019-11-19 23:54:40,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 23:54:40,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 23:54:40,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 23:54:40,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-11-19 23:54:40,054 INFO L87 Difference]: Start difference. First operand 1742 states and 1877 transitions. Second operand 3 states. [2019-11-19 23:54:40,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 23:54:40,469 INFO L93 Difference]: Finished difference Result 1742 states and 1877 transitions. [2019-11-19 23:54:40,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 23:54:40,469 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2019-11-19 23:54:40,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 23:54:40,470 INFO L225 Difference]: With dead ends: 1742 [2019-11-19 23:54:40,470 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 23:54:40,472 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 287 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-11-19 23:54:40,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 23:54:40,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 23:54:40,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 23:54:40,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 23:54:40,473 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 283 [2019-11-19 23:54:40,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 23:54:40,473 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 23:54:40,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 23:54:40,473 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 23:54:40,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 23:54:40,678 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 23:54:40,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 23:54:40,936 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-11-19 23:54:41,118 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2019-11-19 23:54:41,121 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-19 23:54:41,122 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-19 23:54:41,122 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,122 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,122 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,122 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,122 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,122 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,122 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-19 23:54:41,122 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-19 23:54:41,123 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-19 23:54:41,123 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-19 23:54:41,123 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-19 23:54:41,123 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-19 23:54:41,123 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-19 23:54:41,123 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-19 23:54:41,123 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-19 23:54:41,123 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-19 23:54:41,123 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,123 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,123 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,124 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,124 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,124 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,124 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-19 23:54:41,124 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-19 23:54:41,124 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-19 23:54:41,124 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-19 23:54:41,124 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-19 23:54:41,124 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-19 23:54:41,125 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-19 23:54:41,125 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-19 23:54:41,125 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-19 23:54:41,125 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-19 23:54:41,125 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-19 23:54:41,125 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-19 23:54:41,126 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-19 23:54:41,126 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-19 23:54:41,126 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-19 23:54:41,126 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,126 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,126 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,127 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,127 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,127 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-19 23:54:41,127 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-19 23:54:41,127 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-19 23:54:41,127 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-19 23:54:41,128 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-19 23:54:41,128 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-19 23:54:41,128 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-19 23:54:41,128 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-19 23:54:41,128 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-19 23:54:41,129 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse2 (= ~a7~0 1))) (let ((.cse0 (<= ~a21~0 0)) (.cse1 (not (= ~a16~0 6))) (.cse4 (= ~a17~0 1)) (.cse3 (not .cse2)) (.cse6 (= ~a16~0 4)) (.cse5 (= ~a21~0 1))) (or (and (= 1 ~a7~0) .cse0 .cse1) (and .cse0 .cse2 (= ~a12~0 8) (= ~a20~0 1)) (and .cse3 .cse4 .cse5) (and .cse5 (= 5 ~a16~0)) (and .cse3 .cse5 (= 15 ~a8~0)) (and .cse1 .cse4 .cse5) (and .cse6 (<= ~a17~0 0) .cse5) (and .cse3 .cse6 .cse5)))) [2019-11-19 23:54:41,129 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,129 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,129 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,129 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,130 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,130 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-19 23:54:41,130 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-19 23:54:41,130 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-19 23:54:41,130 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-19 23:54:41,130 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-19 23:54:41,131 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-19 23:54:41,131 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-19 23:54:41,131 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-19 23:54:41,131 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-19 23:54:41,131 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-19 23:54:41,131 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-19 23:54:41,132 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-19 23:54:41,132 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-19 23:54:41,132 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-19 23:54:41,132 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,132 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,132 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,133 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,133 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,133 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-19 23:54:41,133 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-19 23:54:41,133 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-19 23:54:41,133 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-19 23:54:41,134 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-19 23:54:41,134 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-19 23:54:41,134 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-19 23:54:41,134 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-19 23:54:41,134 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-19 23:54:41,134 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,135 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,135 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,135 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,135 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-19 23:54:41,135 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,135 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-19 23:54:41,135 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-19 23:54:41,136 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-19 23:54:41,136 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-19 23:54:41,136 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-19 23:54:41,136 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-19 23:54:41,136 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-19 23:54:41,136 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 23:54:41,137 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-19 23:54:41,137 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-19 23:54:41,137 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-19 23:54:41,137 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-19 23:54:41,137 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-19 23:54:41,137 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-19 23:54:41,138 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,138 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse2 (= ~a7~0 1))) (let ((.cse0 (<= ~a21~0 0)) (.cse1 (not (= ~a16~0 6))) (.cse4 (= ~a17~0 1)) (.cse3 (not .cse2)) (.cse6 (= ~a16~0 4)) (.cse5 (= ~a21~0 1))) (or (and (= 1 ~a7~0) .cse0 .cse1) (and .cse0 .cse2 (= ~a12~0 8) (= ~a20~0 1)) (and .cse3 .cse4 .cse5) (and .cse5 (= 5 ~a16~0)) (and .cse3 .cse5 (= 15 ~a8~0)) (and .cse1 .cse4 .cse5) (and .cse6 (<= ~a17~0 0) .cse5) (and .cse3 .cse6 .cse5)))) [2019-11-19 23:54:41,138 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,138 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,138 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,139 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,139 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-19 23:54:41,139 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-19 23:54:41,139 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-19 23:54:41,139 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-19 23:54:41,139 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-19 23:54:41,139 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-19 23:54:41,139 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-19 23:54:41,140 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-19 23:54:41,140 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,140 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,140 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,140 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,140 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,141 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-19 23:54:41,141 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 23:54:41,141 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-19 23:54:41,141 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-19 23:54:41,141 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-19 23:54:41,141 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-19 23:54:41,141 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-19 23:54:41,141 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-19 23:54:41,142 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-19 23:54:41,142 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-19 23:54:41,142 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-19 23:54:41,142 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-19 23:54:41,142 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-19 23:54:41,142 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,143 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,143 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,143 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,143 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-19 23:54:41,143 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,143 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,144 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-19 23:54:41,144 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-19 23:54:41,144 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 23:54:41,144 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-19 23:54:41,144 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-19 23:54:41,144 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-19 23:54:41,145 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-19 23:54:41,145 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-19 23:54:41,145 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-19 23:54:41,145 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-19 23:54:41,145 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-19 23:54:41,145 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-19 23:54:41,146 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-19 23:54:41,146 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,146 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,146 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,146 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,146 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,146 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-19 23:54:41,147 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,147 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-19 23:54:41,147 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-19 23:54:41,147 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-19 23:54:41,147 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-19 23:54:41,147 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-19 23:54:41,148 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-19 23:54:41,148 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-19 23:54:41,148 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-19 23:54:41,148 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-19 23:54:41,148 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-19 23:54:41,148 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-19 23:54:41,149 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 23:54:41,149 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 455) no Hoare annotation was computed. [2019-11-19 23:54:41,149 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-19 23:54:41,149 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-19 23:54:41,149 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-19 23:54:41,150 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,150 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,150 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,150 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,150 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,150 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-19 23:54:41,150 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-19 23:54:41,151 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-19 23:54:41,151 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-19 23:54:41,151 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-19 23:54:41,151 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-19 23:54:41,151 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-19 23:54:41,151 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-19 23:54:41,152 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-19 23:54:41,152 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-19 23:54:41,152 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-19 23:54:41,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 11:54:41 BoogieIcfgContainer [2019-11-19 23:54:41,194 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 23:54:41,195 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 23:54:41,195 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 23:54:41,196 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 23:54:41,196 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 11:54:26" (3/4) ... [2019-11-19 23:54:41,200 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 23:54:41,222 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-19 23:54:41,224 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-19 23:54:41,390 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_88152573-b5b4-4404-b3c1-5f5d19aae2be/bin/uautomizer/witness.graphml [2019-11-19 23:54:41,390 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 23:54:41,391 INFO L168 Benchmark]: Toolchain (without parser) took 16863.98 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 419.4 MB). Free memory was 944.8 MB in the beginning and 977.4 MB in the end (delta: -32.6 MB). Peak memory consumption was 386.8 MB. Max. memory is 11.5 GB. [2019-11-19 23:54:41,392 INFO L168 Benchmark]: CDTParser took 1.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:54:41,392 INFO L168 Benchmark]: CACSL2BoogieTranslator took 767.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-19 23:54:41,393 INFO L168 Benchmark]: Boogie Procedure Inliner took 140.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-19 23:54:41,393 INFO L168 Benchmark]: Boogie Preprocessor took 87.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 23:54:41,394 INFO L168 Benchmark]: RCFGBuilder took 1389.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 993.6 MB in the end (delta: 115.3 MB). Peak memory consumption was 115.3 MB. Max. memory is 11.5 GB. [2019-11-19 23:54:41,394 INFO L168 Benchmark]: TraceAbstraction took 14277.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 273.2 MB). Free memory was 993.6 MB in the beginning and 1.0 GB in the end (delta: -11.2 MB). Peak memory consumption was 261.9 MB. Max. memory is 11.5 GB. [2019-11-19 23:54:41,395 INFO L168 Benchmark]: Witness Printer took 194.88 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 977.4 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2019-11-19 23:54:41,397 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 767.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -170.9 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 140.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 87.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1389.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 993.6 MB in the end (delta: 115.3 MB). Peak memory consumption was 115.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14277.51 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 273.2 MB). Free memory was 993.6 MB in the beginning and 1.0 GB in the end (delta: -11.2 MB). Peak memory consumption was 261.9 MB. Max. memory is 11.5 GB. * Witness Printer took 194.88 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 977.4 MB in the end (delta: 27.4 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 455]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((1 == a7 && a21 <= 0) && !(a16 == 6)) || (((a21 <= 0 && a7 == 1) && a12 == 8) && a20 == 1)) || ((!(a7 == 1) && a17 == 1) && a21 == 1)) || (a21 == 1 && 5 == a16)) || ((!(a7 == 1) && a21 == 1) && 15 == a8)) || ((!(a16 == 6) && a17 == 1) && a21 == 1)) || ((a16 == 4 && a17 <= 0) && a21 == 1)) || ((!(a7 == 1) && a16 == 4) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((1 == a7 && a21 <= 0) && !(a16 == 6)) || (((a21 <= 0 && a7 == 1) && a12 == 8) && a20 == 1)) || ((!(a7 == 1) && a17 == 1) && a21 == 1)) || (a21 == 1 && 5 == a16)) || ((!(a7 == 1) && a21 == 1) && 15 == a8)) || ((!(a16 == 6) && a17 == 1) && a21 == 1)) || ((a16 == 4 && a17 <= 0) && a21 == 1)) || ((!(a7 == 1) && a16 == 4) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 14.1s, OverallIterations: 12, TraceHistogramMax: 7, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 887 SDtfs, 2590 SDslu, 128 SDs, 0 SdLazy, 5907 SolverSat, 779 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 306 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1742occurred 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.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 1094 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 39 NumberOfFragments, 173 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1550 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 120 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1960 NumberOfCodeBlocks, 1960 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1947 ConstructedInterpolants, 0 QuantifiedInterpolants, 1696138 SizeOfPredicates, 1 NumberOfNonLiveVariables, 514 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1511/1519 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...