./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label43.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2483a488-249d-4bc8-ac09-e166aad54607/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_2483a488-249d-4bc8-ac09-e166aad54607/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2483a488-249d-4bc8-ac09-e166aad54607/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2483a488-249d-4bc8-ac09-e166aad54607/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label43.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2483a488-249d-4bc8-ac09-e166aad54607/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2483a488-249d-4bc8-ac09-e166aad54607/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 65cedfd4cd477eae3251a2c0e08e4db2fd40d0c9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:15:50,489 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:15:50,491 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:15:50,501 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:15:50,501 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:15:50,502 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:15:50,504 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:15:50,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:15:50,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:15:50,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:15:50,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:15:50,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:15:50,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:15:50,512 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:15:50,512 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:15:50,513 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:15:50,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:15:50,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:15:50,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:15:50,518 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:15:50,519 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:15:50,520 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:15:50,521 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:15:50,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:15:50,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:15:50,525 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:15:50,525 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:15:50,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:15:50,526 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:15:50,527 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:15:50,527 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:15:50,528 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:15:50,528 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:15:50,529 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:15:50,530 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:15:50,530 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:15:50,531 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:15:50,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:15:50,532 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:15:50,532 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:15:50,533 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:15:50,534 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2483a488-249d-4bc8-ac09-e166aad54607/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:15:50,546 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:15:50,547 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:15:50,548 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:15:50,548 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:15:50,548 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:15:50,549 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:15:50,549 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:15:50,549 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:15:50,549 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:15:50,549 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:15:50,550 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:15:50,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:15:50,550 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:15:50,550 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:15:50,551 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:15:50,551 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:15:50,551 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:15:50,551 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:15:50,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:15:50,552 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:15:50,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:15:50,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:15:50,553 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:15:50,553 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:15:50,553 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:15:50,553 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:15:50,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:15:50,554 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:15:50,554 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_2483a488-249d-4bc8-ac09-e166aad54607/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 -> 65cedfd4cd477eae3251a2c0e08e4db2fd40d0c9 [2019-11-15 21:15:50,579 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:15:50,588 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:15:50,592 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:15:50,593 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:15:50,593 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:15:50,594 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2483a488-249d-4bc8-ac09-e166aad54607/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label43.c [2019-11-15 21:15:50,642 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2483a488-249d-4bc8-ac09-e166aad54607/bin/uautomizer/data/12df46fd6/19b6c675990f47bcb747fdbf1ac26490/FLAGca4e06aeb [2019-11-15 21:15:51,223 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:15:51,226 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2483a488-249d-4bc8-ac09-e166aad54607/sv-benchmarks/c/eca-rers2012/Problem15_label43.c [2019-11-15 21:15:51,249 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2483a488-249d-4bc8-ac09-e166aad54607/bin/uautomizer/data/12df46fd6/19b6c675990f47bcb747fdbf1ac26490/FLAGca4e06aeb [2019-11-15 21:15:51,613 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2483a488-249d-4bc8-ac09-e166aad54607/bin/uautomizer/data/12df46fd6/19b6c675990f47bcb747fdbf1ac26490 [2019-11-15 21:15:51,616 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:15:51,617 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:15:51,618 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:15:51,618 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:15:51,621 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:15:51,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:15:51" (1/1) ... [2019-11-15 21:15:51,624 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@439860f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:51, skipping insertion in model container [2019-11-15 21:15:51,625 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:15:51" (1/1) ... [2019-11-15 21:15:51,638 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:15:51,720 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:15:52,390 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:15:52,395 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:15:52,974 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:15:52,991 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:15:52,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:52 WrapperNode [2019-11-15 21:15:52,992 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:15:52,993 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:15:52,993 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:15:52,993 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:15:53,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:52" (1/1) ... [2019-11-15 21:15:53,027 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:52" (1/1) ... [2019-11-15 21:15:53,160 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:15:53,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:15:53,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:15:53,161 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:15:53,169 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:52" (1/1) ... [2019-11-15 21:15:53,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:52" (1/1) ... [2019-11-15 21:15:53,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:52" (1/1) ... [2019-11-15 21:15:53,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:52" (1/1) ... [2019-11-15 21:15:53,247 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:52" (1/1) ... [2019-11-15 21:15:53,261 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:52" (1/1) ... [2019-11-15 21:15:53,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:52" (1/1) ... [2019-11-15 21:15:53,335 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:15:53,336 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:15:53,336 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:15:53,336 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:15:53,337 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2483a488-249d-4bc8-ac09-e166aad54607/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-15 21:15:53,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:15:53,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:15:58,484 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:15:58,484 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-15 21:15:58,485 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:15:58 BoogieIcfgContainer [2019-11-15 21:15:58,485 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:15:58,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:15:58,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:15:58,489 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:15:58,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:15:51" (1/3) ... [2019-11-15 21:15:58,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@daac696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:15:58, skipping insertion in model container [2019-11-15 21:15:58,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:15:52" (2/3) ... [2019-11-15 21:15:58,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@daac696 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:15:58, skipping insertion in model container [2019-11-15 21:15:58,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:15:58" (3/3) ... [2019-11-15 21:15:58,492 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label43.c [2019-11-15 21:15:58,501 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:15:58,508 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 21:15:58,517 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 21:15:58,550 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:15:58,550 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:15:58,550 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:15:58,550 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:15:58,550 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:15:58,551 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:15:58,551 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:15:58,551 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:15:58,576 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-15 21:15:58,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-15 21:15:58,588 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:15:58,589 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:15:58,590 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:15:58,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:15:58,597 INFO L82 PathProgramCache]: Analyzing trace with hash -2074400678, now seen corresponding path program 1 times [2019-11-15 21:15:58,604 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:15:58,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879435757] [2019-11-15 21:15:58,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:58,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:15:58,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:15:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:15:58,852 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-15 21:15:58,852 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879435757] [2019-11-15 21:15:58,853 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:15:58,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:15:58,854 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729807415] [2019-11-15 21:15:58,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:15:58,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:15:58,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:15:58,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:15:58,875 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-15 21:16:03,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:03,076 INFO L93 Difference]: Finished difference Result 1469 states and 2719 transitions. [2019-11-15 21:16:03,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:16:03,077 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-15 21:16:03,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:03,098 INFO L225 Difference]: With dead ends: 1469 [2019-11-15 21:16:03,098 INFO L226 Difference]: Without dead ends: 978 [2019-11-15 21:16:03,103 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:16:03,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2019-11-15 21:16:03,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 974. [2019-11-15 21:16:03,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-11-15 21:16:03,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1489 transitions. [2019-11-15 21:16:03,195 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1489 transitions. Word has length 58 [2019-11-15 21:16:03,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:03,196 INFO L462 AbstractCegarLoop]: Abstraction has 974 states and 1489 transitions. [2019-11-15 21:16:03,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:16:03,196 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1489 transitions. [2019-11-15 21:16:03,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-11-15 21:16:03,205 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:03,205 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:16:03,206 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:03,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:03,206 INFO L82 PathProgramCache]: Analyzing trace with hash -327159309, now seen corresponding path program 1 times [2019-11-15 21:16:03,206 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:03,207 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338746604] [2019-11-15 21:16:03,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:03,207 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:03,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:03,412 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:16:03,413 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338746604] [2019-11-15 21:16:03,413 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:03,413 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:16:03,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784721163] [2019-11-15 21:16:03,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:16:03,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:03,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:16:03,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:16:03,416 INFO L87 Difference]: Start difference. First operand 974 states and 1489 transitions. Second operand 4 states. [2019-11-15 21:16:06,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:06,974 INFO L93 Difference]: Finished difference Result 3748 states and 5754 transitions. [2019-11-15 21:16:06,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:16:06,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 177 [2019-11-15 21:16:06,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:06,989 INFO L225 Difference]: With dead ends: 3748 [2019-11-15 21:16:06,989 INFO L226 Difference]: Without dead ends: 2776 [2019-11-15 21:16:06,993 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:16:06,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2776 states. [2019-11-15 21:16:07,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2776 to 1873. [2019-11-15 21:16:07,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1873 states. [2019-11-15 21:16:07,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2509 transitions. [2019-11-15 21:16:07,044 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2509 transitions. Word has length 177 [2019-11-15 21:16:07,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:07,045 INFO L462 AbstractCegarLoop]: Abstraction has 1873 states and 2509 transitions. [2019-11-15 21:16:07,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:16:07,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2509 transitions. [2019-11-15 21:16:07,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2019-11-15 21:16:07,052 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:07,053 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:16:07,053 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:07,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:07,054 INFO L82 PathProgramCache]: Analyzing trace with hash 746152796, now seen corresponding path program 1 times [2019-11-15 21:16:07,054 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:07,054 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478316906] [2019-11-15 21:16:07,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:07,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:07,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:07,578 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-11-15 21:16:07,578 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478316906] [2019-11-15 21:16:07,579 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2097464520] [2019-11-15 21:16:07,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2483a488-249d-4bc8-ac09-e166aad54607/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-15 21:16:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:07,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:16:07,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:07,951 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:16:07,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:16:07,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2019-11-15 21:16:07,952 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022741160] [2019-11-15 21:16:07,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:16:07,953 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:07,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:16:07,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:16:07,954 INFO L87 Difference]: Start difference. First operand 1873 states and 2509 transitions. Second operand 3 states. [2019-11-15 21:16:11,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:11,230 INFO L93 Difference]: Finished difference Result 4940 states and 6531 transitions. [2019-11-15 21:16:11,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:16:11,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 328 [2019-11-15 21:16:11,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:11,248 INFO L225 Difference]: With dead ends: 4940 [2019-11-15 21:16:11,248 INFO L226 Difference]: Without dead ends: 3069 [2019-11-15 21:16:11,251 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 328 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-15 21:16:11,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2019-11-15 21:16:11,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 1873. [2019-11-15 21:16:11,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1873 states. [2019-11-15 21:16:11,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2509 transitions. [2019-11-15 21:16:11,295 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2509 transitions. Word has length 328 [2019-11-15 21:16:11,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:11,296 INFO L462 AbstractCegarLoop]: Abstraction has 1873 states and 2509 transitions. [2019-11-15 21:16:11,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:16:11,296 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2509 transitions. [2019-11-15 21:16:11,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-11-15 21:16:11,300 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:11,301 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:16:11,511 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:16:11,512 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:11,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:11,512 INFO L82 PathProgramCache]: Analyzing trace with hash -319239402, now seen corresponding path program 1 times [2019-11-15 21:16:11,513 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:11,513 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688651125] [2019-11-15 21:16:11,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:11,513 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:11,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:12,167 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-15 21:16:12,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688651125] [2019-11-15 21:16:12,168 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:12,168 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:16:12,168 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088974476] [2019-11-15 21:16:12,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:16:12,169 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:12,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:16:12,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:16:12,170 INFO L87 Difference]: Start difference. First operand 1873 states and 2509 transitions. Second operand 5 states. [2019-11-15 21:16:16,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:16,211 INFO L93 Difference]: Finished difference Result 4643 states and 5995 transitions. [2019-11-15 21:16:16,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:16:16,212 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 335 [2019-11-15 21:16:16,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:16,227 INFO L225 Difference]: With dead ends: 4643 [2019-11-15 21:16:16,227 INFO L226 Difference]: Without dead ends: 2772 [2019-11-15 21:16:16,230 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:16:16,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2772 states. [2019-11-15 21:16:16,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2772 to 2472. [2019-11-15 21:16:16,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2472 states. [2019-11-15 21:16:16,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2472 states to 2472 states and 3150 transitions. [2019-11-15 21:16:16,367 INFO L78 Accepts]: Start accepts. Automaton has 2472 states and 3150 transitions. Word has length 335 [2019-11-15 21:16:16,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:16,367 INFO L462 AbstractCegarLoop]: Abstraction has 2472 states and 3150 transitions. [2019-11-15 21:16:16,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:16:16,368 INFO L276 IsEmpty]: Start isEmpty. Operand 2472 states and 3150 transitions. [2019-11-15 21:16:16,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-11-15 21:16:16,375 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:16,375 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:16:16,376 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:16,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:16,376 INFO L82 PathProgramCache]: Analyzing trace with hash 989060, now seen corresponding path program 1 times [2019-11-15 21:16:16,376 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:16,377 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358087585] [2019-11-15 21:16:16,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:16,377 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:16,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:17,246 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 121 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:16:17,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358087585] [2019-11-15 21:16:17,247 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1626618914] [2019-11-15 21:16:17,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2483a488-249d-4bc8-ac09-e166aad54607/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:16:17,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:17,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:16:17,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:17,647 INFO L134 CoverageAnalysis]: Checked inductivity of 191 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:16:17,647 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:16:17,648 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-15 21:16:17,648 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128536259] [2019-11-15 21:16:17,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:16:17,649 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:17,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:16:17,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:16:17,650 INFO L87 Difference]: Start difference. First operand 2472 states and 3150 transitions. Second operand 3 states. [2019-11-15 21:16:19,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:19,792 INFO L93 Difference]: Finished difference Result 5243 states and 6655 transitions. [2019-11-15 21:16:19,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:16:19,793 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 409 [2019-11-15 21:16:19,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:19,807 INFO L225 Difference]: With dead ends: 5243 [2019-11-15 21:16:19,807 INFO L226 Difference]: Without dead ends: 2773 [2019-11-15 21:16:19,810 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 409 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:16:19,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2773 states. [2019-11-15 21:16:19,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2773 to 2771. [2019-11-15 21:16:19,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2771 states. [2019-11-15 21:16:19,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2771 states to 2771 states and 3297 transitions. [2019-11-15 21:16:19,858 INFO L78 Accepts]: Start accepts. Automaton has 2771 states and 3297 transitions. Word has length 409 [2019-11-15 21:16:19,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:19,859 INFO L462 AbstractCegarLoop]: Abstraction has 2771 states and 3297 transitions. [2019-11-15 21:16:19,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:16:19,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2771 states and 3297 transitions. [2019-11-15 21:16:19,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2019-11-15 21:16:19,867 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:19,867 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:20,070 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:16:20,071 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:20,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:20,072 INFO L82 PathProgramCache]: Analyzing trace with hash -79594870, now seen corresponding path program 1 times [2019-11-15 21:16:20,072 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:20,072 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439524409] [2019-11-15 21:16:20,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:20,073 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:20,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:20,388 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2019-11-15 21:16:20,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439524409] [2019-11-15 21:16:20,389 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:20,389 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:16:20,389 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967257951] [2019-11-15 21:16:20,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:16:20,391 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:20,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:16:20,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:16:20,392 INFO L87 Difference]: Start difference. First operand 2771 states and 3297 transitions. Second operand 4 states. [2019-11-15 21:16:23,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:23,462 INFO L93 Difference]: Finished difference Result 6744 states and 8302 transitions. [2019-11-15 21:16:23,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:16:23,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 426 [2019-11-15 21:16:23,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:23,489 INFO L225 Difference]: With dead ends: 6744 [2019-11-15 21:16:23,489 INFO L226 Difference]: Without dead ends: 3975 [2019-11-15 21:16:23,492 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:16:23,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3975 states. [2019-11-15 21:16:23,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3975 to 3974. [2019-11-15 21:16:23,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3974 states. [2019-11-15 21:16:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3974 states to 3974 states and 4762 transitions. [2019-11-15 21:16:23,561 INFO L78 Accepts]: Start accepts. Automaton has 3974 states and 4762 transitions. Word has length 426 [2019-11-15 21:16:23,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:23,562 INFO L462 AbstractCegarLoop]: Abstraction has 3974 states and 4762 transitions. [2019-11-15 21:16:23,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:16:23,562 INFO L276 IsEmpty]: Start isEmpty. Operand 3974 states and 4762 transitions. [2019-11-15 21:16:23,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2019-11-15 21:16:23,574 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:23,574 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:16:23,575 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:23,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:23,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1022697565, now seen corresponding path program 1 times [2019-11-15 21:16:23,575 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:23,575 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221760883] [2019-11-15 21:16:23,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:23,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:23,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:23,951 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-11-15 21:16:23,952 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221760883] [2019-11-15 21:16:23,952 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:23,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:16:23,952 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074785890] [2019-11-15 21:16:23,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:16:23,954 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:23,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:16:23,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:16:23,954 INFO L87 Difference]: Start difference. First operand 3974 states and 4762 transitions. Second operand 3 states. [2019-11-15 21:16:25,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:25,705 INFO L93 Difference]: Finished difference Result 9739 states and 11910 transitions. [2019-11-15 21:16:25,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:16:25,706 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 522 [2019-11-15 21:16:25,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:25,727 INFO L225 Difference]: With dead ends: 9739 [2019-11-15 21:16:25,727 INFO L226 Difference]: Without dead ends: 5767 [2019-11-15 21:16:25,732 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:16:25,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5767 states. [2019-11-15 21:16:25,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5767 to 5767. [2019-11-15 21:16:25,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5767 states. [2019-11-15 21:16:25,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5767 states to 5767 states and 6998 transitions. [2019-11-15 21:16:25,827 INFO L78 Accepts]: Start accepts. Automaton has 5767 states and 6998 transitions. Word has length 522 [2019-11-15 21:16:25,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:25,828 INFO L462 AbstractCegarLoop]: Abstraction has 5767 states and 6998 transitions. [2019-11-15 21:16:25,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:16:25,828 INFO L276 IsEmpty]: Start isEmpty. Operand 5767 states and 6998 transitions. [2019-11-15 21:16:25,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2019-11-15 21:16:25,936 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:25,936 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:16:25,937 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:25,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:25,937 INFO L82 PathProgramCache]: Analyzing trace with hash -935582361, now seen corresponding path program 1 times [2019-11-15 21:16:25,938 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:25,938 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071017749] [2019-11-15 21:16:25,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:25,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:25,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:27,208 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 644 proven. 3 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-11-15 21:16:27,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071017749] [2019-11-15 21:16:27,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [509911934] [2019-11-15 21:16:27,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2483a488-249d-4bc8-ac09-e166aad54607/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:16:27,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:27,353 INFO L256 TraceCheckSpWp]: Trace formula consists of 740 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:16:27,363 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:27,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 21:16:28,052 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 608 proven. 39 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-11-15 21:16:28,052 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:16:28,053 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-11-15 21:16:28,053 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581835276] [2019-11-15 21:16:28,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 21:16:28,054 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:28,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:16:28,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:16:28,055 INFO L87 Difference]: Start difference. First operand 5767 states and 6998 transitions. Second operand 9 states. [2019-11-15 21:16:34,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:34,059 INFO L93 Difference]: Finished difference Result 16172 states and 19332 transitions. [2019-11-15 21:16:34,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 21:16:34,060 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 613 [2019-11-15 21:16:34,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:34,087 INFO L225 Difference]: With dead ends: 16172 [2019-11-15 21:16:34,087 INFO L226 Difference]: Without dead ends: 7560 [2019-11-15 21:16:34,095 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 624 GetRequests, 610 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2019-11-15 21:16:34,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7560 states. [2019-11-15 21:16:34,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7560 to 5466. [2019-11-15 21:16:34,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5466 states. [2019-11-15 21:16:34,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5466 states to 5466 states and 5988 transitions. [2019-11-15 21:16:34,177 INFO L78 Accepts]: Start accepts. Automaton has 5466 states and 5988 transitions. Word has length 613 [2019-11-15 21:16:34,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:34,178 INFO L462 AbstractCegarLoop]: Abstraction has 5466 states and 5988 transitions. [2019-11-15 21:16:34,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 21:16:34,178 INFO L276 IsEmpty]: Start isEmpty. Operand 5466 states and 5988 transitions. [2019-11-15 21:16:34,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 656 [2019-11-15 21:16:34,185 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:34,186 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:16:34,393 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:16:34,393 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:34,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:34,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1919446783, now seen corresponding path program 1 times [2019-11-15 21:16:34,394 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:34,394 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627311423] [2019-11-15 21:16:34,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:34,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:34,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:34,798 INFO L134 CoverageAnalysis]: Checked inductivity of 844 backedges. 454 proven. 0 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2019-11-15 21:16:34,799 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627311423] [2019-11-15 21:16:34,799 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:34,799 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:16:34,800 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83309582] [2019-11-15 21:16:34,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:16:34,801 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:34,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:16:34,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:16:34,802 INFO L87 Difference]: Start difference. First operand 5466 states and 5988 transitions. Second operand 3 states. [2019-11-15 21:16:35,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:35,855 INFO L93 Difference]: Finished difference Result 10928 states and 11972 transitions. [2019-11-15 21:16:35,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:16:35,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 655 [2019-11-15 21:16:35,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:35,865 INFO L225 Difference]: With dead ends: 10928 [2019-11-15 21:16:35,865 INFO L226 Difference]: Without dead ends: 5464 [2019-11-15 21:16:35,871 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:16:35,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5464 states. [2019-11-15 21:16:35,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5464 to 5464. [2019-11-15 21:16:35,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5464 states. [2019-11-15 21:16:35,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5464 states to 5464 states and 5984 transitions. [2019-11-15 21:16:35,950 INFO L78 Accepts]: Start accepts. Automaton has 5464 states and 5984 transitions. Word has length 655 [2019-11-15 21:16:35,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:35,951 INFO L462 AbstractCegarLoop]: Abstraction has 5464 states and 5984 transitions. [2019-11-15 21:16:35,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:16:35,951 INFO L276 IsEmpty]: Start isEmpty. Operand 5464 states and 5984 transitions. [2019-11-15 21:16:35,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 669 [2019-11-15 21:16:35,963 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:35,964 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:16:35,964 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:35,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:35,965 INFO L82 PathProgramCache]: Analyzing trace with hash 967619704, now seen corresponding path program 1 times [2019-11-15 21:16:35,965 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:35,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273890501] [2019-11-15 21:16:35,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:35,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:35,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:37,067 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 493 proven. 201 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2019-11-15 21:16:37,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273890501] [2019-11-15 21:16:37,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068734808] [2019-11-15 21:16:37,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2483a488-249d-4bc8-ac09-e166aad54607/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:16:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:37,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 801 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:16:37,241 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:37,539 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 560 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2019-11-15 21:16:37,539 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:16:37,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-11-15 21:16:37,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660469428] [2019-11-15 21:16:37,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:16:37,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:37,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:16:37,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:16:37,541 INFO L87 Difference]: Start difference. First operand 5464 states and 5984 transitions. Second operand 3 states. [2019-11-15 21:16:38,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:38,722 INFO L93 Difference]: Finished difference Result 10927 states and 11968 transitions. [2019-11-15 21:16:38,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:16:38,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 668 [2019-11-15 21:16:38,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:38,730 INFO L225 Difference]: With dead ends: 10927 [2019-11-15 21:16:38,730 INFO L226 Difference]: Without dead ends: 5465 [2019-11-15 21:16:38,734 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 680 GetRequests, 669 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:16:38,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5465 states. [2019-11-15 21:16:38,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5465 to 5462. [2019-11-15 21:16:38,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5462 states. [2019-11-15 21:16:38,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5462 states to 5462 states and 5897 transitions. [2019-11-15 21:16:38,792 INFO L78 Accepts]: Start accepts. Automaton has 5462 states and 5897 transitions. Word has length 668 [2019-11-15 21:16:38,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:38,793 INFO L462 AbstractCegarLoop]: Abstraction has 5462 states and 5897 transitions. [2019-11-15 21:16:38,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:16:38,793 INFO L276 IsEmpty]: Start isEmpty. Operand 5462 states and 5897 transitions. [2019-11-15 21:16:38,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 684 [2019-11-15 21:16:38,800 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:38,801 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:39,004 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:16:39,005 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:39,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:39,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1941988686, now seen corresponding path program 1 times [2019-11-15 21:16:39,005 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:39,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552275642] [2019-11-15 21:16:39,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:39,005 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:39,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:39,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:39,644 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 465 proven. 56 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-15 21:16:39,644 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552275642] [2019-11-15 21:16:39,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1901335332] [2019-11-15 21:16:39,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2483a488-249d-4bc8-ac09-e166aad54607/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:16:39,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:39,776 INFO L256 TraceCheckSpWp]: Trace formula consists of 789 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:16:39,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:39,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:40,463 INFO L134 CoverageAnalysis]: Checked inductivity of 627 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 460 trivial. 0 not checked. [2019-11-15 21:16:40,463 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:16:40,464 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-11-15 21:16:40,464 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786822830] [2019-11-15 21:16:40,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:16:40,467 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:40,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:16:40,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:16:40,467 INFO L87 Difference]: Start difference. First operand 5462 states and 5897 transitions. Second operand 3 states. [2019-11-15 21:16:42,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:42,772 INFO L93 Difference]: Finished difference Result 14217 states and 15297 transitions. [2019-11-15 21:16:42,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:16:42,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 683 [2019-11-15 21:16:42,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:42,784 INFO L225 Difference]: With dead ends: 14217 [2019-11-15 21:16:42,785 INFO L226 Difference]: Without dead ends: 8458 [2019-11-15 21:16:42,789 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 689 GetRequests, 683 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:16:42,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8458 states. [2019-11-15 21:16:42,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8458 to 7854. [2019-11-15 21:16:42,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7854 states. [2019-11-15 21:16:42,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7854 states to 7854 states and 8362 transitions. [2019-11-15 21:16:42,874 INFO L78 Accepts]: Start accepts. Automaton has 7854 states and 8362 transitions. Word has length 683 [2019-11-15 21:16:42,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:42,875 INFO L462 AbstractCegarLoop]: Abstraction has 7854 states and 8362 transitions. [2019-11-15 21:16:42,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:16:42,876 INFO L276 IsEmpty]: Start isEmpty. Operand 7854 states and 8362 transitions. [2019-11-15 21:16:42,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 725 [2019-11-15 21:16:42,887 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:42,888 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:43,091 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:16:43,092 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:43,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:43,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1940770496, now seen corresponding path program 1 times [2019-11-15 21:16:43,092 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:43,092 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853000117] [2019-11-15 21:16:43,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:43,092 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:43,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:43,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:43,789 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 487 proven. 56 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-15 21:16:43,790 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853000117] [2019-11-15 21:16:43,790 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [624304109] [2019-11-15 21:16:43,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2483a488-249d-4bc8-ac09-e166aad54607/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:16:43,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:43,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 21:16:43,951 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:43,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:43,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:43,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:43,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:43,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:43,966 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:43,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:43,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:43,969 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:43,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:43,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:43,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:43,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:43,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:43,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:43,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:43,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:43,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:43,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:43,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:43,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:43,976 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:43,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:43,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:43,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:44,331 INFO L134 CoverageAnalysis]: Checked inductivity of 649 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 482 trivial. 0 not checked. [2019-11-15 21:16:44,331 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:16:44,332 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 5 [2019-11-15 21:16:44,332 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274701987] [2019-11-15 21:16:44,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:16:44,333 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:44,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:16:44,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:16:44,333 INFO L87 Difference]: Start difference. First operand 7854 states and 8362 transitions. Second operand 3 states. [2019-11-15 21:16:45,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:45,221 INFO L93 Difference]: Finished difference Result 15067 states and 15962 transitions. [2019-11-15 21:16:45,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:16:45,221 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 724 [2019-11-15 21:16:45,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:45,237 INFO L225 Difference]: With dead ends: 15067 [2019-11-15 21:16:45,237 INFO L226 Difference]: Without dead ends: 6916 [2019-11-15 21:16:45,243 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 729 GetRequests, 724 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:16:45,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6916 states. [2019-11-15 21:16:45,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6916 to 6019. [2019-11-15 21:16:45,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6019 states. [2019-11-15 21:16:45,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6019 states to 6019 states and 6277 transitions. [2019-11-15 21:16:45,303 INFO L78 Accepts]: Start accepts. Automaton has 6019 states and 6277 transitions. Word has length 724 [2019-11-15 21:16:45,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:45,304 INFO L462 AbstractCegarLoop]: Abstraction has 6019 states and 6277 transitions. [2019-11-15 21:16:45,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:16:45,304 INFO L276 IsEmpty]: Start isEmpty. Operand 6019 states and 6277 transitions. [2019-11-15 21:16:45,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 901 [2019-11-15 21:16:45,319 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:45,319 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:45,524 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:16:45,524 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:45,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:45,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1877579581, now seen corresponding path program 1 times [2019-11-15 21:16:45,525 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:45,525 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419014837] [2019-11-15 21:16:45,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:45,525 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:45,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:45,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:46,365 INFO L134 CoverageAnalysis]: Checked inductivity of 1424 backedges. 848 proven. 0 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2019-11-15 21:16:46,365 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419014837] [2019-11-15 21:16:46,365 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:46,365 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:16:46,366 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357112863] [2019-11-15 21:16:46,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:16:46,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:46,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:16:46,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:16:46,367 INFO L87 Difference]: Start difference. First operand 6019 states and 6277 transitions. Second operand 3 states. [2019-11-15 21:16:47,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:47,183 INFO L93 Difference]: Finished difference Result 15024 states and 15707 transitions. [2019-11-15 21:16:47,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:16:47,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 900 [2019-11-15 21:16:47,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:47,196 INFO L225 Difference]: With dead ends: 15024 [2019-11-15 21:16:47,196 INFO L226 Difference]: Without dead ends: 9306 [2019-11-15 21:16:47,201 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:16:47,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9306 states. [2019-11-15 21:16:47,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9306 to 7811. [2019-11-15 21:16:47,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7811 states. [2019-11-15 21:16:47,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7811 states to 7811 states and 8113 transitions. [2019-11-15 21:16:47,286 INFO L78 Accepts]: Start accepts. Automaton has 7811 states and 8113 transitions. Word has length 900 [2019-11-15 21:16:47,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:47,286 INFO L462 AbstractCegarLoop]: Abstraction has 7811 states and 8113 transitions. [2019-11-15 21:16:47,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:16:47,287 INFO L276 IsEmpty]: Start isEmpty. Operand 7811 states and 8113 transitions. [2019-11-15 21:16:47,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 908 [2019-11-15 21:16:47,301 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:47,302 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:47,302 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:47,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:47,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1055601463, now seen corresponding path program 1 times [2019-11-15 21:16:47,303 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:47,303 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97004174] [2019-11-15 21:16:47,303 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:47,304 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:47,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:47,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:48,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1226 backedges. 982 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2019-11-15 21:16:48,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97004174] [2019-11-15 21:16:48,348 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:48,348 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 21:16:48,348 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005554344] [2019-11-15 21:16:48,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 21:16:48,349 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:48,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:16:48,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:16:48,349 INFO L87 Difference]: Start difference. First operand 7811 states and 8113 transitions. Second operand 6 states. [2019-11-15 21:16:49,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:49,611 INFO L93 Difference]: Finished difference Result 15401 states and 16003 transitions. [2019-11-15 21:16:49,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:16:49,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 907 [2019-11-15 21:16:49,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:49,618 INFO L225 Difference]: With dead ends: 15401 [2019-11-15 21:16:49,619 INFO L226 Difference]: Without dead ends: 7891 [2019-11-15 21:16:49,624 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:16:49,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7891 states. [2019-11-15 21:16:49,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7891 to 7811. [2019-11-15 21:16:49,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7811 states. [2019-11-15 21:16:49,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7811 states to 7811 states and 8057 transitions. [2019-11-15 21:16:49,704 INFO L78 Accepts]: Start accepts. Automaton has 7811 states and 8057 transitions. Word has length 907 [2019-11-15 21:16:49,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:49,704 INFO L462 AbstractCegarLoop]: Abstraction has 7811 states and 8057 transitions. [2019-11-15 21:16:49,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 21:16:49,705 INFO L276 IsEmpty]: Start isEmpty. Operand 7811 states and 8057 transitions. [2019-11-15 21:16:49,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 915 [2019-11-15 21:16:49,719 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:49,720 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:49,720 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:49,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:49,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1552580489, now seen corresponding path program 1 times [2019-11-15 21:16:49,721 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:49,721 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9291881] [2019-11-15 21:16:49,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:49,721 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:49,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:50,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 806 proven. 0 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2019-11-15 21:16:50,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9291881] [2019-11-15 21:16:50,529 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:16:50,530 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:16:50,530 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507286313] [2019-11-15 21:16:50,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:16:50,530 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:50,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:16:50,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:16:50,531 INFO L87 Difference]: Start difference. First operand 7811 states and 8057 transitions. Second operand 3 states. [2019-11-15 21:16:51,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:51,361 INFO L93 Difference]: Finished difference Result 18019 states and 18611 transitions. [2019-11-15 21:16:51,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:16:51,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 914 [2019-11-15 21:16:51,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:51,373 INFO L225 Difference]: With dead ends: 18019 [2019-11-15 21:16:51,373 INFO L226 Difference]: Without dead ends: 10509 [2019-11-15 21:16:51,377 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:16:51,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10509 states. [2019-11-15 21:16:51,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10509 to 9904. [2019-11-15 21:16:51,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9904 states. [2019-11-15 21:16:51,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9904 states to 9904 states and 10218 transitions. [2019-11-15 21:16:51,465 INFO L78 Accepts]: Start accepts. Automaton has 9904 states and 10218 transitions. Word has length 914 [2019-11-15 21:16:51,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:51,465 INFO L462 AbstractCegarLoop]: Abstraction has 9904 states and 10218 transitions. [2019-11-15 21:16:51,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:16:51,466 INFO L276 IsEmpty]: Start isEmpty. Operand 9904 states and 10218 transitions. [2019-11-15 21:16:51,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 991 [2019-11-15 21:16:51,483 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:16:51,484 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:16:51,484 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:16:51,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:16:51,485 INFO L82 PathProgramCache]: Analyzing trace with hash -173843330, now seen corresponding path program 1 times [2019-11-15 21:16:51,486 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:16:51,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061685260] [2019-11-15 21:16:51,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:51,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:16:51,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:16:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:52,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1472 backedges. 828 proven. 56 refuted. 0 times theorem prover too weak. 588 trivial. 0 not checked. [2019-11-15 21:16:52,866 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061685260] [2019-11-15 21:16:52,866 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358300428] [2019-11-15 21:16:52,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2483a488-249d-4bc8-ac09-e166aad54607/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:16:53,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:16:53,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 1120 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 21:16:53,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:16:53,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:53,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:16:53,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1472 backedges. 223 proven. 0 refuted. 0 times theorem prover too weak. 1249 trivial. 0 not checked. [2019-11-15 21:16:53,988 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:16:53,989 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-11-15 21:16:53,989 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960694626] [2019-11-15 21:16:53,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:16:53,990 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:16:53,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:16:53,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:16:53,990 INFO L87 Difference]: Start difference. First operand 9904 states and 10218 transitions. Second operand 3 states. [2019-11-15 21:16:55,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:16:55,491 INFO L93 Difference]: Finished difference Result 11105 states and 11446 transitions. [2019-11-15 21:16:55,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:16:55,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 990 [2019-11-15 21:16:55,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:16:55,493 INFO L225 Difference]: With dead ends: 11105 [2019-11-15 21:16:55,493 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 21:16:55,496 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 996 GetRequests, 990 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:16:55,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 21:16:55,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 21:16:55,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 21:16:55,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 21:16:55,496 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 990 [2019-11-15 21:16:55,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:16:55,497 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:16:55,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:16:55,497 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:16:55,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 21:16:55,697 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:16:55,700 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 21:16:55,977 WARN L191 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 209 [2019-11-15 21:16:56,195 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 248 DAG size of output: 208 [2019-11-15 21:16:57,496 WARN L191 SmtUtils]: Spent 1.20 s on a formula simplification. DAG size of input: 201 DAG size of output: 91 [2019-11-15 21:16:58,508 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 200 DAG size of output: 91 [2019-11-15 21:16:59,243 WARN L191 SmtUtils]: Spent 733.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 87 [2019-11-15 21:16:59,245 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,245 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,246 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,246 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,246 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-15 21:16:59,246 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,246 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,246 INFO L443 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,246 INFO L443 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,246 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,246 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,246 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-15 21:16:59,246 INFO L443 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,246 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,246 INFO L443 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,246 INFO L443 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-11-15 21:16:59,246 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,246 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,247 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-15 21:16:59,247 INFO L443 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,247 INFO L443 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,247 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,247 INFO L443 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,247 INFO L443 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,247 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,247 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-15 21:16:59,247 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,247 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,247 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,247 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,247 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-11-15 21:16:59,247 INFO L443 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-11-15 21:16:59,247 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,247 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,248 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,248 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,248 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-15 21:16:59,248 INFO L443 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-11-15 21:16:59,248 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,248 INFO L443 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,248 INFO L443 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,248 INFO L443 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,248 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,248 INFO L443 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-11-15 21:16:59,248 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,248 INFO L443 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-11-15 21:16:59,248 INFO L443 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-11-15 21:16:59,248 INFO L443 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-11-15 21:16:59,249 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-15 21:16:59,249 INFO L443 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,249 INFO L443 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,249 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,249 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,249 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,249 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-11-15 21:16:59,249 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,249 INFO L443 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,249 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-15 21:16:59,249 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,249 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-11-15 21:16:59,249 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,249 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,249 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,249 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-15 21:16:59,249 INFO L443 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,249 INFO L443 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-11-15 21:16:59,250 INFO L443 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-11-15 21:16:59,250 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-11-15 21:16:59,250 INFO L443 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-11-15 21:16:59,250 INFO L443 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-11-15 21:16:59,250 INFO L443 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-11-15 21:16:59,250 INFO L443 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,250 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,250 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,250 INFO L443 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,250 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-11-15 21:16:59,250 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-11-15 21:16:59,250 INFO L443 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,250 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-15 21:16:59,251 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,251 INFO L443 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,251 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,251 INFO L443 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,251 INFO L443 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,251 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,251 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-15 21:16:59,251 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 21:16:59,251 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,251 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,251 INFO L443 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,251 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,251 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,251 INFO L443 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-11-15 21:16:59,251 INFO L443 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-11-15 21:16:59,251 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,251 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-15 21:16:59,251 INFO L443 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-11-15 21:16:59,251 INFO L443 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-11-15 21:16:59,251 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,251 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-11-15 21:16:59,252 INFO L443 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-11-15 21:16:59,252 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,252 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,252 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,252 INFO L443 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,252 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-15 21:16:59,252 INFO L443 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-11-15 21:16:59,252 INFO L443 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,252 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,252 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,252 INFO L443 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-11-15 21:16:59,252 INFO L443 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-11-15 21:16:59,252 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,253 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-15 21:16:59,253 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,253 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,253 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,253 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,253 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,253 INFO L443 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,253 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-15 21:16:59,253 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,253 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,253 INFO L443 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-11-15 21:16:59,253 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,254 INFO L443 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,254 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,254 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,254 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-15 21:16:59,254 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,254 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,254 INFO L443 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,254 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,254 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,255 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-15 21:16:59,255 INFO L443 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,255 INFO L443 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,255 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,255 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,255 INFO L443 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-11-15 21:16:59,255 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,255 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,255 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,255 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-11-15 21:16:59,255 INFO L443 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-11-15 21:16:59,255 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,255 INFO L443 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,255 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-15 21:16:59,255 INFO L443 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,255 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,256 INFO L443 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,256 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,256 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,256 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-15 21:16:59,256 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,256 INFO L443 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,256 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,256 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,256 INFO L443 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,256 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-15 21:16:59,256 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,257 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,257 INFO L443 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-11-15 21:16:59,257 INFO L443 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,257 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-15 21:16:59,257 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-15 21:16:59,257 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,257 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,257 INFO L443 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,257 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,257 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,257 INFO L443 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-11-15 21:16:59,257 INFO L443 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-11-15 21:16:59,257 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,257 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-15 21:16:59,257 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 21:16:59,257 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-15 21:16:59,257 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,258 INFO L443 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,258 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,258 INFO L443 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,258 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,258 INFO L443 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-11-15 21:16:59,258 INFO L443 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-11-15 21:16:59,258 INFO L443 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-11-15 21:16:59,258 INFO L443 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-11-15 21:16:59,258 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,258 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,258 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,258 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-15 21:16:59,258 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-15 21:16:59,258 INFO L443 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,258 INFO L443 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-11-15 21:16:59,258 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,258 INFO L443 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,259 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,259 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,259 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-11-15 21:16:59,259 INFO L443 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-11-15 21:16:59,259 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-15 21:16:59,259 INFO L443 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,259 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-15 21:16:59,259 INFO L443 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,260 INFO L443 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,260 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,260 INFO L443 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,260 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,260 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,260 INFO L443 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,260 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,260 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-15 21:16:59,260 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-15 21:16:59,260 INFO L443 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-11-15 21:16:59,261 INFO L443 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-11-15 21:16:59,261 INFO L443 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,261 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,261 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,261 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,261 INFO L439 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse8 (<= (+ ~a4~0 86) 0)) (.cse7 (+ ~a0~0 61))) (let ((.cse5 (exists ((v_prenex_1 Int)) (let ((.cse11 (mod (+ v_prenex_1 16) 29))) (and (<= .cse11 (+ ~a29~0 16)) (< v_prenex_1 416279) (not (= .cse11 0)))))) (.cse2 (<= (+ ~a0~0 98) 0)) (.cse1 (= ~a2~0 1)) (.cse6 (let ((.cse9 (not (= ~a2~0 2))) (.cse10 (< 0 .cse7))) (or (and .cse8 .cse9) (and .cse10 .cse8) (and .cse9 .cse10)))) (.cse0 (<= (+ ~a4~0 42) 0)) (.cse3 (<= 2 ~a2~0)) (.cse4 (<= ~a2~0 2))) (or (and .cse0 (and .cse1 (<= ~a29~0 43) (< 0 (+ ~a29~0 144)))) (and .cse2 (and .cse3 .cse4 .cse5)) (and .cse2 .cse0 .cse1 .cse5) (and .cse3 .cse6 .cse0 .cse5) (and .cse3 .cse2 .cse0) (and .cse6 (<= .cse7 0)) (and .cse3 .cse6 .cse4) (and .cse2 .cse0 .cse1 (< 0 (+ ~a0~0 147))) (and .cse6 .cse0 (= 3 ~a2~0)) (and (and .cse6 .cse0) (= 4 ~a2~0)) (and .cse3 .cse4 (exists ((v_~a29~0_895 Int)) (and (<= (div (+ v_~a29~0_895 (- 101)) 5) (+ ~a29~0 32)) (< 0 (+ v_~a29~0_895 16)) (< v_~a29~0_895 101) (not (= 0 (mod (+ v_~a29~0_895 4) 5))))) .cse8)))) [2019-11-15 21:16:59,261 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-15 21:16:59,261 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-15 21:16:59,261 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,261 INFO L443 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,261 INFO L443 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,262 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,262 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,262 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,262 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,262 INFO L443 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-11-15 21:16:59,262 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,262 INFO L443 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-11-15 21:16:59,262 INFO L446 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-11-15 21:16:59,262 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,262 INFO L443 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-11-15 21:16:59,262 INFO L443 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-11-15 21:16:59,262 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-15 21:16:59,262 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-15 21:16:59,262 INFO L443 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,262 INFO L443 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,262 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,262 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,263 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,263 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-15 21:16:59,263 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-15 21:16:59,263 INFO L443 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,263 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-11-15 21:16:59,263 INFO L443 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-11-15 21:16:59,263 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,263 INFO L443 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,264 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,264 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,264 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,264 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,264 INFO L439 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse7 (<= (+ ~a4~0 86) 0)) (.cse9 (+ ~a0~0 61))) (let ((.cse2 (+ ~a29~0 144)) (.cse6 (exists ((v_prenex_1 Int)) (let ((.cse12 (mod (+ v_prenex_1 16) 29))) (and (<= .cse12 (+ ~a29~0 16)) (< v_prenex_1 416279) (not (= .cse12 0)))))) (.cse3 (<= (+ ~a0~0 98) 0)) (.cse1 (= ~a2~0 1)) (.cse8 (let ((.cse10 (not (= ~a2~0 2))) (.cse11 (< 0 .cse9))) (or (and .cse7 .cse10) (and .cse11 .cse7) (and .cse10 .cse11)))) (.cse0 (<= (+ ~a4~0 42) 0)) (.cse4 (<= 2 ~a2~0)) (.cse5 (<= ~a2~0 2))) (or (and .cse0 (and .cse1 (<= ~a29~0 43) (< 0 .cse2))) (and .cse3 (and .cse4 .cse5 .cse6)) (and (and .cse7 .cse1) (<= .cse2 0)) (and .cse4 .cse3 .cse0) (and .cse8 .cse0 (= 3 ~a2~0)) (and .cse4 .cse8 .cse0 .cse6) (and .cse8 (<= .cse9 0)) (and .cse3 .cse0 .cse1 (< 0 (+ ~a0~0 147))) (and .cse3 .cse0 .cse1 (< 43 ~a29~0)) (and .cse4 .cse8 .cse5) (and (and .cse8 .cse0) (= 4 ~a2~0)) (and .cse4 .cse5 (exists ((v_~a29~0_895 Int)) (and (<= (div (+ v_~a29~0_895 (- 101)) 5) (+ ~a29~0 32)) (< 0 (+ v_~a29~0_895 16)) (< v_~a29~0_895 101) (not (= 0 (mod (+ v_~a29~0_895 4) 5))))) .cse7)))) [2019-11-15 21:16:59,264 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,265 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-15 21:16:59,265 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-15 21:16:59,265 INFO L443 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,265 INFO L443 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,265 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,265 INFO L443 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,265 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,266 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,266 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-15 21:16:59,266 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-15 21:16:59,266 INFO L443 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,266 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,266 INFO L443 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-11-15 21:16:59,266 INFO L443 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,266 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,266 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,266 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,267 INFO L443 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,267 INFO L443 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,267 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-15 21:16:59,267 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-15 21:16:59,267 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,267 INFO L443 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,267 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,267 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,267 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,267 INFO L443 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,267 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 21:16:59,267 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-15 21:16:59,267 INFO L443 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,267 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-15 21:16:59,267 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,267 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,268 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,268 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,268 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,268 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,268 INFO L443 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,268 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-15 21:16:59,268 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-15 21:16:59,268 INFO L443 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,268 INFO L443 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,268 INFO L443 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,268 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,268 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,268 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,268 INFO L443 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,268 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-15 21:16:59,268 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-15 21:16:59,268 INFO L443 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,269 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 181) no Hoare annotation was computed. [2019-11-15 21:16:59,269 INFO L443 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,269 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,269 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,269 INFO L443 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,269 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,269 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,269 INFO L443 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-11-15 21:16:59,269 INFO L443 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-11-15 21:16:59,269 INFO L443 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,269 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-15 21:16:59,269 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-15 21:16:59,269 INFO L443 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,269 INFO L443 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,269 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,269 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,270 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,270 INFO L443 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,270 INFO L439 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse7 (<= (+ ~a4~0 86) 0)) (.cse9 (+ ~a0~0 61))) (let ((.cse2 (+ ~a29~0 144)) (.cse6 (exists ((v_prenex_1 Int)) (let ((.cse12 (mod (+ v_prenex_1 16) 29))) (and (<= .cse12 (+ ~a29~0 16)) (< v_prenex_1 416279) (not (= .cse12 0)))))) (.cse3 (<= (+ ~a0~0 98) 0)) (.cse1 (= ~a2~0 1)) (.cse8 (let ((.cse10 (not (= ~a2~0 2))) (.cse11 (< 0 .cse9))) (or (and .cse7 .cse10) (and .cse11 .cse7) (and .cse10 .cse11)))) (.cse0 (<= (+ ~a4~0 42) 0)) (.cse4 (<= 2 ~a2~0)) (.cse5 (<= ~a2~0 2))) (or (and .cse0 (and .cse1 (<= ~a29~0 43) (< 0 .cse2))) (and .cse3 (and .cse4 .cse5 .cse6)) (and (and .cse7 .cse1) (<= .cse2 0)) (and .cse4 .cse3 .cse0) (and .cse8 .cse0 (= 3 ~a2~0)) (and .cse4 .cse8 .cse0 .cse6) (and .cse8 (<= .cse9 0)) (and .cse3 .cse0 .cse1 (< 0 (+ ~a0~0 147))) (and .cse3 .cse0 .cse1 (< 43 ~a29~0)) (and .cse4 .cse8 .cse5) (and (and .cse8 .cse0) (= 4 ~a2~0)) (and .cse4 .cse5 (exists ((v_~a29~0_895 Int)) (and (<= (div (+ v_~a29~0_895 (- 101)) 5) (+ ~a29~0 32)) (< 0 (+ v_~a29~0_895 16)) (< v_~a29~0_895 101) (not (= 0 (mod (+ v_~a29~0_895 4) 5))))) .cse7)))) [2019-11-15 21:16:59,270 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-15 21:16:59,270 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-15 21:16:59,270 INFO L443 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,270 INFO L443 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,270 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,270 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,270 INFO L443 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,270 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,270 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,270 INFO L443 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,271 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-15 21:16:59,271 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-15 21:16:59,271 INFO L443 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,271 INFO L443 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-11-15 21:16:59,271 INFO L443 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-11-15 21:16:59,271 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,271 INFO L443 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,271 INFO L443 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,271 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,272 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,272 INFO L443 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-11-15 21:16:59,272 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-15 21:16:59,272 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,272 INFO L443 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,272 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,272 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,272 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-11-15 21:16:59,273 INFO L443 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-11-15 21:16:59,273 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-11-15 21:16:59,273 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,273 INFO L443 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-11-15 21:16:59,273 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-15 21:16:59,273 INFO L443 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,273 INFO L443 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,273 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,274 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,274 INFO L443 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,274 INFO L443 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,274 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,274 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-15 21:16:59,274 INFO L443 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-11-15 21:16:59,274 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,275 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,275 INFO L443 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,275 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-15 21:16:59,275 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,275 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 21:16:59,275 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,275 INFO L443 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-11-15 21:16:59,275 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,276 INFO L443 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,276 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,276 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,276 INFO L443 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,276 INFO L443 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,276 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,276 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-11-15 21:16:59,276 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-11-15 21:16:59,277 INFO L443 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,277 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-15 21:16:59,277 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,277 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,277 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,277 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-15 21:16:59,277 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,278 INFO L443 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,278 INFO L443 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,278 INFO L443 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,278 INFO L443 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-11-15 21:16:59,278 INFO L443 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,278 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,278 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-11-15 21:16:59,278 INFO L443 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-11-15 21:16:59,278 INFO L443 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,278 INFO L443 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,278 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,278 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-15 21:16:59,278 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,278 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,279 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,279 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,279 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,279 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-15 21:16:59,279 INFO L443 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,279 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,279 INFO L443 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-11-15 21:16:59,279 INFO L443 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-11-15 21:16:59,279 INFO L443 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,279 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-11-15 21:16:59,279 INFO L443 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-11-15 21:16:59,279 INFO L443 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,279 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-15 21:16:59,279 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,279 INFO L443 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-11-15 21:16:59,279 INFO L443 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-11-15 21:16:59,279 INFO L443 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,280 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,280 INFO L443 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-11-15 21:16:59,280 INFO L443 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-11-15 21:16:59,280 INFO L443 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-11-15 21:16:59,287 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,288 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,288 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,289 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,300 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,300 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,300 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,301 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,301 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,301 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,302 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,303 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,305 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,306 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,307 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,308 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,308 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,310 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,310 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,310 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,311 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,311 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,311 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,312 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,312 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,312 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,312 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,314 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,314 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,315 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,316 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,317 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,318 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,320 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,320 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,320 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,322 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,322 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,322 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,323 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:16:59 BoogieIcfgContainer [2019-11-15 21:16:59,326 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:16:59,326 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:16:59,326 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:16:59,326 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:16:59,327 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:15:58" (3/4) ... [2019-11-15 21:16:59,330 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 21:16:59,357 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-15 21:16:59,361 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 21:16:59,388 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((a4 + 42 <= 0 && (a2 == 1 && a29 <= 43) && 0 < a29 + 144) || (a0 + 98 <= 0 && (2 <= a2 && a2 <= 2) && (\exists v_prenex_1 : int :: ((v_prenex_1 + 16) % 29 <= a29 + 16 && v_prenex_1 < 416279) && !((v_prenex_1 + 16) % 29 == 0)))) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || ((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0)) || (((((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61)) && a4 + 42 <= 0) && 3 == a2)) || (((2 <= a2 && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61))) && a4 + 42 <= 0) && (\exists v_prenex_1 : int :: ((v_prenex_1 + 16) % 29 <= a29 + 16 && v_prenex_1 < 416279) && !((v_prenex_1 + 16) % 29 == 0)))) || ((((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61)) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 < a0 + 147)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 43 < a29)) || ((2 <= a2 && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61))) && a2 <= 2)) || (((((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61)) && a4 + 42 <= 0) && 4 == a2)) || (((2 <= a2 && a2 <= 2) && (\exists v_~a29~0_895 : int :: (((v_~a29~0_895 + -101) / 5 <= a29 + 32 && 0 < v_~a29~0_895 + 16) && v_~a29~0_895 < 101) && !(0 == (v_~a29~0_895 + 4) % 5))) && a4 + 86 <= 0) [2019-11-15 21:16:59,392 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((a4 + 42 <= 0 && (a2 == 1 && a29 <= 43) && 0 < a29 + 144) || (a0 + 98 <= 0 && (2 <= a2 && a2 <= 2) && (\exists v_prenex_1 : int :: ((v_prenex_1 + 16) % 29 <= a29 + 16 && v_prenex_1 < 416279) && !((v_prenex_1 + 16) % 29 == 0)))) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || ((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0)) || (((((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61)) && a4 + 42 <= 0) && 3 == a2)) || (((2 <= a2 && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61))) && a4 + 42 <= 0) && (\exists v_prenex_1 : int :: ((v_prenex_1 + 16) % 29 <= a29 + 16 && v_prenex_1 < 416279) && !((v_prenex_1 + 16) % 29 == 0)))) || ((((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61)) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 < a0 + 147)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 43 < a29)) || ((2 <= a2 && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61))) && a2 <= 2)) || (((((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61)) && a4 + 42 <= 0) && 4 == a2)) || (((2 <= a2 && a2 <= 2) && (\exists v_~a29~0_895 : int :: (((v_~a29~0_895 + -101) / 5 <= a29 + 32 && 0 < v_~a29~0_895 + 16) && v_~a29~0_895 < 101) && !(0 == (v_~a29~0_895 + 4) % 5))) && a4 + 86 <= 0) [2019-11-15 21:16:59,402 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((a4 + 42 <= 0 && (a2 == 1 && a29 <= 43) && 0 < a29 + 144) || (a0 + 98 <= 0 && (2 <= a2 && a2 <= 2) && (\exists v_prenex_1 : int :: ((v_prenex_1 + 16) % 29 <= a29 + 16 && v_prenex_1 < 416279) && !((v_prenex_1 + 16) % 29 == 0)))) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && (\exists v_prenex_1 : int :: ((v_prenex_1 + 16) % 29 <= a29 + 16 && v_prenex_1 < 416279) && !((v_prenex_1 + 16) % 29 == 0)))) || (((2 <= a2 && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61))) && a4 + 42 <= 0) && (\exists v_prenex_1 : int :: ((v_prenex_1 + 16) % 29 <= a29 + 16 && v_prenex_1 < 416279) && !((v_prenex_1 + 16) % 29 == 0)))) || ((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0)) || ((((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61)) && a0 + 61 <= 0)) || ((2 <= a2 && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61))) && a2 <= 2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 < a0 + 147)) || (((((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61)) && a4 + 42 <= 0) && 3 == a2)) || (((((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61)) && a4 + 42 <= 0) && 4 == a2)) || (((2 <= a2 && a2 <= 2) && (\exists v_~a29~0_895 : int :: (((v_~a29~0_895 + -101) / 5 <= a29 + 32 && 0 < v_~a29~0_895 + 16) && v_~a29~0_895 < 101) && !(0 == (v_~a29~0_895 + 4) % 5))) && a4 + 86 <= 0) [2019-11-15 21:16:59,631 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2483a488-249d-4bc8-ac09-e166aad54607/bin/uautomizer/witness.graphml [2019-11-15 21:16:59,632 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:16:59,633 INFO L168 Benchmark]: Toolchain (without parser) took 68016.22 ms. Allocated memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: 2.3 GB). Free memory was 938.0 MB in the beginning and 927.2 MB in the end (delta: 10.8 MB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2019-11-15 21:16:59,633 INFO L168 Benchmark]: CDTParser took 0.21 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-15 21:16:59,634 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1374.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -119.5 MB). Peak memory consumption was 40.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:16:59,634 INFO L168 Benchmark]: Boogie Procedure Inliner took 167.05 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: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:16:59,634 INFO L168 Benchmark]: Boogie Preprocessor took 175.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:16:59,635 INFO L168 Benchmark]: RCFGBuilder took 5149.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 923.6 MB in the end (delta: 80.3 MB). Peak memory consumption was 160.2 MB. Max. memory is 11.5 GB. [2019-11-15 21:16:59,635 INFO L168 Benchmark]: TraceAbstraction took 60839.66 ms. Allocated memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: 2.2 GB). Free memory was 923.6 MB in the beginning and 1.0 GB in the end (delta: -114.3 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-11-15 21:16:59,635 INFO L168 Benchmark]: Witness Printer took 305.60 ms. Allocated memory is still 3.3 GB. Free memory was 1.0 GB in the beginning and 927.2 MB in the end (delta: 110.7 MB). Peak memory consumption was 110.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:16:59,638 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.21 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 1374.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -119.5 MB). Peak memory consumption was 40.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 167.05 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: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 175.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5149.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 923.6 MB in the end (delta: 80.3 MB). Peak memory consumption was 160.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 60839.66 ms. Allocated memory was 1.2 GB in the beginning and 3.3 GB in the end (delta: 2.2 GB). Free memory was 923.6 MB in the beginning and 1.0 GB in the end (delta: -114.3 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. * Witness Printer took 305.60 ms. Allocated memory is still 3.3 GB. Free memory was 1.0 GB in the beginning and 927.2 MB in the end (delta: 110.7 MB). Peak memory consumption was 110.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 181]: 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: 1766]: Loop Invariant [2019-11-15 21:16:59,655 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,655 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,656 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,656 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,656 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] Derived loop invariant: (((((((((((a4 + 42 <= 0 && (a2 == 1 && a29 <= 43) && 0 < a29 + 144) || (a0 + 98 <= 0 && (2 <= a2 && a2 <= 2) && (\exists v_prenex_1 : int :: ((v_prenex_1 + 16) % 29 <= a29 + 16 && v_prenex_1 < 416279) && !((v_prenex_1 + 16) % 29 == 0)))) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || ((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0)) || (((((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61)) && a4 + 42 <= 0) && 3 == a2)) || (((2 <= a2 && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61))) && a4 + 42 <= 0) && (\exists v_prenex_1 : int :: ((v_prenex_1 + 16) % 29 <= a29 + 16 && v_prenex_1 < 416279) && !((v_prenex_1 + 16) % 29 == 0)))) || ((((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61)) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 < a0 + 147)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 43 < a29)) || ((2 <= a2 && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61))) && a2 <= 2)) || (((((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61)) && a4 + 42 <= 0) && 4 == a2)) || (((2 <= a2 && a2 <= 2) && (\exists v_~a29~0_895 : int :: (((v_~a29~0_895 + -101) / 5 <= a29 + 32 && 0 < v_~a29~0_895 + 16) && v_~a29~0_895 < 101) && !(0 == (v_~a29~0_895 + 4) % 5))) && a4 + 86 <= 0) - InvariantResult [Line: 23]: Loop Invariant [2019-11-15 21:16:59,666 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,669 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,669 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,671 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,671 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,672 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,672 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,672 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] Derived loop invariant: (((((((((((a4 + 42 <= 0 && (a2 == 1 && a29 <= 43) && 0 < a29 + 144) || (a0 + 98 <= 0 && (2 <= a2 && a2 <= 2) && (\exists v_prenex_1 : int :: ((v_prenex_1 + 16) % 29 <= a29 + 16 && v_prenex_1 < 416279) && !((v_prenex_1 + 16) % 29 == 0)))) || ((a4 + 86 <= 0 && a2 == 1) && a29 + 144 <= 0)) || ((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0)) || (((((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61)) && a4 + 42 <= 0) && 3 == a2)) || (((2 <= a2 && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61))) && a4 + 42 <= 0) && (\exists v_prenex_1 : int :: ((v_prenex_1 + 16) % 29 <= a29 + 16 && v_prenex_1 < 416279) && !((v_prenex_1 + 16) % 29 == 0)))) || ((((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61)) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 < a0 + 147)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 43 < a29)) || ((2 <= a2 && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61))) && a2 <= 2)) || (((((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61)) && a4 + 42 <= 0) && 4 == a2)) || (((2 <= a2 && a2 <= 2) && (\exists v_~a29~0_895 : int :: (((v_~a29~0_895 + -101) / 5 <= a29 + 32 && 0 < v_~a29~0_895 + 16) && v_~a29~0_895 < 101) && !(0 == (v_~a29~0_895 + 4) % 5))) && a4 + 86 <= 0) - InvariantResult [Line: 1658]: Loop Invariant [2019-11-15 21:16:59,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,674 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,675 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,676 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,677 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,678 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,679 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2019-11-15 21:16:59,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] [2019-11-15 21:16:59,680 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_895,QUANTIFIED] Derived loop invariant: ((((((((((a4 + 42 <= 0 && (a2 == 1 && a29 <= 43) && 0 < a29 + 144) || (a0 + 98 <= 0 && (2 <= a2 && a2 <= 2) && (\exists v_prenex_1 : int :: ((v_prenex_1 + 16) % 29 <= a29 + 16 && v_prenex_1 < 416279) && !((v_prenex_1 + 16) % 29 == 0)))) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && (\exists v_prenex_1 : int :: ((v_prenex_1 + 16) % 29 <= a29 + 16 && v_prenex_1 < 416279) && !((v_prenex_1 + 16) % 29 == 0)))) || (((2 <= a2 && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61))) && a4 + 42 <= 0) && (\exists v_prenex_1 : int :: ((v_prenex_1 + 16) % 29 <= a29 + 16 && v_prenex_1 < 416279) && !((v_prenex_1 + 16) % 29 == 0)))) || ((2 <= a2 && a0 + 98 <= 0) && a4 + 42 <= 0)) || ((((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61)) && a0 + 61 <= 0)) || ((2 <= a2 && (((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61))) && a2 <= 2)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && a2 == 1) && 0 < a0 + 147)) || (((((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61)) && a4 + 42 <= 0) && 3 == a2)) || (((((a4 + 86 <= 0 && !(a2 == 2)) || (0 < a0 + 61 && a4 + 86 <= 0)) || (!(a2 == 2) && 0 < a0 + 61)) && a4 + 42 <= 0) && 4 == a2)) || (((2 <= a2 && a2 <= 2) && (\exists v_~a29~0_895 : int :: (((v_~a29~0_895 + -101) / 5 <= a29 + 32 && 0 < v_~a29~0_895 + 16) && v_~a29~0_895 < 101) && !(0 == (v_~a29~0_895 + 4) % 5))) && a4 + 86 <= 0) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. Result: SAFE, OverallTime: 60.7s, OverallIterations: 16, TraceHistogramMax: 6, AutomataDifference: 38.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.5s, HoareTripleCheckerStatistics: 4478 SDtfs, 7890 SDslu, 804 SDs, 0 SdLazy, 22286 SolverSat, 3669 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4509 GetRequests, 4429 SyntacticMatches, 21 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9904occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 8184 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 157 NumberOfFragments, 1148 HoareAnnotationTreeSize, 4 FomulaSimplifications, 18557 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 4 FomulaSimplificationsInter, 23816 FormulaSimplificationTreeSizeReductionInter, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 7.7s InterpolantComputationTime, 13724 NumberOfCodeBlocks, 13724 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 13701 ConstructedInterpolants, 112 QuantifiedInterpolants, 27044270 SizeOfPredicates, 8 NumberOfNonLiveVariables, 5162 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 23 InterpolantComputations, 15 PerfectInterpolantSequences, 14769/15256 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...