./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label02.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_6c989d37-9a93-492d-85b3-7647db718798/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6c989d37-9a93-492d-85b3-7647db718798/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6c989d37-9a93-492d-85b3-7647db718798/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6c989d37-9a93-492d-85b3-7647db718798/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label02.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6c989d37-9a93-492d-85b3-7647db718798/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6c989d37-9a93-492d-85b3-7647db718798/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 addc9e4e4fc897318cfe4d26c9760729a73864e1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 00:13:44,482 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:13:44,484 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:13:44,498 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:13:44,499 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:13:44,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:13:44,501 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:13:44,510 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:13:44,514 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:13:44,518 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:13:44,519 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:13:44,520 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:13:44,521 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:13:44,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:13:44,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:13:44,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:13:44,526 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:13:44,526 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:13:44,529 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:13:44,532 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:13:44,536 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:13:44,538 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:13:44,540 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:13:44,541 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:13:44,544 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:13:44,544 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:13:44,544 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:13:44,546 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:13:44,546 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:13:44,547 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:13:44,547 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:13:44,548 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:13:44,548 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:13:44,549 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:13:44,550 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:13:44,550 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:13:44,551 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:13:44,551 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:13:44,551 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:13:44,552 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:13:44,553 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:13:44,554 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6c989d37-9a93-492d-85b3-7647db718798/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 00:13:44,578 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:13:44,588 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:13:44,589 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:13:44,589 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:13:44,589 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:13:44,589 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:13:44,590 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:13:44,590 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:13:44,590 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:13:44,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:13:44,590 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:13:44,591 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:13:44,591 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:13:44,591 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:13:44,591 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:13:44,591 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:13:44,592 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:13:44,592 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:13:44,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:13:44,593 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:13:44,593 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 00:13:44,594 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:13:44,594 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:13:44,594 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:13:44,594 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:13:44,595 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 00:13:44,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 00:13:44,595 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:13:44,595 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_6c989d37-9a93-492d-85b3-7647db718798/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 -> addc9e4e4fc897318cfe4d26c9760729a73864e1 [2019-11-20 00:13:44,760 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:13:44,770 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:13:44,773 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:13:44,774 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:13:44,774 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:13:44,775 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6c989d37-9a93-492d-85b3-7647db718798/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label02.c [2019-11-20 00:13:44,823 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6c989d37-9a93-492d-85b3-7647db718798/bin/uautomizer/data/487d9bade/1b84a3c40514423dbd11317998513c94/FLAGf918285f9 [2019-11-20 00:13:45,308 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:13:45,309 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6c989d37-9a93-492d-85b3-7647db718798/sv-benchmarks/c/eca-rers2012/Problem01_label02.c [2019-11-20 00:13:45,321 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6c989d37-9a93-492d-85b3-7647db718798/bin/uautomizer/data/487d9bade/1b84a3c40514423dbd11317998513c94/FLAGf918285f9 [2019-11-20 00:13:45,607 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6c989d37-9a93-492d-85b3-7647db718798/bin/uautomizer/data/487d9bade/1b84a3c40514423dbd11317998513c94 [2019-11-20 00:13:45,609 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:13:45,610 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:13:45,611 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:13:45,611 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:13:45,614 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:13:45,615 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:13:45" (1/1) ... [2019-11-20 00:13:45,617 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a990b99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:13:45, skipping insertion in model container [2019-11-20 00:13:45,617 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:13:45" (1/1) ... [2019-11-20 00:13:45,624 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:13:45,683 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:13:46,120 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:13:46,125 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:13:46,244 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:13:46,258 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:13:46,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:13:46 WrapperNode [2019-11-20 00:13:46,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:13:46,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:13:46,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:13:46,259 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:13:46,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:13:46" (1/1) ... [2019-11-20 00:13:46,285 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:13:46" (1/1) ... [2019-11-20 00:13:46,342 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:13:46,343 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:13:46,343 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:13:46,343 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:13:46,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:13:46" (1/1) ... [2019-11-20 00:13:46,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:13:46" (1/1) ... [2019-11-20 00:13:46,356 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:13:46" (1/1) ... [2019-11-20 00:13:46,356 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:13:46" (1/1) ... [2019-11-20 00:13:46,376 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:13:46" (1/1) ... [2019-11-20 00:13:46,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:13:46" (1/1) ... [2019-11-20 00:13:46,392 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:13:46" (1/1) ... [2019-11-20 00:13:46,400 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:13:46,401 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:13:46,401 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:13:46,401 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:13:46,402 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:13:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c989d37-9a93-492d-85b3-7647db718798/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-20 00:13:46,465 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:13:46,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:13:47,603 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:13:47,603 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 00:13:47,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:13:47 BoogieIcfgContainer [2019-11-20 00:13:47,604 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:13:47,605 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 00:13:47,605 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 00:13:47,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 00:13:47,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:13:45" (1/3) ... [2019-11-20 00:13:47,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a529526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:13:47, skipping insertion in model container [2019-11-20 00:13:47,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:13:46" (2/3) ... [2019-11-20 00:13:47,613 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a529526 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:13:47, skipping insertion in model container [2019-11-20 00:13:47,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:13:47" (3/3) ... [2019-11-20 00:13:47,615 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label02.c [2019-11-20 00:13:47,623 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 00:13:47,631 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 00:13:47,641 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 00:13:47,672 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 00:13:47,672 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 00:13:47,673 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 00:13:47,673 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:13:47,673 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:13:47,673 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 00:13:47,673 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:13:47,673 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 00:13:47,691 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-20 00:13:47,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-20 00:13:47,703 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:13:47,704 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] [2019-11-20 00:13:47,704 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:13:47,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:13:47,710 INFO L82 PathProgramCache]: Analyzing trace with hash -776841673, now seen corresponding path program 1 times [2019-11-20 00:13:47,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:13:47,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145115701] [2019-11-20 00:13:47,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:13:47,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:13:48,130 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-20 00:13:48,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145115701] [2019-11-20 00:13:48,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:13:48,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:13:48,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362971562] [2019-11-20 00:13:48,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:13:48,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:13:48,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:13:48,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:13:48,156 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-20 00:13:49,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:13:49,642 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-11-20 00:13:49,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:13:49,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-11-20 00:13:49,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:13:49,667 INFO L225 Difference]: With dead ends: 662 [2019-11-20 00:13:49,667 INFO L226 Difference]: Without dead ends: 397 [2019-11-20 00:13:49,674 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:13:49,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-20 00:13:49,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2019-11-20 00:13:49,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-20 00:13:49,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-11-20 00:13:49,747 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 90 [2019-11-20 00:13:49,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:13:49,748 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-11-20 00:13:49,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:13:49,749 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-11-20 00:13:49,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-20 00:13:49,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:13:49,758 INFO L410 BasicCegarLoop]: trace histogram [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-20 00:13:49,758 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:13:49,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:13:49,759 INFO L82 PathProgramCache]: Analyzing trace with hash 904352266, now seen corresponding path program 1 times [2019-11-20 00:13:49,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:13:49,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438761568] [2019-11-20 00:13:49,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:13:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:13:49,848 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:13:49,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438761568] [2019-11-20 00:13:49,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:13:49,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:13:49,849 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104017794] [2019-11-20 00:13:49,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:13:49,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:13:49,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:13:49,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:13:49,851 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-11-20 00:13:50,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:13:50,637 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2019-11-20 00:13:50,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:13:50,638 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-11-20 00:13:50,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:13:50,642 INFO L225 Difference]: With dead ends: 1054 [2019-11-20 00:13:50,642 INFO L226 Difference]: Without dead ends: 790 [2019-11-20 00:13:50,643 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-20 00:13:50,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-20 00:13:50,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-20 00:13:50,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-20 00:13:50,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1067 transitions. [2019-11-20 00:13:50,676 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1067 transitions. Word has length 96 [2019-11-20 00:13:50,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:13:50,677 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1067 transitions. [2019-11-20 00:13:50,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:13:50,677 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1067 transitions. [2019-11-20 00:13:50,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 00:13:50,680 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:13:50,680 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:13:50,680 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:13:50,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:13:50,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1983827210, now seen corresponding path program 1 times [2019-11-20 00:13:50,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:13:50,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865621886] [2019-11-20 00:13:50,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:13:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:13:50,843 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:13:50,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865621886] [2019-11-20 00:13:50,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:13:50,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:13:50,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653912752] [2019-11-20 00:13:50,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:13:50,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:13:50,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:13:50,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:13:50,845 INFO L87 Difference]: Start difference. First operand 790 states and 1067 transitions. Second operand 3 states. [2019-11-20 00:13:51,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:13:51,297 INFO L93 Difference]: Finished difference Result 2233 states and 3029 transitions. [2019-11-20 00:13:51,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:13:51,297 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-20 00:13:51,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:13:51,305 INFO L225 Difference]: With dead ends: 2233 [2019-11-20 00:13:51,306 INFO L226 Difference]: Without dead ends: 1445 [2019-11-20 00:13:51,307 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-20 00:13:51,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-20 00:13:51,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-11-20 00:13:51,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-20 00:13:51,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1878 transitions. [2019-11-20 00:13:51,341 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1878 transitions. Word has length 97 [2019-11-20 00:13:51,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:13:51,342 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1878 transitions. [2019-11-20 00:13:51,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:13:51,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1878 transitions. [2019-11-20 00:13:51,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-20 00:13:51,355 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:13:51,356 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-20 00:13:51,356 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:13:51,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:13:51,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1892128057, now seen corresponding path program 1 times [2019-11-20 00:13:51,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:13:51,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763406102] [2019-11-20 00:13:51,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:13:51,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:13:51,441 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-20 00:13:51,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763406102] [2019-11-20 00:13:51,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:13:51,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:13:51,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108302352] [2019-11-20 00:13:51,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:13:51,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:13:51,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:13:51,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:13:51,446 INFO L87 Difference]: Start difference. First operand 1445 states and 1878 transitions. Second operand 3 states. [2019-11-20 00:13:51,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:13:51,995 INFO L93 Difference]: Finished difference Result 3150 states and 4119 transitions. [2019-11-20 00:13:51,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:13:51,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-11-20 00:13:51,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:13:52,005 INFO L225 Difference]: With dead ends: 3150 [2019-11-20 00:13:52,005 INFO L226 Difference]: Without dead ends: 1707 [2019-11-20 00:13:52,008 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-20 00:13:52,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-20 00:13:52,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1445. [2019-11-20 00:13:52,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-20 00:13:52,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1873 transitions. [2019-11-20 00:13:52,049 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1873 transitions. Word has length 116 [2019-11-20 00:13:52,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:13:52,049 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1873 transitions. [2019-11-20 00:13:52,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:13:52,050 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1873 transitions. [2019-11-20 00:13:52,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-20 00:13:52,052 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:13:52,053 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:13:52,053 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:13:52,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:13:52,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1006771335, now seen corresponding path program 1 times [2019-11-20 00:13:52,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:13:52,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606680530] [2019-11-20 00:13:52,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:13:52,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:13:52,146 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-20 00:13:52,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606680530] [2019-11-20 00:13:52,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:13:52,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:13:52,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254792841] [2019-11-20 00:13:52,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:13:52,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:13:52,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:13:52,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:13:52,149 INFO L87 Difference]: Start difference. First operand 1445 states and 1873 transitions. Second operand 3 states. [2019-11-20 00:13:52,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:13:52,751 INFO L93 Difference]: Finished difference Result 3805 states and 4890 transitions. [2019-11-20 00:13:52,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:13:52,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-11-20 00:13:52,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:13:52,763 INFO L225 Difference]: With dead ends: 3805 [2019-11-20 00:13:52,763 INFO L226 Difference]: Without dead ends: 2362 [2019-11-20 00:13:52,767 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-20 00:13:52,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2019-11-20 00:13:52,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1838. [2019-11-20 00:13:52,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-20 00:13:52,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2315 transitions. [2019-11-20 00:13:52,811 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2315 transitions. Word has length 133 [2019-11-20 00:13:52,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:13:52,811 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2315 transitions. [2019-11-20 00:13:52,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:13:52,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2315 transitions. [2019-11-20 00:13:52,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-20 00:13:52,815 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:13:52,815 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:13:52,816 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:13:52,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:13:52,816 INFO L82 PathProgramCache]: Analyzing trace with hash 546693328, now seen corresponding path program 1 times [2019-11-20 00:13:52,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:13:52,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645047784] [2019-11-20 00:13:52,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:13:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:13:52,891 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-20 00:13:52,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645047784] [2019-11-20 00:13:52,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:13:52,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:13:52,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426264657] [2019-11-20 00:13:52,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:13:52,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:13:52,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:13:52,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:13:52,894 INFO L87 Difference]: Start difference. First operand 1838 states and 2315 transitions. Second operand 3 states. [2019-11-20 00:13:53,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:13:53,358 INFO L93 Difference]: Finished difference Result 3936 states and 4944 transitions. [2019-11-20 00:13:53,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:13:53,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-20 00:13:53,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:13:53,369 INFO L225 Difference]: With dead ends: 3936 [2019-11-20 00:13:53,369 INFO L226 Difference]: Without dead ends: 2100 [2019-11-20 00:13:53,371 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-20 00:13:53,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-11-20 00:13:53,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2100. [2019-11-20 00:13:53,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-11-20 00:13:53,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2595 transitions. [2019-11-20 00:13:53,421 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2595 transitions. Word has length 155 [2019-11-20 00:13:53,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:13:53,423 INFO L462 AbstractCegarLoop]: Abstraction has 2100 states and 2595 transitions. [2019-11-20 00:13:53,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:13:53,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2595 transitions. [2019-11-20 00:13:53,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-11-20 00:13:53,427 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:13:53,427 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:13:53,428 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:13:53,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:13:53,432 INFO L82 PathProgramCache]: Analyzing trace with hash -967776360, now seen corresponding path program 1 times [2019-11-20 00:13:53,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:13:53,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208345704] [2019-11-20 00:13:53,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:13:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:13:53,653 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-20 00:13:53,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208345704] [2019-11-20 00:13:53,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:13:53,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-20 00:13:53,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905197451] [2019-11-20 00:13:53,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 00:13:53,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:13:53,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 00:13:53,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-20 00:13:53,655 INFO L87 Difference]: Start difference. First operand 2100 states and 2595 transitions. Second operand 8 states. [2019-11-20 00:13:54,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:13:54,810 INFO L93 Difference]: Finished difference Result 4371 states and 5367 transitions. [2019-11-20 00:13:54,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 00:13:54,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 159 [2019-11-20 00:13:54,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:13:54,821 INFO L225 Difference]: With dead ends: 4371 [2019-11-20 00:13:54,822 INFO L226 Difference]: Without dead ends: 2273 [2019-11-20 00:13:54,824 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-20 00:13:54,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2019-11-20 00:13:54,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2100. [2019-11-20 00:13:54,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-11-20 00:13:54,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2583 transitions. [2019-11-20 00:13:54,867 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2583 transitions. Word has length 159 [2019-11-20 00:13:54,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:13:54,868 INFO L462 AbstractCegarLoop]: Abstraction has 2100 states and 2583 transitions. [2019-11-20 00:13:54,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 00:13:54,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2583 transitions. [2019-11-20 00:13:54,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-11-20 00:13:54,872 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:13:54,873 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:13:54,873 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:13:54,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:13:54,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1011248568, now seen corresponding path program 1 times [2019-11-20 00:13:54,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:13:54,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133407824] [2019-11-20 00:13:54,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:13:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:13:55,001 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-20 00:13:55,001 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133407824] [2019-11-20 00:13:55,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:13:55,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:13:55,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364252377] [2019-11-20 00:13:55,002 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:13:55,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:13:55,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:13:55,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:13:55,003 INFO L87 Difference]: Start difference. First operand 2100 states and 2583 transitions. Second operand 4 states. [2019-11-20 00:13:55,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:13:55,777 INFO L93 Difference]: Finished difference Result 4331 states and 5314 transitions. [2019-11-20 00:13:55,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:13:55,778 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-11-20 00:13:55,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:13:55,787 INFO L225 Difference]: With dead ends: 4331 [2019-11-20 00:13:55,787 INFO L226 Difference]: Without dead ends: 2233 [2019-11-20 00:13:55,790 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-20 00:13:55,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states. [2019-11-20 00:13:55,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 2231. [2019-11-20 00:13:55,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2231 states. [2019-11-20 00:13:55,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2606 transitions. [2019-11-20 00:13:55,839 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2606 transitions. Word has length 192 [2019-11-20 00:13:55,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:13:55,839 INFO L462 AbstractCegarLoop]: Abstraction has 2231 states and 2606 transitions. [2019-11-20 00:13:55,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:13:55,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2606 transitions. [2019-11-20 00:13:55,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-20 00:13:55,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:13:55,845 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:13:55,846 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:13:55,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:13:55,846 INFO L82 PathProgramCache]: Analyzing trace with hash -566866055, now seen corresponding path program 1 times [2019-11-20 00:13:55,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:13:55,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179397592] [2019-11-20 00:13:55,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:13:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:13:56,065 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-11-20 00:13:56,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179397592] [2019-11-20 00:13:56,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:13:56,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:13:56,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583858714] [2019-11-20 00:13:56,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:13:56,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:13:56,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:13:56,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:13:56,072 INFO L87 Difference]: Start difference. First operand 2231 states and 2606 transitions. Second operand 3 states. [2019-11-20 00:13:56,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:13:56,491 INFO L93 Difference]: Finished difference Result 2757 states and 3185 transitions. [2019-11-20 00:13:56,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:13:56,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-11-20 00:13:56,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:13:56,502 INFO L225 Difference]: With dead ends: 2757 [2019-11-20 00:13:56,502 INFO L226 Difference]: Without dead ends: 2755 [2019-11-20 00:13:56,503 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-20 00:13:56,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-11-20 00:13:56,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 1969. [2019-11-20 00:13:56,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-20 00:13:56,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2324 transitions. [2019-11-20 00:13:56,542 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2324 transitions. Word has length 194 [2019-11-20 00:13:56,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:13:56,542 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2324 transitions. [2019-11-20 00:13:56,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:13:56,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2324 transitions. [2019-11-20 00:13:56,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-11-20 00:13:56,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:13:56,547 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-20 00:13:56,548 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:13:56,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:13:56,548 INFO L82 PathProgramCache]: Analyzing trace with hash 643345862, now seen corresponding path program 1 times [2019-11-20 00:13:56,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:13:56,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791608626] [2019-11-20 00:13:56,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:13:56,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:13:56,671 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-11-20 00:13:56,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791608626] [2019-11-20 00:13:56,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:13:56,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 00:13:56,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46121864] [2019-11-20 00:13:56,672 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 00:13:56,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:13:56,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 00:13:56,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:13:56,673 INFO L87 Difference]: Start difference. First operand 1969 states and 2324 transitions. Second operand 4 states. [2019-11-20 00:13:57,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:13:57,202 INFO L93 Difference]: Finished difference Result 4460 states and 5224 transitions. [2019-11-20 00:13:57,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 00:13:57,204 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-11-20 00:13:57,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:13:57,211 INFO L225 Difference]: With dead ends: 4460 [2019-11-20 00:13:57,212 INFO L226 Difference]: Without dead ends: 2493 [2019-11-20 00:13:57,214 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:13:57,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2019-11-20 00:13:57,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 1969. [2019-11-20 00:13:57,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-20 00:13:57,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2312 transitions. [2019-11-20 00:13:57,249 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2312 transitions. Word has length 198 [2019-11-20 00:13:57,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:13:57,250 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2312 transitions. [2019-11-20 00:13:57,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 00:13:57,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2312 transitions. [2019-11-20 00:13:57,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-11-20 00:13:57,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:13:57,255 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:13:57,255 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:13:57,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:13:57,256 INFO L82 PathProgramCache]: Analyzing trace with hash -333400197, now seen corresponding path program 1 times [2019-11-20 00:13:57,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:13:57,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488609086] [2019-11-20 00:13:57,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:13:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:13:57,479 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-11-20 00:13:57,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488609086] [2019-11-20 00:13:57,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:13:57,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 00:13:57,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914890049] [2019-11-20 00:13:57,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 00:13:57,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:13:57,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 00:13:57,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 00:13:57,482 INFO L87 Difference]: Start difference. First operand 1969 states and 2312 transitions. Second operand 6 states. [2019-11-20 00:13:58,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:13:58,276 INFO L93 Difference]: Finished difference Result 4105 states and 4797 transitions. [2019-11-20 00:13:58,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 00:13:58,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 219 [2019-11-20 00:13:58,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:13:58,286 INFO L225 Difference]: With dead ends: 4105 [2019-11-20 00:13:58,286 INFO L226 Difference]: Without dead ends: 2138 [2019-11-20 00:13:58,288 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-20 00:13:58,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2019-11-20 00:13:58,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1838. [2019-11-20 00:13:58,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-11-20 00:13:58,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2102 transitions. [2019-11-20 00:13:58,323 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2102 transitions. Word has length 219 [2019-11-20 00:13:58,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:13:58,324 INFO L462 AbstractCegarLoop]: Abstraction has 1838 states and 2102 transitions. [2019-11-20 00:13:58,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 00:13:58,324 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2102 transitions. [2019-11-20 00:13:58,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-20 00:13:58,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:13:58,329 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:13:58,329 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:13:58,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:13:58,329 INFO L82 PathProgramCache]: Analyzing trace with hash 471134404, now seen corresponding path program 1 times [2019-11-20 00:13:58,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:13:58,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331884963] [2019-11-20 00:13:58,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:13:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:13:58,537 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 194 proven. 4 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-11-20 00:13:58,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331884963] [2019-11-20 00:13:58,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [180546802] [2019-11-20 00:13:58,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6c989d37-9a93-492d-85b3-7647db718798/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-20 00:13:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:13:58,663 INFO L255 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 00:13:58,687 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 00:13:58,772 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-11-20 00:13:58,772 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 00:13:58,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-11-20 00:13:58,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368187908] [2019-11-20 00:13:58,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:13:58,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:13:58,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:13:58,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 00:13:58,774 INFO L87 Difference]: Start difference. First operand 1838 states and 2102 transitions. Second operand 3 states. [2019-11-20 00:13:59,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:13:59,288 INFO L93 Difference]: Finished difference Result 3672 states and 4201 transitions. [2019-11-20 00:13:59,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:13:59,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 241 [2019-11-20 00:13:59,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:13:59,290 INFO L225 Difference]: With dead ends: 3672 [2019-11-20 00:13:59,290 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 00:13:59,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 242 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-20 00:13:59,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 00:13:59,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 00:13:59,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 00:13:59,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 00:13:59,294 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 241 [2019-11-20 00:13:59,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:13:59,294 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 00:13:59,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:13:59,295 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 00:13:59,295 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 00:13:59,504 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 00:13:59,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 00:13:59,678 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 81 [2019-11-20 00:13:59,841 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 82 [2019-11-20 00:14:00,244 WARN L191 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 34 [2019-11-20 00:14:00,641 WARN L191 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 34 [2019-11-20 00:14:00,643 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-20 00:14:00,643 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-20 00:14:00,644 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,644 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,644 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,644 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,644 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,644 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,644 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-20 00:14:00,644 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-20 00:14:00,644 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-20 00:14:00,644 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-20 00:14:00,644 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-20 00:14:00,644 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-20 00:14:00,645 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-20 00:14:00,645 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-20 00:14:00,645 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-20 00:14:00,645 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-20 00:14:00,645 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,645 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,645 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,645 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,645 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,645 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,645 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-20 00:14:00,645 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-20 00:14:00,645 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-20 00:14:00,646 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-20 00:14:00,646 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-20 00:14:00,646 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-20 00:14:00,646 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-20 00:14:00,646 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-20 00:14:00,646 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-20 00:14:00,646 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-20 00:14:00,646 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-20 00:14:00,646 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-20 00:14:00,646 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-20 00:14:00,646 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-20 00:14:00,646 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-20 00:14:00,647 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,647 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,647 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,647 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,647 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,647 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-20 00:14:00,647 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-20 00:14:00,647 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-20 00:14:00,653 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-20 00:14:00,653 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-20 00:14:00,654 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-20 00:14:00,654 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-20 00:14:00,654 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-20 00:14:00,654 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-20 00:14:00,655 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (<= ~a21~0 0)) (.cse3 (= ~a16~0 6)) (.cse7 (not (= ~a8~0 13))) (.cse2 (<= ~a17~0 0)) (.cse4 (= ~a17~0 1)) (.cse5 (not (= ~a7~0 1))) (.cse1 (= ~a16~0 4)) (.cse6 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3) (and .cse0 .cse4) (and .cse5 .cse4 .cse6) (and .cse7 .cse6 (= 5 ~a16~0)) (and .cse7 .cse5 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse6) (and .cse4 .cse6 (= ~a20~0 1)) (and .cse5 .cse1 .cse6))) [2019-11-20 00:14:00,656 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,657 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,658 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,658 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,658 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,658 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-20 00:14:00,658 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-20 00:14:00,658 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-20 00:14:00,658 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-20 00:14:00,659 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-20 00:14:00,659 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-20 00:14:00,659 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-20 00:14:00,659 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-20 00:14:00,659 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-20 00:14:00,659 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-20 00:14:00,659 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-20 00:14:00,660 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-20 00:14:00,660 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-20 00:14:00,660 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-20 00:14:00,660 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,660 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,660 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,660 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,660 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,661 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-20 00:14:00,661 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-20 00:14:00,661 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-20 00:14:00,661 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-20 00:14:00,661 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-20 00:14:00,661 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-20 00:14:00,661 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-20 00:14:00,662 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-20 00:14:00,662 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-20 00:14:00,662 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,662 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,662 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,662 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,662 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-20 00:14:00,662 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,663 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-20 00:14:00,663 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-20 00:14:00,663 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-20 00:14:00,663 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-20 00:14:00,663 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-20 00:14:00,663 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-20 00:14:00,663 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-20 00:14:00,663 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 00:14:00,664 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-20 00:14:00,664 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-20 00:14:00,664 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-20 00:14:00,664 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-20 00:14:00,664 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-20 00:14:00,665 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-20 00:14:00,665 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,665 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (<= ~a21~0 0)) (.cse3 (= ~a16~0 6)) (.cse7 (not (= ~a8~0 13))) (.cse2 (<= ~a17~0 0)) (.cse4 (= ~a17~0 1)) (.cse5 (not (= ~a7~0 1))) (.cse1 (= ~a16~0 4)) (.cse6 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3) (and .cse0 .cse4) (and .cse5 .cse4 .cse6) (and .cse7 .cse6 (= 5 ~a16~0)) (and .cse7 .cse5 .cse6 .cse3) (and .cse7 .cse1 .cse2 .cse6) (and .cse4 .cse6 (= ~a20~0 1)) (and .cse5 .cse1 .cse6))) [2019-11-20 00:14:00,665 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,666 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,666 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,666 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,666 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-20 00:14:00,666 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-20 00:14:00,666 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-20 00:14:00,666 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-20 00:14:00,666 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-20 00:14:00,667 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-20 00:14:00,667 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-20 00:14:00,667 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-20 00:14:00,667 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,667 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,667 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,667 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,667 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,668 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-20 00:14:00,668 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 00:14:00,668 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-20 00:14:00,668 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-20 00:14:00,668 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-20 00:14:00,668 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-20 00:14:00,668 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-20 00:14:00,669 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-20 00:14:00,669 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-20 00:14:00,669 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-20 00:14:00,669 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-20 00:14:00,669 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-20 00:14:00,669 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-20 00:14:00,669 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,669 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,670 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,670 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,670 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-20 00:14:00,670 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,670 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,670 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-20 00:14:00,670 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-20 00:14:00,670 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 00:14:00,671 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-20 00:14:00,671 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-20 00:14:00,671 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-20 00:14:00,671 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-20 00:14:00,671 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-20 00:14:00,671 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-20 00:14:00,671 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-20 00:14:00,671 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-20 00:14:00,672 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-20 00:14:00,672 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-20 00:14:00,672 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,672 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,672 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,672 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,672 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,673 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-20 00:14:00,673 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,673 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-20 00:14:00,673 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-20 00:14:00,673 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-20 00:14:00,673 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-20 00:14:00,673 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-20 00:14:00,673 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-20 00:14:00,674 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-20 00:14:00,674 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-20 00:14:00,674 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-20 00:14:00,674 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-20 00:14:00,674 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-20 00:14:00,674 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 00:14:00,674 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 446) no Hoare annotation was computed. [2019-11-20 00:14:00,675 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-20 00:14:00,675 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-20 00:14:00,675 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-20 00:14:00,675 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,675 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,675 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,675 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,675 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,676 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-20 00:14:00,676 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-20 00:14:00,676 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-20 00:14:00,676 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-20 00:14:00,676 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-20 00:14:00,676 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-20 00:14:00,676 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-20 00:14:00,676 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-20 00:14:00,677 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-20 00:14:00,677 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-20 00:14:00,677 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-20 00:14:00,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:14:00 BoogieIcfgContainer [2019-11-20 00:14:00,713 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 00:14:00,713 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 00:14:00,713 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 00:14:00,714 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 00:14:00,714 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:13:47" (3/4) ... [2019-11-20 00:14:00,717 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 00:14:00,743 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 00:14:00,745 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 00:14:00,939 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6c989d37-9a93-492d-85b3-7647db718798/bin/uautomizer/witness.graphml [2019-11-20 00:14:00,939 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 00:14:00,940 INFO L168 Benchmark]: Toolchain (without parser) took 15330.48 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 435.2 MB). Free memory was 944.7 MB in the beginning and 1.3 GB in the end (delta: -323.5 MB). Peak memory consumption was 111.6 MB. Max. memory is 11.5 GB. [2019-11-20 00:14:00,941 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:14:00,941 INFO L168 Benchmark]: CACSL2BoogieTranslator took 647.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -199.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-20 00:14:00,942 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.29 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: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-20 00:14:00,942 INFO L168 Benchmark]: Boogie Preprocessor took 57.70 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-20 00:14:00,942 INFO L168 Benchmark]: RCFGBuilder took 1203.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 114.6 MB). Peak memory consumption was 114.6 MB. Max. memory is 11.5 GB. [2019-11-20 00:14:00,943 INFO L168 Benchmark]: TraceAbstraction took 13108.16 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 269.0 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -275.9 MB). Peak memory consumption was 421.2 MB. Max. memory is 11.5 GB. [2019-11-20 00:14:00,943 INFO L168 Benchmark]: Witness Printer took 225.90 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2019-11-20 00:14:00,945 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 647.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 166.2 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -199.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.29 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: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 57.70 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 1203.68 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 114.6 MB). Peak memory consumption was 114.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13108.16 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 269.0 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -275.9 MB). Peak memory consumption was 421.2 MB. Max. memory is 11.5 GB. * Witness Printer took 225.90 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 446]: 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: (((((((((a21 <= 0 && a16 == 4) && a17 <= 0) || (a21 <= 0 && a16 == 6)) || (a21 <= 0 && a17 == 1)) || ((!(a7 == 1) && a17 == 1) && a21 == 1)) || ((!(a8 == 13) && a21 == 1) && 5 == a16)) || (((!(a8 == 13) && !(a7 == 1)) && a21 == 1) && a16 == 6)) || (((!(a8 == 13) && a16 == 4) && a17 <= 0) && a21 == 1)) || ((a17 == 1 && a21 == 1) && a20 == 1)) || ((!(a7 == 1) && a16 == 4) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((a21 <= 0 && a16 == 4) && a17 <= 0) || (a21 <= 0 && a16 == 6)) || (a21 <= 0 && a17 == 1)) || ((!(a7 == 1) && a17 == 1) && a21 == 1)) || ((!(a8 == 13) && a21 == 1) && 5 == a16)) || (((!(a8 == 13) && !(a7 == 1)) && a21 == 1) && a16 == 6)) || (((!(a8 == 13) && a16 == 4) && a17 <= 0) && a21 == 1)) || ((a17 == 1 && a21 == 1) && a20 == 1)) || ((!(a7 == 1) && a16 == 4) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 13.0s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, HoareTripleCheckerStatistics: 930 SDtfs, 2193 SDslu, 136 SDs, 0 SdLazy, 6433 SolverSat, 1043 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 287 GetRequests, 258 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2231occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 2702 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 34 NumberOfFragments, 195 HoareAnnotationTreeSize, 3 FomulaSimplifications, 15667 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 3826 FormulaSimplificationTreeSizeReductionInter, 0.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2131 NumberOfCodeBlocks, 2131 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2118 ConstructedInterpolants, 0 QuantifiedInterpolants, 915680 SizeOfPredicates, 1 NumberOfNonLiveVariables, 445 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1826/1830 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...