./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem15_label13.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_812b654c-938f-40a8-b874-9c039984b0d2/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_812b654c-938f-40a8-b874-9c039984b0d2/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_812b654c-938f-40a8-b874-9c039984b0d2/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_812b654c-938f-40a8-b874-9c039984b0d2/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem15_label13.c -s /tmp/vcloud-vcloud-master/worker/run_dir_812b654c-938f-40a8-b874-9c039984b0d2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_812b654c-938f-40a8-b874-9c039984b0d2/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 578a9aa08d4fb9af8adce08199c3eedf30155811 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-16 00:27:00,328 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:27:00,329 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:27:00,339 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:27:00,340 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:27:00,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:27:00,342 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:27:00,344 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:27:00,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:27:00,347 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:27:00,348 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:27:00,349 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:27:00,349 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:27:00,350 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:27:00,351 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:27:00,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:27:00,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:27:00,354 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:27:00,356 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:27:00,358 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:27:00,360 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:27:00,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:27:00,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:27:00,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:27:00,365 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:27:00,366 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:27:00,366 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:27:00,367 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:27:00,367 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:27:00,368 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:27:00,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:27:00,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:27:00,370 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:27:00,370 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:27:00,371 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:27:00,371 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:27:00,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:27:00,372 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:27:00,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:27:00,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:27:00,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:27:00,375 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_812b654c-938f-40a8-b874-9c039984b0d2/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:27:00,388 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:27:00,388 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:27:00,389 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:27:00,389 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:27:00,390 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:27:00,390 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:27:00,390 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:27:00,390 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:27:00,391 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:27:00,391 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:27:00,391 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:27:00,391 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:27:00,392 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:27:00,392 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:27:00,392 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:27:00,392 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:27:00,393 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:27:00,393 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:27:00,393 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:27:00,393 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:27:00,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:27:00,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:27:00,394 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:27:00,394 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:27:00,395 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:27:00,395 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:27:00,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:27:00,395 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:27:00,396 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_812b654c-938f-40a8-b874-9c039984b0d2/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 -> 578a9aa08d4fb9af8adce08199c3eedf30155811 [2019-11-16 00:27:00,426 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:27:00,436 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:27:00,439 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:27:00,440 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:27:00,440 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:27:00,441 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_812b654c-938f-40a8-b874-9c039984b0d2/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem15_label13.c [2019-11-16 00:27:00,505 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_812b654c-938f-40a8-b874-9c039984b0d2/bin/uautomizer/data/f3d689ded/522195511b7943099bee4c25e2cf94ad/FLAGc1d66ff8c [2019-11-16 00:27:01,069 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:27:01,070 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_812b654c-938f-40a8-b874-9c039984b0d2/sv-benchmarks/c/eca-rers2012/Problem15_label13.c [2019-11-16 00:27:01,091 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_812b654c-938f-40a8-b874-9c039984b0d2/bin/uautomizer/data/f3d689ded/522195511b7943099bee4c25e2cf94ad/FLAGc1d66ff8c [2019-11-16 00:27:01,299 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_812b654c-938f-40a8-b874-9c039984b0d2/bin/uautomizer/data/f3d689ded/522195511b7943099bee4c25e2cf94ad [2019-11-16 00:27:01,301 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:27:01,302 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:27:01,304 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:27:01,304 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:27:01,311 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:27:01,312 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:27:01" (1/1) ... [2019-11-16 00:27:01,314 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d4a4101 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:01, skipping insertion in model container [2019-11-16 00:27:01,314 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:27:01" (1/1) ... [2019-11-16 00:27:01,321 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:27:01,392 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:27:02,205 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:27:02,210 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:27:02,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:27:02,494 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:27:02,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:02 WrapperNode [2019-11-16 00:27:02,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:27:02,495 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:27:02,495 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:27:02,496 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:27:02,504 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:02" (1/1) ... [2019-11-16 00:27:02,547 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:02" (1/1) ... [2019-11-16 00:27:02,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:27:02,696 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:27:02,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:27:02,696 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:27:02,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:02" (1/1) ... [2019-11-16 00:27:02,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:02" (1/1) ... [2019-11-16 00:27:02,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:02" (1/1) ... [2019-11-16 00:27:02,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:02" (1/1) ... [2019-11-16 00:27:02,814 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:02" (1/1) ... [2019-11-16 00:27:02,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:02" (1/1) ... [2019-11-16 00:27:02,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:02" (1/1) ... [2019-11-16 00:27:02,910 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:27:02,911 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:27:02,911 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:27:02,912 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:27:02,912 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_812b654c-938f-40a8-b874-9c039984b0d2/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-16 00:27:02,971 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:27:02,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:27:06,272 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:27:06,272 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-16 00:27:06,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:27:06 BoogieIcfgContainer [2019-11-16 00:27:06,274 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:27:06,275 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:27:06,275 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:27:06,279 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:27:06,279 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:27:01" (1/3) ... [2019-11-16 00:27:06,280 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea46b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:27:06, skipping insertion in model container [2019-11-16 00:27:06,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:27:02" (2/3) ... [2019-11-16 00:27:06,281 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ea46b1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:27:06, skipping insertion in model container [2019-11-16 00:27:06,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:27:06" (3/3) ... [2019-11-16 00:27:06,283 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem15_label13.c [2019-11-16 00:27:06,291 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:27:06,299 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:27:06,309 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:27:06,348 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:27:06,348 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:27:06,349 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:27:06,349 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:27:06,349 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:27:06,349 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:27:06,349 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:27:06,350 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:27:06,376 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-11-16 00:27:06,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-16 00:27:06,384 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:06,385 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] [2019-11-16 00:27:06,386 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:06,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:06,392 INFO L82 PathProgramCache]: Analyzing trace with hash 563919826, now seen corresponding path program 1 times [2019-11-16 00:27:06,399 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:06,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921760730] [2019-11-16 00:27:06,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:06,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:06,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:06,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:06,708 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-16 00:27:06,708 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921760730] [2019-11-16 00:27:06,709 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:06,710 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:27:06,710 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943736839] [2019-11-16 00:27:06,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:27:06,714 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:06,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:27:06,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:27:06,729 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-11-16 00:27:11,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:11,421 INFO L93 Difference]: Finished difference Result 1506 states and 2774 transitions. [2019-11-16 00:27:11,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:27:11,423 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-16 00:27:11,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:11,456 INFO L225 Difference]: With dead ends: 1506 [2019-11-16 00:27:11,456 INFO L226 Difference]: Without dead ends: 1000 [2019-11-16 00:27:11,465 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-16 00:27:11,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2019-11-16 00:27:11,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 680. [2019-11-16 00:27:11,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 680 states. [2019-11-16 00:27:11,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 1086 transitions. [2019-11-16 00:27:11,541 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 1086 transitions. Word has length 48 [2019-11-16 00:27:11,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:11,542 INFO L462 AbstractCegarLoop]: Abstraction has 680 states and 1086 transitions. [2019-11-16 00:27:11,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:27:11,542 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 1086 transitions. [2019-11-16 00:27:11,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-16 00:27:11,547 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:11,547 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, 1, 1, 1, 1, 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-16 00:27:11,548 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:11,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:11,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1328017793, now seen corresponding path program 1 times [2019-11-16 00:27:11,548 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:11,548 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574501489] [2019-11-16 00:27:11,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:11,549 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:11,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:11,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:11,769 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:27:11,770 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574501489] [2019-11-16 00:27:11,770 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:11,770 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:27:11,771 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848996270] [2019-11-16 00:27:11,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:27:11,772 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:11,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:27:11,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:27:11,773 INFO L87 Difference]: Start difference. First operand 680 states and 1086 transitions. Second operand 4 states. [2019-11-16 00:27:14,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:14,554 INFO L93 Difference]: Finished difference Result 2561 states and 4133 transitions. [2019-11-16 00:27:14,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:27:14,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-11-16 00:27:14,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:14,565 INFO L225 Difference]: With dead ends: 2561 [2019-11-16 00:27:14,565 INFO L226 Difference]: Without dead ends: 1883 [2019-11-16 00:27:14,567 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-16 00:27:14,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2019-11-16 00:27:14,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1278. [2019-11-16 00:27:14,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1278 states. [2019-11-16 00:27:14,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1775 transitions. [2019-11-16 00:27:14,606 INFO L78 Accepts]: Start accepts. Automaton has 1278 states and 1775 transitions. Word has length 116 [2019-11-16 00:27:14,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:14,606 INFO L462 AbstractCegarLoop]: Abstraction has 1278 states and 1775 transitions. [2019-11-16 00:27:14,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:27:14,607 INFO L276 IsEmpty]: Start isEmpty. Operand 1278 states and 1775 transitions. [2019-11-16 00:27:14,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-11-16 00:27:14,611 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:14,611 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:27:14,612 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:14,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:14,612 INFO L82 PathProgramCache]: Analyzing trace with hash 851098733, now seen corresponding path program 1 times [2019-11-16 00:27:14,612 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:14,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872677134] [2019-11-16 00:27:14,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:14,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:14,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:14,891 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:27:14,892 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872677134] [2019-11-16 00:27:14,892 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:14,892 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:27:14,893 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140657675] [2019-11-16 00:27:14,893 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:27:14,893 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:14,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:27:14,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:27:14,894 INFO L87 Difference]: Start difference. First operand 1278 states and 1775 transitions. Second operand 6 states. [2019-11-16 00:27:20,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:20,338 INFO L93 Difference]: Finished difference Result 5270 states and 7256 transitions. [2019-11-16 00:27:20,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:27:20,339 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 124 [2019-11-16 00:27:20,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:20,360 INFO L225 Difference]: With dead ends: 5270 [2019-11-16 00:27:20,360 INFO L226 Difference]: Without dead ends: 3994 [2019-11-16 00:27:20,362 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:27:20,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3994 states. [2019-11-16 00:27:20,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3994 to 3382. [2019-11-16 00:27:20,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3382 states. [2019-11-16 00:27:20,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3382 states to 3382 states and 4279 transitions. [2019-11-16 00:27:20,516 INFO L78 Accepts]: Start accepts. Automaton has 3382 states and 4279 transitions. Word has length 124 [2019-11-16 00:27:20,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:20,518 INFO L462 AbstractCegarLoop]: Abstraction has 3382 states and 4279 transitions. [2019-11-16 00:27:20,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:27:20,518 INFO L276 IsEmpty]: Start isEmpty. Operand 3382 states and 4279 transitions. [2019-11-16 00:27:20,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-11-16 00:27:20,525 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:20,525 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, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:27:20,526 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:20,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:20,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1777642279, now seen corresponding path program 1 times [2019-11-16 00:27:20,526 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:20,526 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423166999] [2019-11-16 00:27:20,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:20,526 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:20,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:20,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:20,948 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 162 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:27:20,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423166999] [2019-11-16 00:27:20,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119473328] [2019-11-16 00:27:20,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_812b654c-938f-40a8-b874-9c039984b0d2/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-16 00:27:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:21,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-16 00:27:21,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:21,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:27:21,284 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 91 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:27:21,285 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:27:21,285 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-11-16 00:27:21,285 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068899942] [2019-11-16 00:27:21,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-16 00:27:21,286 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:21,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:27:21,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:27:21,286 INFO L87 Difference]: Start difference. First operand 3382 states and 4279 transitions. Second operand 12 states. [2019-11-16 00:27:30,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:30,188 INFO L93 Difference]: Finished difference Result 10825 states and 13811 transitions. [2019-11-16 00:27:30,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:27:30,189 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 215 [2019-11-16 00:27:30,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:30,215 INFO L225 Difference]: With dead ends: 10825 [2019-11-16 00:27:30,215 INFO L226 Difference]: Without dead ends: 5794 [2019-11-16 00:27:30,221 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:27:30,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5794 states. [2019-11-16 00:27:30,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5794 to 4890. [2019-11-16 00:27:30,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4890 states. [2019-11-16 00:27:30,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4890 states to 4890 states and 5606 transitions. [2019-11-16 00:27:30,313 INFO L78 Accepts]: Start accepts. Automaton has 4890 states and 5606 transitions. Word has length 215 [2019-11-16 00:27:30,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:30,314 INFO L462 AbstractCegarLoop]: Abstraction has 4890 states and 5606 transitions. [2019-11-16 00:27:30,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-16 00:27:30,314 INFO L276 IsEmpty]: Start isEmpty. Operand 4890 states and 5606 transitions. [2019-11-16 00:27:30,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-11-16 00:27:30,319 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:30,320 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:27:30,523 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:27:30,523 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:30,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:30,524 INFO L82 PathProgramCache]: Analyzing trace with hash 350709814, now seen corresponding path program 1 times [2019-11-16 00:27:30,524 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:30,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374839597] [2019-11-16 00:27:30,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:30,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:30,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:30,843 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 45 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:27:30,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374839597] [2019-11-16 00:27:30,844 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:30,844 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:27:30,844 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664110104] [2019-11-16 00:27:30,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:27:30,845 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:30,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:27:30,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:27:30,845 INFO L87 Difference]: Start difference. First operand 4890 states and 5606 transitions. Second operand 4 states. [2019-11-16 00:27:34,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:34,225 INFO L93 Difference]: Finished difference Result 14866 states and 17358 transitions. [2019-11-16 00:27:34,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:27:34,226 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 330 [2019-11-16 00:27:34,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:34,264 INFO L225 Difference]: With dead ends: 14866 [2019-11-16 00:27:34,264 INFO L226 Difference]: Without dead ends: 9978 [2019-11-16 00:27:34,270 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:27:34,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9978 states. [2019-11-16 00:27:34,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9978 to 8775. [2019-11-16 00:27:34,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8775 states. [2019-11-16 00:27:34,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8775 states to 8775 states and 10021 transitions. [2019-11-16 00:27:34,434 INFO L78 Accepts]: Start accepts. Automaton has 8775 states and 10021 transitions. Word has length 330 [2019-11-16 00:27:34,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:34,435 INFO L462 AbstractCegarLoop]: Abstraction has 8775 states and 10021 transitions. [2019-11-16 00:27:34,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:27:34,435 INFO L276 IsEmpty]: Start isEmpty. Operand 8775 states and 10021 transitions. [2019-11-16 00:27:34,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2019-11-16 00:27:34,445 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:34,446 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, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:27:34,446 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:34,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:34,447 INFO L82 PathProgramCache]: Analyzing trace with hash -817019640, now seen corresponding path program 1 times [2019-11-16 00:27:34,447 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:34,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411104471] [2019-11-16 00:27:34,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:34,447 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:34,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:35,074 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 277 proven. 11 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-16 00:27:35,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411104471] [2019-11-16 00:27:35,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864811643] [2019-11-16 00:27:35,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_812b654c-938f-40a8-b874-9c039984b0d2/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-16 00:27:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:35,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:27:35,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-11-16 00:27:35,539 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:27:35,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2019-11-16 00:27:35,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887103418] [2019-11-16 00:27:35,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:27:35,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:35,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:27:35,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:27:35,542 INFO L87 Difference]: Start difference. First operand 8775 states and 10021 transitions. Second operand 3 states. [2019-11-16 00:27:36,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:36,980 INFO L93 Difference]: Finished difference Result 19043 states and 21857 transitions. [2019-11-16 00:27:36,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:27:36,983 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 501 [2019-11-16 00:27:36,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:37,022 INFO L225 Difference]: With dead ends: 19043 [2019-11-16 00:27:37,022 INFO L226 Difference]: Without dead ends: 10270 [2019-11-16 00:27:37,030 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 513 GetRequests, 501 SyntacticMatches, 6 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:27:37,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10270 states. [2019-11-16 00:27:37,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10270 to 9971. [2019-11-16 00:27:37,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9971 states. [2019-11-16 00:27:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9971 states to 9971 states and 11433 transitions. [2019-11-16 00:27:37,168 INFO L78 Accepts]: Start accepts. Automaton has 9971 states and 11433 transitions. Word has length 501 [2019-11-16 00:27:37,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:37,169 INFO L462 AbstractCegarLoop]: Abstraction has 9971 states and 11433 transitions. [2019-11-16 00:27:37,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:27:37,169 INFO L276 IsEmpty]: Start isEmpty. Operand 9971 states and 11433 transitions. [2019-11-16 00:27:37,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 508 [2019-11-16 00:27:37,180 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:37,182 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:27:37,385 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:27:37,393 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:37,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:37,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1138954628, now seen corresponding path program 1 times [2019-11-16 00:27:37,393 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:37,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886575248] [2019-11-16 00:27:37,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:37,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:37,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:37,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:38,249 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2019-11-16 00:27:38,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886575248] [2019-11-16 00:27:38,250 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656826931] [2019-11-16 00:27:38,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_812b654c-938f-40a8-b874-9c039984b0d2/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-16 00:27:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:38,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:27:38,397 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:38,782 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2019-11-16 00:27:38,782 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:27:38,783 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-11-16 00:27:38,783 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908956381] [2019-11-16 00:27:38,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:27:38,785 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:38,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:27:38,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:27:38,786 INFO L87 Difference]: Start difference. First operand 9971 states and 11433 transitions. Second operand 3 states. [2019-11-16 00:27:40,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:40,234 INFO L93 Difference]: Finished difference Result 22337 states and 25426 transitions. [2019-11-16 00:27:40,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:27:40,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 507 [2019-11-16 00:27:40,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:40,256 INFO L225 Difference]: With dead ends: 22337 [2019-11-16 00:27:40,257 INFO L226 Difference]: Without dead ends: 12368 [2019-11-16 00:27:40,266 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 509 GetRequests, 507 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-16 00:27:40,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12368 states. [2019-11-16 00:27:40,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12368 to 11768. [2019-11-16 00:27:40,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11768 states. [2019-11-16 00:27:40,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11768 states to 11768 states and 13301 transitions. [2019-11-16 00:27:40,533 INFO L78 Accepts]: Start accepts. Automaton has 11768 states and 13301 transitions. Word has length 507 [2019-11-16 00:27:40,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:40,534 INFO L462 AbstractCegarLoop]: Abstraction has 11768 states and 13301 transitions. [2019-11-16 00:27:40,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:27:40,534 INFO L276 IsEmpty]: Start isEmpty. Operand 11768 states and 13301 transitions. [2019-11-16 00:27:40,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2019-11-16 00:27:40,553 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:40,553 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, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-16 00:27:40,756 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:27:40,757 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:40,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:40,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1745026675, now seen corresponding path program 1 times [2019-11-16 00:27:40,757 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:40,757 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744339603] [2019-11-16 00:27:40,757 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:40,758 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:40,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:41,127 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 512 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2019-11-16 00:27:41,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744339603] [2019-11-16 00:27:41,128 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:41,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:27:41,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525056739] [2019-11-16 00:27:41,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:27:41,129 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:41,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:27:41,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:27:41,130 INFO L87 Difference]: Start difference. First operand 11768 states and 13301 transitions. Second operand 4 states. [2019-11-16 00:27:43,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:43,105 INFO L93 Difference]: Finished difference Result 23238 states and 26294 transitions. [2019-11-16 00:27:43,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:27:43,105 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 576 [2019-11-16 00:27:43,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:43,119 INFO L225 Difference]: With dead ends: 23238 [2019-11-16 00:27:43,120 INFO L226 Difference]: Without dead ends: 11472 [2019-11-16 00:27:43,129 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-16 00:27:43,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11472 states. [2019-11-16 00:27:43,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11472 to 11163. [2019-11-16 00:27:43,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11163 states. [2019-11-16 00:27:43,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11163 states to 11163 states and 12310 transitions. [2019-11-16 00:27:43,257 INFO L78 Accepts]: Start accepts. Automaton has 11163 states and 12310 transitions. Word has length 576 [2019-11-16 00:27:43,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:43,258 INFO L462 AbstractCegarLoop]: Abstraction has 11163 states and 12310 transitions. [2019-11-16 00:27:43,259 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:27:43,259 INFO L276 IsEmpty]: Start isEmpty. Operand 11163 states and 12310 transitions. [2019-11-16 00:27:43,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2019-11-16 00:27:43,266 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:43,267 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:27:43,267 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:43,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:43,268 INFO L82 PathProgramCache]: Analyzing trace with hash -964489000, now seen corresponding path program 1 times [2019-11-16 00:27:43,268 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:43,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702830931] [2019-11-16 00:27:43,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:43,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:43,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:43,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:43,886 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 373 trivial. 0 not checked. [2019-11-16 00:27:43,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702830931] [2019-11-16 00:27:43,887 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:43,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:27:43,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130143849] [2019-11-16 00:27:43,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:27:43,889 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:43,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:27:43,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:27:43,891 INFO L87 Difference]: Start difference. First operand 11163 states and 12310 transitions. Second operand 3 states. [2019-11-16 00:27:46,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:46,402 INFO L93 Difference]: Finished difference Result 28899 states and 32051 transitions. [2019-11-16 00:27:46,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:27:46,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 586 [2019-11-16 00:27:46,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:46,420 INFO L225 Difference]: With dead ends: 28899 [2019-11-16 00:27:46,420 INFO L226 Difference]: Without dead ends: 17738 [2019-11-16 00:27:46,430 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-16 00:27:46,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17738 states. [2019-11-16 00:27:46,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17738 to 13849. [2019-11-16 00:27:46,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13849 states. [2019-11-16 00:27:46,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13849 states to 13849 states and 15513 transitions. [2019-11-16 00:27:46,607 INFO L78 Accepts]: Start accepts. Automaton has 13849 states and 15513 transitions. Word has length 586 [2019-11-16 00:27:46,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:46,608 INFO L462 AbstractCegarLoop]: Abstraction has 13849 states and 15513 transitions. [2019-11-16 00:27:46,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:27:46,608 INFO L276 IsEmpty]: Start isEmpty. Operand 13849 states and 15513 transitions. [2019-11-16 00:27:46,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2019-11-16 00:27:46,617 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:46,619 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, 4, 4, 4, 4, 4, 4, 4, 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, 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-16 00:27:46,619 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:46,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:46,620 INFO L82 PathProgramCache]: Analyzing trace with hash -2025829424, now seen corresponding path program 1 times [2019-11-16 00:27:46,620 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:46,620 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501878535] [2019-11-16 00:27:46,620 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:46,621 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:46,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:46,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:46,984 INFO L134 CoverageAnalysis]: Checked inductivity of 744 backedges. 364 proven. 0 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2019-11-16 00:27:46,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501878535] [2019-11-16 00:27:46,984 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:46,984 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:27:46,985 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2107512810] [2019-11-16 00:27:46,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:27:46,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:46,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:27:46,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:27:46,986 INFO L87 Difference]: Start difference. First operand 13849 states and 15513 transitions. Second operand 3 states. [2019-11-16 00:27:48,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:48,159 INFO L93 Difference]: Finished difference Result 27993 states and 31368 transitions. [2019-11-16 00:27:48,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:27:48,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 625 [2019-11-16 00:27:48,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:48,173 INFO L225 Difference]: With dead ends: 27993 [2019-11-16 00:27:48,173 INFO L226 Difference]: Without dead ends: 14146 [2019-11-16 00:27:48,183 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-16 00:27:48,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14146 states. [2019-11-16 00:27:48,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14146 to 13847. [2019-11-16 00:27:48,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13847 states. [2019-11-16 00:27:48,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13847 states to 13847 states and 15509 transitions. [2019-11-16 00:27:48,454 INFO L78 Accepts]: Start accepts. Automaton has 13847 states and 15509 transitions. Word has length 625 [2019-11-16 00:27:48,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:48,455 INFO L462 AbstractCegarLoop]: Abstraction has 13847 states and 15509 transitions. [2019-11-16 00:27:48,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:27:48,455 INFO L276 IsEmpty]: Start isEmpty. Operand 13847 states and 15509 transitions. [2019-11-16 00:27:48,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2019-11-16 00:27:48,464 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:48,464 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:27:48,465 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:48,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:48,465 INFO L82 PathProgramCache]: Analyzing trace with hash -431846777, now seen corresponding path program 1 times [2019-11-16 00:27:48,465 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:48,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063937700] [2019-11-16 00:27:48,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:48,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:48,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:48,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:48,909 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 137 proven. 0 refuted. 0 times theorem prover too weak. 416 trivial. 0 not checked. [2019-11-16 00:27:48,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063937700] [2019-11-16 00:27:48,909 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:27:48,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:27:48,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372456159] [2019-11-16 00:27:48,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:27:48,911 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:48,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:27:48,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:27:48,911 INFO L87 Difference]: Start difference. First operand 13847 states and 15509 transitions. Second operand 3 states. [2019-11-16 00:27:50,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:27:50,155 INFO L93 Difference]: Finished difference Result 30083 states and 33866 transitions. [2019-11-16 00:27:50,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:27:50,156 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 631 [2019-11-16 00:27:50,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:27:50,171 INFO L225 Difference]: With dead ends: 30083 [2019-11-16 00:27:50,171 INFO L226 Difference]: Without dead ends: 16238 [2019-11-16 00:27:50,179 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-16 00:27:50,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16238 states. [2019-11-16 00:27:50,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16238 to 15042. [2019-11-16 00:27:50,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15042 states. [2019-11-16 00:27:50,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15042 states to 15042 states and 16814 transitions. [2019-11-16 00:27:50,337 INFO L78 Accepts]: Start accepts. Automaton has 15042 states and 16814 transitions. Word has length 631 [2019-11-16 00:27:50,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:27:50,338 INFO L462 AbstractCegarLoop]: Abstraction has 15042 states and 16814 transitions. [2019-11-16 00:27:50,338 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:27:50,338 INFO L276 IsEmpty]: Start isEmpty. Operand 15042 states and 16814 transitions. [2019-11-16 00:27:50,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2019-11-16 00:27:50,353 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:27:50,354 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:27:50,354 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:27:50,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:27:50,354 INFO L82 PathProgramCache]: Analyzing trace with hash 603125184, now seen corresponding path program 1 times [2019-11-16 00:27:50,355 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:27:50,355 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250259827] [2019-11-16 00:27:50,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:50,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:27:50,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:27:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:53,265 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 159 proven. 830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:27:53,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250259827] [2019-11-16 00:27:53,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [703842536] [2019-11-16 00:27:53,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_812b654c-938f-40a8-b874-9c039984b0d2/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-16 00:27:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:27:53,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 904 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-16 00:27:53,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:27:53,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-16 00:27:53,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:53,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:53,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:53,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:27:54,312 INFO L134 CoverageAnalysis]: Checked inductivity of 989 backedges. 596 proven. 46 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-11-16 00:27:54,312 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:27:54,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 5] total 19 [2019-11-16 00:27:54,313 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200471451] [2019-11-16 00:27:54,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-16 00:27:54,314 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:27:54,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-16 00:27:54,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2019-11-16 00:27:54,315 INFO L87 Difference]: Start difference. First operand 15042 states and 16814 transitions. Second operand 19 states. [2019-11-16 00:28:25,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:25,848 INFO L93 Difference]: Finished difference Result 50182 states and 55271 transitions. [2019-11-16 00:28:25,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2019-11-16 00:28:25,848 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 780 [2019-11-16 00:28:25,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:25,875 INFO L225 Difference]: With dead ends: 50182 [2019-11-16 00:28:25,875 INFO L226 Difference]: Without dead ends: 35142 [2019-11-16 00:28:25,882 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 882 GetRequests, 815 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1250 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=640, Invalid=3916, Unknown=0, NotChecked=0, Total=4556 [2019-11-16 00:28:25,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35142 states. [2019-11-16 00:28:26,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35142 to 20428. [2019-11-16 00:28:26,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20428 states. [2019-11-16 00:28:26,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20428 states to 20428 states and 22403 transitions. [2019-11-16 00:28:26,140 INFO L78 Accepts]: Start accepts. Automaton has 20428 states and 22403 transitions. Word has length 780 [2019-11-16 00:28:26,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:26,141 INFO L462 AbstractCegarLoop]: Abstraction has 20428 states and 22403 transitions. [2019-11-16 00:28:26,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-16 00:28:26,141 INFO L276 IsEmpty]: Start isEmpty. Operand 20428 states and 22403 transitions. [2019-11-16 00:28:26,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 799 [2019-11-16 00:28:26,157 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:26,158 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2019-11-16 00:28:26,364 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:28:26,364 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:26,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:26,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1010886192, now seen corresponding path program 1 times [2019-11-16 00:28:26,365 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:26,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220103870] [2019-11-16 00:28:26,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:26,365 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:26,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:27,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1032 backedges. 650 proven. 0 refuted. 0 times theorem prover too weak. 382 trivial. 0 not checked. [2019-11-16 00:28:27,196 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220103870] [2019-11-16 00:28:27,196 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:27,196 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:28:27,196 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319786950] [2019-11-16 00:28:27,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:28:27,197 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:27,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:28:27,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:28:27,198 INFO L87 Difference]: Start difference. First operand 20428 states and 22403 transitions. Second operand 5 states. [2019-11-16 00:28:30,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:30,511 INFO L93 Difference]: Finished difference Result 50474 states and 55443 transitions. [2019-11-16 00:28:30,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:28:30,512 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 798 [2019-11-16 00:28:30,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:30,535 INFO L225 Difference]: With dead ends: 50474 [2019-11-16 00:28:30,535 INFO L226 Difference]: Without dead ends: 30048 [2019-11-16 00:28:30,547 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:28:30,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30048 states. [2019-11-16 00:28:30,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30048 to 24024. [2019-11-16 00:28:30,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24024 states. [2019-11-16 00:28:30,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24024 states to 24024 states and 26362 transitions. [2019-11-16 00:28:30,789 INFO L78 Accepts]: Start accepts. Automaton has 24024 states and 26362 transitions. Word has length 798 [2019-11-16 00:28:30,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:30,790 INFO L462 AbstractCegarLoop]: Abstraction has 24024 states and 26362 transitions. [2019-11-16 00:28:30,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:28:30,790 INFO L276 IsEmpty]: Start isEmpty. Operand 24024 states and 26362 transitions. [2019-11-16 00:28:30,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1080 [2019-11-16 00:28:30,816 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:30,817 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:28:30,818 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:30,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:30,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1543420195, now seen corresponding path program 1 times [2019-11-16 00:28:30,818 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:30,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79843027] [2019-11-16 00:28:30,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:30,819 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:30,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:32,068 INFO L134 CoverageAnalysis]: Checked inductivity of 2210 backedges. 1433 proven. 561 refuted. 0 times theorem prover too weak. 216 trivial. 0 not checked. [2019-11-16 00:28:32,068 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79843027] [2019-11-16 00:28:32,068 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1289236615] [2019-11-16 00:28:32,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_812b654c-938f-40a8-b874-9c039984b0d2/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-16 00:28:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:32,275 INFO L256 TraceCheckSpWp]: Trace formula consists of 1255 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-16 00:28:32,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:28:32,304 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:33,032 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a29~0_896 Int)) (let ((.cse0 (mod (+ v_~a29~0_896 17705) 299928))) (and (<= .cse0 (+ c_~a29~0 300071)) (= .cse0 0)))) (exists ((v_~a29~0_896 Int)) (and (<= 0 (+ v_~a29~0_896 317633)) (<= (mod (+ v_~a29~0_896 17705) 299928) (+ c_~a29~0 300071)))) (exists ((v_prenex_2 Int)) (let ((.cse1 (mod (+ v_prenex_2 17705) 299928))) (and (< (+ v_prenex_2 317633) 0) (<= .cse1 (+ c_~a29~0 599999)) (not (= .cse1 0)))))) is different from true [2019-11-16 00:28:33,539 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a29~0_896 Int)) (let ((.cse0 (mod (+ v_~a29~0_896 17705) 299928))) (and (<= .cse0 (+ c_~a29~0 300071)) (= .cse0 0)))) (exists ((v_prenex_3 Int)) (and (<= (mod (+ v_prenex_3 17705) 299928) (+ c_~a29~0 300071)) (<= 0 (+ v_prenex_3 317633)))) (exists ((v_prenex_2 Int)) (let ((.cse1 (mod (+ v_prenex_2 17705) 299928))) (and (< (+ v_prenex_2 317633) 0) (<= .cse1 (+ c_~a29~0 599999)) (not (= .cse1 0)))))) is different from true [2019-11-16 00:28:33,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:33,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:28:33,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:28:33,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:28:33,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-16 00:28:36,710 INFO L134 CoverageAnalysis]: Checked inductivity of 2210 backedges. 949 proven. 0 refuted. 0 times theorem prover too weak. 1215 trivial. 46 not checked. [2019-11-16 00:28:36,710 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:28:36,711 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 10 [2019-11-16 00:28:36,711 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210857312] [2019-11-16 00:28:36,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-16 00:28:36,713 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:36,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-16 00:28:36,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=38, Unknown=2, NotChecked=26, Total=90 [2019-11-16 00:28:36,713 INFO L87 Difference]: Start difference. First operand 24024 states and 26362 transitions. Second operand 10 states. [2019-11-16 00:28:46,036 WARN L191 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 39 DAG size of output: 25 [2019-11-16 00:28:51,417 WARN L191 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 36 DAG size of output: 22 [2019-11-16 00:28:53,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:53,107 INFO L93 Difference]: Finished difference Result 55876 states and 60623 transitions. [2019-11-16 00:28:53,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:28:53,107 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1079 [2019-11-16 00:28:53,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:53,129 INFO L225 Difference]: With dead ends: 55876 [2019-11-16 00:28:53,130 INFO L226 Difference]: Without dead ends: 24080 [2019-11-16 00:28:53,143 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 1104 GetRequests, 1085 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=101, Invalid=174, Unknown=5, NotChecked=62, Total=342 [2019-11-16 00:28:53,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24080 states. [2019-11-16 00:28:53,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24080 to 14584. [2019-11-16 00:28:53,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14584 states. [2019-11-16 00:28:53,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14584 states to 14584 states and 15135 transitions. [2019-11-16 00:28:53,297 INFO L78 Accepts]: Start accepts. Automaton has 14584 states and 15135 transitions. Word has length 1079 [2019-11-16 00:28:53,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:53,298 INFO L462 AbstractCegarLoop]: Abstraction has 14584 states and 15135 transitions. [2019-11-16 00:28:53,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-16 00:28:53,298 INFO L276 IsEmpty]: Start isEmpty. Operand 14584 states and 15135 transitions. [2019-11-16 00:28:53,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1321 [2019-11-16 00:28:53,320 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:28:53,320 INFO L380 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:28:53,523 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:28:53,523 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:28:53,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:28:53,524 INFO L82 PathProgramCache]: Analyzing trace with hash -724490526, now seen corresponding path program 1 times [2019-11-16 00:28:53,524 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:28:53,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875475060] [2019-11-16 00:28:53,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:53,524 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:28:53,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:28:53,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:28:54,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2904 backedges. 1656 proven. 0 refuted. 0 times theorem prover too weak. 1248 trivial. 0 not checked. [2019-11-16 00:28:54,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875475060] [2019-11-16 00:28:54,819 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:28:54,819 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:28:54,819 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561450032] [2019-11-16 00:28:54,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:28:54,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:28:54,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:28:54,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:28:54,820 INFO L87 Difference]: Start difference. First operand 14584 states and 15135 transitions. Second operand 3 states. [2019-11-16 00:28:55,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:28:55,681 INFO L93 Difference]: Finished difference Result 27176 states and 28188 transitions. [2019-11-16 00:28:55,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:28:55,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1320 [2019-11-16 00:28:55,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:28:55,683 INFO L225 Difference]: With dead ends: 27176 [2019-11-16 00:28:55,683 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:28:55,688 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-16 00:28:55,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:28:55,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:28:55,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:28:55,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:28:55,688 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1320 [2019-11-16 00:28:55,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:28:55,689 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:28:55,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:28:55,689 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:28:55,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:28:55,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:28:56,632 WARN L191 SmtUtils]: Spent 935.00 ms on a formula simplification. DAG size of input: 535 DAG size of output: 410 [2019-11-16 00:28:57,341 WARN L191 SmtUtils]: Spent 707.00 ms on a formula simplification. DAG size of input: 535 DAG size of output: 410 [2019-11-16 00:28:57,782 WARN L191 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 449 DAG size of output: 369 [2019-11-16 00:29:00,607 WARN L191 SmtUtils]: Spent 2.82 s on a formula simplification. DAG size of input: 377 DAG size of output: 115 [2019-11-16 00:29:06,353 WARN L191 SmtUtils]: Spent 5.74 s on a formula simplification. DAG size of input: 377 DAG size of output: 115 [2019-11-16 00:29:13,262 WARN L191 SmtUtils]: Spent 6.91 s on a formula simplification. DAG size of input: 353 DAG size of output: 120 [2019-11-16 00:29:13,264 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,264 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,264 INFO L443 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,264 INFO L443 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,264 INFO L443 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-11-16 00:29:13,264 INFO L443 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,264 INFO L443 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,264 INFO L443 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,264 INFO L443 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,264 INFO L443 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,264 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,264 INFO L443 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-11-16 00:29:13,265 INFO L443 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,265 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,265 INFO L443 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,265 INFO L443 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-11-16 00:29:13,265 INFO L443 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,265 INFO L443 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,265 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-11-16 00:29:13,265 INFO L443 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,265 INFO L443 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,265 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,265 INFO L443 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,265 INFO L443 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,265 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,265 INFO L443 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-16 00:29:13,265 INFO L443 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,265 INFO L443 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,265 INFO L443 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,266 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,266 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-11-16 00:29:13,266 INFO L443 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-11-16 00:29:13,266 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,266 INFO L443 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,266 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,266 INFO L443 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,266 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-11-16 00:29:13,266 INFO L443 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-11-16 00:29:13,266 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,266 INFO L443 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,266 INFO L443 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,266 INFO L443 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,266 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,266 INFO L443 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-11-16 00:29:13,266 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,266 INFO L443 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-11-16 00:29:13,267 INFO L443 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-11-16 00:29:13,267 INFO L443 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-11-16 00:29:13,267 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-16 00:29:13,267 INFO L443 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,267 INFO L443 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,267 INFO L443 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,267 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,267 INFO L443 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,267 INFO L443 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-11-16 00:29:13,267 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,267 INFO L443 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,267 INFO L443 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-11-16 00:29:13,267 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,267 INFO L443 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-11-16 00:29:13,267 INFO L443 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,267 INFO L443 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,268 INFO L443 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,268 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-11-16 00:29:13,268 INFO L443 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,268 INFO L443 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-11-16 00:29:13,268 INFO L443 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-11-16 00:29:13,268 INFO L443 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-11-16 00:29:13,268 INFO L443 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-11-16 00:29:13,268 INFO L443 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-11-16 00:29:13,268 INFO L443 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-11-16 00:29:13,268 INFO L443 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,268 INFO L443 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,268 INFO L443 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,269 INFO L443 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,269 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-11-16 00:29:13,269 INFO L443 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-11-16 00:29:13,269 INFO L443 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,269 INFO L443 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-11-16 00:29:13,269 INFO L443 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,269 INFO L443 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,269 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,269 INFO L443 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,269 INFO L443 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,269 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,269 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-11-16 00:29:13,269 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:29:13,269 INFO L443 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,269 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,269 INFO L443 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,269 INFO L443 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,269 INFO L443 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,269 INFO L443 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-11-16 00:29:13,269 INFO L443 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-11-16 00:29:13,270 INFO L443 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,270 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-16 00:29:13,270 INFO L443 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-11-16 00:29:13,270 INFO L443 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-11-16 00:29:13,270 INFO L443 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,270 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-11-16 00:29:13,270 INFO L443 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-11-16 00:29:13,270 INFO L443 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,270 INFO L443 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,270 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,270 INFO L443 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,270 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-16 00:29:13,270 INFO L443 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-11-16 00:29:13,270 INFO L443 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,270 INFO L443 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,270 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,270 INFO L443 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-11-16 00:29:13,270 INFO L443 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-11-16 00:29:13,270 INFO L443 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,270 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-11-16 00:29:13,270 INFO L443 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,270 INFO L443 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,271 INFO L443 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,271 INFO L443 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,271 INFO L443 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,271 INFO L443 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,271 INFO L443 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-11-16 00:29:13,271 INFO L443 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,271 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,271 INFO L443 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-11-16 00:29:13,271 INFO L443 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,271 INFO L443 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,271 INFO L443 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,271 INFO L443 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,271 INFO L443 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-11-16 00:29:13,271 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,272 INFO L443 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,272 INFO L443 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,272 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,272 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,272 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-16 00:29:13,272 INFO L443 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,272 INFO L443 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,272 INFO L443 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,272 INFO L443 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,272 INFO L443 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-11-16 00:29:13,272 INFO L443 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,272 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,273 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 151) no Hoare annotation was computed. [2019-11-16 00:29:13,273 INFO L443 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,273 INFO L443 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-11-16 00:29:13,273 INFO L443 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-11-16 00:29:13,273 INFO L443 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,273 INFO L443 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,273 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-16 00:29:13,273 INFO L443 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,273 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,273 INFO L443 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,273 INFO L443 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,273 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,273 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-16 00:29:13,274 INFO L443 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,274 INFO L443 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,274 INFO L443 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,274 INFO L443 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,274 INFO L443 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,274 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-11-16 00:29:13,274 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,274 INFO L443 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,274 INFO L443 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-11-16 00:29:13,274 INFO L443 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,274 INFO L443 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-11-16 00:29:13,274 INFO L443 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-11-16 00:29:13,274 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,275 INFO L443 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,275 INFO L443 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,275 INFO L443 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,275 INFO L443 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,275 INFO L443 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-11-16 00:29:13,275 INFO L443 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-11-16 00:29:13,275 INFO L443 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,275 INFO L443 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-11-16 00:29:13,275 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:29:13,275 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-11-16 00:29:13,275 INFO L443 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,275 INFO L443 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,275 INFO L443 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,275 INFO L443 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,278 INFO L443 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,278 INFO L443 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-11-16 00:29:13,278 INFO L443 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-11-16 00:29:13,278 INFO L443 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-11-16 00:29:13,279 INFO L443 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-11-16 00:29:13,279 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,279 INFO L443 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,279 INFO L443 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,279 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-16 00:29:13,279 INFO L443 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-11-16 00:29:13,279 INFO L443 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,279 INFO L443 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-11-16 00:29:13,280 INFO L443 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,280 INFO L443 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,280 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,280 INFO L443 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,280 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-11-16 00:29:13,280 INFO L443 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-11-16 00:29:13,280 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-16 00:29:13,280 INFO L443 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,280 INFO L443 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-11-16 00:29:13,280 INFO L443 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,280 INFO L443 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,280 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,280 INFO L443 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,281 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,281 INFO L443 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,281 INFO L443 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,281 INFO L443 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,281 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-16 00:29:13,281 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-16 00:29:13,281 INFO L443 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-11-16 00:29:13,281 INFO L443 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-11-16 00:29:13,281 INFO L443 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,282 INFO L443 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,282 INFO L443 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,282 INFO L443 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,283 INFO L439 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse15 (+ ~a4~0 86))) (let ((.cse9 (= 1 ~a2~0)) (.cse8 (<= .cse15 0)) (.cse16 (<= (+ ~a29~0 16) 0)) (.cse24 (+ ~a29~0 144)) (.cse25 (+ ~a0~0 147))) (let ((.cse3 (< 43 ~a29~0)) (.cse12 (<= .cse25 0)) (.cse6 (<= 0 (+ ~a29~0 142))) (.cse10 (< 0 .cse25)) (.cse2 (= 2 ~a2~0)) (.cse20 (+ ~a0~0 61)) (.cse0 (<= (+ ~a0~0 98) 0)) (.cse5 (not (= 4 ~a2~0))) (.cse7 (<= (+ ~a0~0 99) 0)) (.cse17 (<= .cse24 0)) (.cse21 (and .cse8 .cse16)) (.cse13 (<= (+ ~a29~0 38436) 0)) (.cse14 (not .cse9)) (.cse11 (<= 0 (+ ~a29~0 599989))) (.cse4 (<= ~a29~0 43)) (.cse23 (<= 0 (+ ~a0~0 44))) (.cse22 (< 0 .cse24)) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse19 (= 3 ~a2~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse9 .cse10 .cse11) (and .cse12 (and .cse2 .cse3)) (and .cse1 .cse9 .cse4 .cse6) (and .cse1 .cse7 .cse13 .cse14 .cse11 .cse5) (and .cse7 (and .cse1 (< 0 .cse15) .cse3)) (and .cse1 .cse12 .cse16 .cse6) (and .cse1 .cse12 .cse14 .cse17 .cse11) (and (and .cse10 .cse8) .cse6) (and .cse8 (exists ((v_prenex_2 Int) (v_~a29~0_897 Int)) (let ((.cse18 (mod (+ v_prenex_2 17705) 299928))) (and (<= .cse18 (+ v_~a29~0_897 599999)) (< (+ v_prenex_2 317633) 0) (<= (+ (div v_~a29~0_897 5) 340362) ~a29~0) (= 0 (mod v_~a29~0_897 5)) (not (= .cse18 0)))))) (and (and .cse1 .cse19 (or .cse10 (not (= 4 ULTIMATE.start_calculate_output_~input)))) .cse7) (and (and .cse8 .cse2) (not (= 3 ULTIMATE.start_calculate_output_~input)) (< 0 .cse20)) (and .cse21 .cse17 (<= .cse20 0)) (and .cse0 .cse1 (<= 220364 ~a29~0) .cse5) (and (= ~a2~0 1) .cse22 .cse8) (and .cse7 (and .cse1 .cse17 .cse19)) (and .cse21 .cse13 .cse23 .cse14 .cse11) (and (or (and .cse4 .cse23 .cse22) .cse8) .cse1 .cse19))))) [2019-11-16 00:29:13,283 INFO L443 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-11-16 00:29:13,283 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-16 00:29:13,283 INFO L443 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,283 INFO L443 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,283 INFO L443 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,283 INFO L443 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,284 INFO L443 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,284 INFO L443 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,284 INFO L443 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,284 INFO L443 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-11-16 00:29:13,284 INFO L443 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,284 INFO L443 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-11-16 00:29:13,284 INFO L446 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-11-16 00:29:13,285 INFO L443 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,285 INFO L443 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-11-16 00:29:13,285 INFO L443 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-11-16 00:29:13,285 INFO L443 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-11-16 00:29:13,285 INFO L443 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-11-16 00:29:13,285 INFO L443 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,285 INFO L443 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,285 INFO L443 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,286 INFO L443 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,286 INFO L443 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,286 INFO L443 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-11-16 00:29:13,286 INFO L443 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-11-16 00:29:13,286 INFO L443 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,286 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-11-16 00:29:13,286 INFO L443 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-11-16 00:29:13,287 INFO L443 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,287 INFO L443 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,287 INFO L443 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,287 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,287 INFO L443 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,287 INFO L443 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,288 INFO L439 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse16 (+ ~a4~0 86))) (let ((.cse8 (<= .cse16 0)) (.cse13 (<= (+ ~a29~0 16) 0)) (.cse23 (+ ~a29~0 144)) (.cse9 (= 1 ~a2~0)) (.cse24 (+ ~a0~0 147))) (let ((.cse3 (< 43 ~a29~0)) (.cse12 (<= .cse24 0)) (.cse15 (not .cse9)) (.cse10 (< 0 .cse24)) (.cse7 (<= (+ ~a0~0 99) 0)) (.cse2 (= 2 ~a2~0)) (.cse17 (<= .cse23 0)) (.cse21 (+ ~a0~0 61)) (.cse0 (<= (+ ~a0~0 98) 0)) (.cse5 (not (= 4 ~a2~0))) (.cse6 (<= 0 (+ ~a29~0 142))) (.cse19 (and .cse8 .cse13)) (.cse14 (<= (+ ~a29~0 38436) 0)) (.cse11 (<= 0 (+ ~a29~0 599989))) (.cse4 (<= ~a29~0 43)) (.cse22 (<= 0 (+ ~a0~0 44))) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse20 (= 3 ~a2~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse9 .cse10 .cse11) (and .cse1 .cse12 .cse13 .cse6) (and .cse1 .cse7 .cse14 .cse15 .cse11 .cse5) (and .cse12 (and .cse2 .cse3)) (and .cse7 (and .cse1 (< 0 .cse16) .cse3)) (and .cse1 .cse12 .cse15 .cse17 .cse11) (and (and .cse10 .cse8) .cse6) (and .cse8 (exists ((v_prenex_2 Int) (v_~a29~0_897 Int)) (let ((.cse18 (mod (+ v_prenex_2 17705) 299928))) (and (<= .cse18 (+ v_~a29~0_897 599999)) (< (+ v_prenex_2 317633) 0) (<= (+ (div v_~a29~0_897 5) 340362) ~a29~0) (= 0 (mod v_~a29~0_897 5)) (not (= .cse18 0)))))) (and (= ~a2~0 1) .cse19) (and (and .cse1 .cse20) .cse7) (and (and .cse8 .cse2) (not (= 3 ULTIMATE.start_calculate_output_~input)) (< 0 .cse21)) (and .cse19 .cse17 (<= .cse21 0)) (and .cse0 .cse1 (<= 220364 ~a29~0) .cse5) (and .cse1 .cse9 .cse4 .cse6) (and .cse19 .cse14 .cse22 .cse11) (and (or (and .cse4 .cse22 (< 0 .cse23)) .cse8) .cse1 .cse20))))) [2019-11-16 00:29:13,288 INFO L443 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,288 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-16 00:29:13,288 INFO L443 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-11-16 00:29:13,288 INFO L443 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,288 INFO L443 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,289 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,289 INFO L443 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,289 INFO L443 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,289 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,289 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-16 00:29:13,289 INFO L443 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-11-16 00:29:13,289 INFO L443 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,289 INFO L443 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,290 INFO L443 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-11-16 00:29:13,290 INFO L443 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,290 INFO L443 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,290 INFO L443 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,290 INFO L443 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,290 INFO L443 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,290 INFO L443 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,290 INFO L443 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-11-16 00:29:13,291 INFO L443 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-11-16 00:29:13,291 INFO L443 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,291 INFO L443 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,291 INFO L443 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,291 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,291 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,291 INFO L443 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,292 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:29:13,292 INFO L443 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-11-16 00:29:13,292 INFO L443 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,292 INFO L443 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-11-16 00:29:13,292 INFO L443 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,292 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,292 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,293 INFO L443 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,293 INFO L443 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,293 INFO L443 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,293 INFO L443 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,293 INFO L443 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-11-16 00:29:13,293 INFO L443 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-11-16 00:29:13,293 INFO L443 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,293 INFO L443 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,294 INFO L443 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,294 INFO L443 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,294 INFO L443 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,294 INFO L443 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,294 INFO L443 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,294 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-16 00:29:13,294 INFO L443 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-11-16 00:29:13,295 INFO L443 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,295 INFO L443 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,295 INFO L443 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,295 INFO L443 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,295 INFO L443 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,295 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,295 INFO L443 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,295 INFO L443 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-11-16 00:29:13,296 INFO L443 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-11-16 00:29:13,296 INFO L443 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,296 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-16 00:29:13,296 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-16 00:29:13,296 INFO L443 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,296 INFO L443 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,296 INFO L443 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,297 INFO L443 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,297 INFO L443 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,297 INFO L443 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,297 INFO L439 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse16 (+ ~a4~0 86))) (let ((.cse8 (<= .cse16 0)) (.cse13 (<= (+ ~a29~0 16) 0)) (.cse23 (+ ~a29~0 144)) (.cse9 (= 1 ~a2~0)) (.cse24 (+ ~a0~0 147))) (let ((.cse3 (< 43 ~a29~0)) (.cse12 (<= .cse24 0)) (.cse15 (not .cse9)) (.cse10 (< 0 .cse24)) (.cse7 (<= (+ ~a0~0 99) 0)) (.cse2 (= 2 ~a2~0)) (.cse17 (<= .cse23 0)) (.cse21 (+ ~a0~0 61)) (.cse0 (<= (+ ~a0~0 98) 0)) (.cse5 (not (= 4 ~a2~0))) (.cse6 (<= 0 (+ ~a29~0 142))) (.cse19 (and .cse8 .cse13)) (.cse14 (<= (+ ~a29~0 38436) 0)) (.cse11 (<= 0 (+ ~a29~0 599989))) (.cse4 (<= ~a29~0 43)) (.cse22 (<= 0 (+ ~a0~0 44))) (.cse1 (<= (+ ~a4~0 42) 0)) (.cse20 (= 3 ~a2~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse4 .cse5 .cse6) (and .cse7 .cse8 .cse5) (and .cse0 .cse1 .cse9 .cse10 .cse11) (and .cse1 .cse12 .cse13 .cse6) (and .cse1 .cse7 .cse14 .cse15 .cse11 .cse5) (and .cse12 (and .cse2 .cse3)) (and .cse7 (and .cse1 (< 0 .cse16) .cse3)) (and .cse1 .cse12 .cse15 .cse17 .cse11) (and (and .cse10 .cse8) .cse6) (and .cse8 (exists ((v_prenex_2 Int) (v_~a29~0_897 Int)) (let ((.cse18 (mod (+ v_prenex_2 17705) 299928))) (and (<= .cse18 (+ v_~a29~0_897 599999)) (< (+ v_prenex_2 317633) 0) (<= (+ (div v_~a29~0_897 5) 340362) ~a29~0) (= 0 (mod v_~a29~0_897 5)) (not (= .cse18 0)))))) (and (= ~a2~0 1) .cse19) (and (and .cse1 .cse20) .cse7) (and (and .cse8 .cse2) (not (= 3 ULTIMATE.start_calculate_output_~input)) (< 0 .cse21)) (and .cse19 .cse17 (<= .cse21 0)) (and .cse0 .cse1 (<= 220364 ~a29~0) .cse5) (and .cse1 .cse9 .cse4 .cse6) (and .cse19 .cse14 .cse22 .cse11) (and (or (and .cse4 .cse22 (< 0 .cse23)) .cse8) .cse1 .cse20))))) [2019-11-16 00:29:13,297 INFO L443 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-11-16 00:29:13,298 INFO L443 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-11-16 00:29:13,298 INFO L443 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,298 INFO L443 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,298 INFO L443 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,298 INFO L443 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,298 INFO L443 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,298 INFO L443 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,299 INFO L443 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,299 INFO L443 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,299 INFO L443 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-11-16 00:29:13,299 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-16 00:29:13,299 INFO L443 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,299 INFO L443 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-11-16 00:29:13,299 INFO L443 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-11-16 00:29:13,299 INFO L443 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,300 INFO L443 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,300 INFO L443 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,300 INFO L443 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,300 INFO L443 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,300 INFO L443 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-11-16 00:29:13,300 INFO L443 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-11-16 00:29:13,300 INFO L443 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,301 INFO L443 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,301 INFO L443 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,301 INFO L443 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,301 INFO L443 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-11-16 00:29:13,301 INFO L443 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-11-16 00:29:13,301 INFO L443 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-11-16 00:29:13,301 INFO L443 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,302 INFO L443 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-11-16 00:29:13,302 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-16 00:29:13,302 INFO L443 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,302 INFO L443 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,302 INFO L443 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,302 INFO L443 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,302 INFO L443 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,302 INFO L443 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,303 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,303 INFO L443 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-16 00:29:13,303 INFO L443 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-11-16 00:29:13,303 INFO L443 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,303 INFO L443 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,303 INFO L443 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,303 INFO L443 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-16 00:29:13,303 INFO L443 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,304 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:29:13,304 INFO L443 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,304 INFO L443 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-11-16 00:29:13,304 INFO L443 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,304 INFO L443 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,304 INFO L443 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,304 INFO L443 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,304 INFO L443 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,305 INFO L443 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,305 INFO L443 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,305 INFO L443 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-11-16 00:29:13,305 INFO L443 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-11-16 00:29:13,305 INFO L443 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,305 INFO L443 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-11-16 00:29:13,305 INFO L443 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,306 INFO L443 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,306 INFO L443 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,306 INFO L443 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-11-16 00:29:13,306 INFO L443 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,306 INFO L443 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,306 INFO L443 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,306 INFO L443 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,306 INFO L443 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-11-16 00:29:13,307 INFO L443 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,307 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,307 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-11-16 00:29:13,307 INFO L443 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-11-16 00:29:13,307 INFO L443 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,307 INFO L443 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,307 INFO L443 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,308 INFO L443 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-11-16 00:29:13,308 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,308 INFO L443 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,308 INFO L443 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,308 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,308 INFO L443 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,308 INFO L443 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-16 00:29:13,308 INFO L443 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,309 INFO L443 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,309 INFO L443 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-11-16 00:29:13,309 INFO L443 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-11-16 00:29:13,309 INFO L443 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,309 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-11-16 00:29:13,309 INFO L443 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-11-16 00:29:13,309 INFO L443 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,309 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-11-16 00:29:13,310 INFO L443 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,310 INFO L443 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-11-16 00:29:13,310 INFO L443 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-11-16 00:29:13,310 INFO L443 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,310 INFO L443 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,310 INFO L443 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-11-16 00:29:13,310 INFO L443 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-11-16 00:29:13,310 INFO L443 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-11-16 00:29:13,319 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,320 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,320 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,320 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,321 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,332 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,333 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,336 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,345 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,345 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,345 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,345 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,349 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:29:13 BoogieIcfgContainer [2019-11-16 00:29:13,353 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:29:13,353 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:29:13,353 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:29:13,354 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:29:13,354 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:27:06" (3/4) ... [2019-11-16 00:29:13,357 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:29:13,393 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-16 00:29:13,396 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:29:13,425 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 2 == a2) && 43 < a29) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 43) && !(4 == a2)) && 0 <= a29 + 142)) || ((a0 + 99 <= 0 && a4 + 86 <= 0) && !(4 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && 0 <= a29 + 599989)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 16 <= 0) && 0 <= a29 + 142)) || (((((a4 + 42 <= 0 && a0 + 99 <= 0) && a29 + 38436 <= 0) && !(1 == a2)) && 0 <= a29 + 599989) && !(4 == a2))) || (a0 + 147 <= 0 && 2 == a2 && 43 < a29)) || (a0 + 99 <= 0 && (a4 + 42 <= 0 && 0 < a4 + 86) && 43 < a29)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && !(1 == a2)) && a29 + 144 <= 0) && 0 <= a29 + 599989)) || ((0 < a0 + 147 && a4 + 86 <= 0) && 0 <= a29 + 142)) || (a4 + 86 <= 0 && (\exists v_prenex_2 : int, v_~a29~0_897 : int :: ((((v_prenex_2 + 17705) % 299928 <= v_~a29~0_897 + 599999 && v_prenex_2 + 317633 < 0) && v_~a29~0_897 / 5 + 340362 <= a29) && 0 == v_~a29~0_897 % 5) && !((v_prenex_2 + 17705) % 299928 == 0)))) || (a2 == 1 && a4 + 86 <= 0 && a29 + 16 <= 0)) || ((a4 + 42 <= 0 && 3 == a2) && a0 + 99 <= 0)) || (((a4 + 86 <= 0 && 2 == a2) && !(3 == input)) && 0 < a0 + 61)) || (((a4 + 86 <= 0 && a29 + 16 <= 0) && a29 + 144 <= 0) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 220364 <= a29) && !(4 == a2))) || (((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 <= a29 + 142)) || ((((a4 + 86 <= 0 && a29 + 16 <= 0) && a29 + 38436 <= 0) && 0 <= a0 + 44) && 0 <= a29 + 599989)) || (((((a29 <= 43 && 0 <= a0 + 44) && 0 < a29 + 144) || a4 + 86 <= 0) && a4 + 42 <= 0) && 3 == a2) [2019-11-16 00:29:13,428 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 2 == a2) && 43 < a29) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 43) && !(4 == a2)) && 0 <= a29 + 142)) || ((a0 + 99 <= 0 && a4 + 86 <= 0) && !(4 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && 0 <= a29 + 599989)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 16 <= 0) && 0 <= a29 + 142)) || (((((a4 + 42 <= 0 && a0 + 99 <= 0) && a29 + 38436 <= 0) && !(1 == a2)) && 0 <= a29 + 599989) && !(4 == a2))) || (a0 + 147 <= 0 && 2 == a2 && 43 < a29)) || (a0 + 99 <= 0 && (a4 + 42 <= 0 && 0 < a4 + 86) && 43 < a29)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && !(1 == a2)) && a29 + 144 <= 0) && 0 <= a29 + 599989)) || ((0 < a0 + 147 && a4 + 86 <= 0) && 0 <= a29 + 142)) || (a4 + 86 <= 0 && (\exists v_prenex_2 : int, v_~a29~0_897 : int :: ((((v_prenex_2 + 17705) % 299928 <= v_~a29~0_897 + 599999 && v_prenex_2 + 317633 < 0) && v_~a29~0_897 / 5 + 340362 <= a29) && 0 == v_~a29~0_897 % 5) && !((v_prenex_2 + 17705) % 299928 == 0)))) || (a2 == 1 && a4 + 86 <= 0 && a29 + 16 <= 0)) || ((a4 + 42 <= 0 && 3 == a2) && a0 + 99 <= 0)) || (((a4 + 86 <= 0 && 2 == a2) && !(3 == input)) && 0 < a0 + 61)) || (((a4 + 86 <= 0 && a29 + 16 <= 0) && a29 + 144 <= 0) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 220364 <= a29) && !(4 == a2))) || (((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 <= a29 + 142)) || ((((a4 + 86 <= 0 && a29 + 16 <= 0) && a29 + 38436 <= 0) && 0 <= a0 + 44) && 0 <= a29 + 599989)) || (((((a29 <= 43 && 0 <= a0 + 44) && 0 < a29 + 144) || a4 + 86 <= 0) && a4 + 42 <= 0) && 3 == a2) [2019-11-16 00:29:13,440 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 2 == a2) && 43 < a29) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 43) && !(4 == a2)) && 0 <= a29 + 142)) || ((a0 + 99 <= 0 && a4 + 86 <= 0) && !(4 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && 0 <= a29 + 599989)) || (a0 + 147 <= 0 && 2 == a2 && 43 < a29)) || (((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 <= a29 + 142)) || (((((a4 + 42 <= 0 && a0 + 99 <= 0) && a29 + 38436 <= 0) && !(1 == a2)) && 0 <= a29 + 599989) && !(4 == a2))) || (a0 + 99 <= 0 && (a4 + 42 <= 0 && 0 < a4 + 86) && 43 < a29)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 16 <= 0) && 0 <= a29 + 142)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && !(1 == a2)) && a29 + 144 <= 0) && 0 <= a29 + 599989)) || ((0 < a0 + 147 && a4 + 86 <= 0) && 0 <= a29 + 142)) || (a4 + 86 <= 0 && (\exists v_prenex_2 : int, v_~a29~0_897 : int :: ((((v_prenex_2 + 17705) % 299928 <= v_~a29~0_897 + 599999 && v_prenex_2 + 317633 < 0) && v_~a29~0_897 / 5 + 340362 <= a29) && 0 == v_~a29~0_897 % 5) && !((v_prenex_2 + 17705) % 299928 == 0)))) || (((a4 + 42 <= 0 && 3 == a2) && (0 < a0 + 147 || !(4 == input))) && a0 + 99 <= 0)) || (((a4 + 86 <= 0 && 2 == a2) && !(3 == input)) && 0 < a0 + 61)) || (((a4 + 86 <= 0 && a29 + 16 <= 0) && a29 + 144 <= 0) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 220364 <= a29) && !(4 == a2))) || ((a2 == 1 && 0 < a29 + 144) && a4 + 86 <= 0)) || (a0 + 99 <= 0 && (a4 + 42 <= 0 && a29 + 144 <= 0) && 3 == a2)) || (((((a4 + 86 <= 0 && a29 + 16 <= 0) && a29 + 38436 <= 0) && 0 <= a0 + 44) && !(1 == a2)) && 0 <= a29 + 599989)) || (((((a29 <= 43 && 0 <= a0 + 44) && 0 < a29 + 144) || a4 + 86 <= 0) && a4 + 42 <= 0) && 3 == a2) [2019-11-16 00:29:13,632 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_812b654c-938f-40a8-b874-9c039984b0d2/bin/uautomizer/witness.graphml [2019-11-16 00:29:13,632 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:29:13,633 INFO L168 Benchmark]: Toolchain (without parser) took 132331.34 ms. Allocated memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: 3.1 GB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -196.7 MB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2019-11-16 00:29:13,634 INFO L168 Benchmark]: CDTParser took 6.52 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:29:13,634 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1191.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -100.8 MB). Peak memory consumption was 41.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:29:13,634 INFO L168 Benchmark]: Boogie Procedure Inliner took 200.15 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: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:29:13,635 INFO L168 Benchmark]: Boogie Preprocessor took 214.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 986.0 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:29:13,635 INFO L168 Benchmark]: RCFGBuilder took 3363.24 ms. Allocated memory is still 1.2 GB. Free memory was 986.0 MB in the beginning and 910.8 MB in the end (delta: 75.1 MB). Peak memory consumption was 159.8 MB. Max. memory is 11.5 GB. [2019-11-16 00:29:13,635 INFO L168 Benchmark]: TraceAbstraction took 127078.17 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 3.0 GB). Free memory was 910.8 MB in the beginning and 1.2 GB in the end (delta: -308.7 MB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2019-11-16 00:29:13,636 INFO L168 Benchmark]: Witness Printer took 278.90 ms. Allocated memory is still 4.1 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 83.4 MB). Peak memory consumption was 83.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:29:13,637 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 6.52 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1191.39 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 939.3 MB in the beginning and 1.0 GB in the end (delta: -100.8 MB). Peak memory consumption was 41.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 200.15 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: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 214.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 986.0 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3363.24 ms. Allocated memory is still 1.2 GB. Free memory was 986.0 MB in the beginning and 910.8 MB in the end (delta: 75.1 MB). Peak memory consumption was 159.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 127078.17 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 3.0 GB). Free memory was 910.8 MB in the beginning and 1.2 GB in the end (delta: -308.7 MB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. * Witness Printer took 278.90 ms. Allocated memory is still 4.1 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 83.4 MB). Peak memory consumption was 83.4 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_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 151]: 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-16 00:29:13,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,647 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 2 == a2) && 43 < a29) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 43) && !(4 == a2)) && 0 <= a29 + 142)) || ((a0 + 99 <= 0 && a4 + 86 <= 0) && !(4 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && 0 <= a29 + 599989)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 16 <= 0) && 0 <= a29 + 142)) || (((((a4 + 42 <= 0 && a0 + 99 <= 0) && a29 + 38436 <= 0) && !(1 == a2)) && 0 <= a29 + 599989) && !(4 == a2))) || (a0 + 147 <= 0 && 2 == a2 && 43 < a29)) || (a0 + 99 <= 0 && (a4 + 42 <= 0 && 0 < a4 + 86) && 43 < a29)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && !(1 == a2)) && a29 + 144 <= 0) && 0 <= a29 + 599989)) || ((0 < a0 + 147 && a4 + 86 <= 0) && 0 <= a29 + 142)) || (a4 + 86 <= 0 && (\exists v_prenex_2 : int, v_~a29~0_897 : int :: ((((v_prenex_2 + 17705) % 299928 <= v_~a29~0_897 + 599999 && v_prenex_2 + 317633 < 0) && v_~a29~0_897 / 5 + 340362 <= a29) && 0 == v_~a29~0_897 % 5) && !((v_prenex_2 + 17705) % 299928 == 0)))) || (a2 == 1 && a4 + 86 <= 0 && a29 + 16 <= 0)) || ((a4 + 42 <= 0 && 3 == a2) && a0 + 99 <= 0)) || (((a4 + 86 <= 0 && 2 == a2) && !(3 == input)) && 0 < a0 + 61)) || (((a4 + 86 <= 0 && a29 + 16 <= 0) && a29 + 144 <= 0) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 220364 <= a29) && !(4 == a2))) || (((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 <= a29 + 142)) || ((((a4 + 86 <= 0 && a29 + 16 <= 0) && a29 + 38436 <= 0) && 0 <= a0 + 44) && 0 <= a29 + 599989)) || (((((a29 <= 43 && 0 <= a0 + 44) && 0 < a29 + 144) || a4 + 86 <= 0) && a4 + 42 <= 0) && 3 == a2) - InvariantResult [Line: 23]: Loop Invariant [2019-11-16 00:29:13,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,654 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,655 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,655 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,655 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,656 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,656 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,656 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: ((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 2 == a2) && 43 < a29) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 43) && !(4 == a2)) && 0 <= a29 + 142)) || ((a0 + 99 <= 0 && a4 + 86 <= 0) && !(4 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && 0 <= a29 + 599989)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 16 <= 0) && 0 <= a29 + 142)) || (((((a4 + 42 <= 0 && a0 + 99 <= 0) && a29 + 38436 <= 0) && !(1 == a2)) && 0 <= a29 + 599989) && !(4 == a2))) || (a0 + 147 <= 0 && 2 == a2 && 43 < a29)) || (a0 + 99 <= 0 && (a4 + 42 <= 0 && 0 < a4 + 86) && 43 < a29)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && !(1 == a2)) && a29 + 144 <= 0) && 0 <= a29 + 599989)) || ((0 < a0 + 147 && a4 + 86 <= 0) && 0 <= a29 + 142)) || (a4 + 86 <= 0 && (\exists v_prenex_2 : int, v_~a29~0_897 : int :: ((((v_prenex_2 + 17705) % 299928 <= v_~a29~0_897 + 599999 && v_prenex_2 + 317633 < 0) && v_~a29~0_897 / 5 + 340362 <= a29) && 0 == v_~a29~0_897 % 5) && !((v_prenex_2 + 17705) % 299928 == 0)))) || (a2 == 1 && a4 + 86 <= 0 && a29 + 16 <= 0)) || ((a4 + 42 <= 0 && 3 == a2) && a0 + 99 <= 0)) || (((a4 + 86 <= 0 && 2 == a2) && !(3 == input)) && 0 < a0 + 61)) || (((a4 + 86 <= 0 && a29 + 16 <= 0) && a29 + 144 <= 0) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 220364 <= a29) && !(4 == a2))) || (((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 <= a29 + 142)) || ((((a4 + 86 <= 0 && a29 + 16 <= 0) && a29 + 38436 <= 0) && 0 <= a0 + 44) && 0 <= a29 + 599989)) || (((((a29 <= 43 && 0 <= a0 + 44) && 0 < a29 + 144) || a4 + 86 <= 0) && a4 + 42 <= 0) && 3 == a2) - InvariantResult [Line: 1658]: Loop Invariant [2019-11-16 00:29:13,657 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,658 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,659 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2019-11-16 00:29:13,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_897,QUANTIFIED] [2019-11-16 00:29:13,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((a0 + 98 <= 0 && a4 + 42 <= 0) && 2 == a2) && 43 < a29) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && a29 <= 43) && !(4 == a2)) && 0 <= a29 + 142)) || ((a0 + 99 <= 0 && a4 + 86 <= 0) && !(4 == a2))) || ((((a0 + 98 <= 0 && a4 + 42 <= 0) && 1 == a2) && 0 < a0 + 147) && 0 <= a29 + 599989)) || (a0 + 147 <= 0 && 2 == a2 && 43 < a29)) || (((a4 + 42 <= 0 && 1 == a2) && a29 <= 43) && 0 <= a29 + 142)) || (((((a4 + 42 <= 0 && a0 + 99 <= 0) && a29 + 38436 <= 0) && !(1 == a2)) && 0 <= a29 + 599989) && !(4 == a2))) || (a0 + 99 <= 0 && (a4 + 42 <= 0 && 0 < a4 + 86) && 43 < a29)) || (((a4 + 42 <= 0 && a0 + 147 <= 0) && a29 + 16 <= 0) && 0 <= a29 + 142)) || ((((a4 + 42 <= 0 && a0 + 147 <= 0) && !(1 == a2)) && a29 + 144 <= 0) && 0 <= a29 + 599989)) || ((0 < a0 + 147 && a4 + 86 <= 0) && 0 <= a29 + 142)) || (a4 + 86 <= 0 && (\exists v_prenex_2 : int, v_~a29~0_897 : int :: ((((v_prenex_2 + 17705) % 299928 <= v_~a29~0_897 + 599999 && v_prenex_2 + 317633 < 0) && v_~a29~0_897 / 5 + 340362 <= a29) && 0 == v_~a29~0_897 % 5) && !((v_prenex_2 + 17705) % 299928 == 0)))) || (((a4 + 42 <= 0 && 3 == a2) && (0 < a0 + 147 || !(4 == input))) && a0 + 99 <= 0)) || (((a4 + 86 <= 0 && 2 == a2) && !(3 == input)) && 0 < a0 + 61)) || (((a4 + 86 <= 0 && a29 + 16 <= 0) && a29 + 144 <= 0) && a0 + 61 <= 0)) || (((a0 + 98 <= 0 && a4 + 42 <= 0) && 220364 <= a29) && !(4 == a2))) || ((a2 == 1 && 0 < a29 + 144) && a4 + 86 <= 0)) || (a0 + 99 <= 0 && (a4 + 42 <= 0 && a29 + 144 <= 0) && 3 == a2)) || (((((a4 + 86 <= 0 && a29 + 16 <= 0) && a29 + 38436 <= 0) && 0 <= a0 + 44) && !(1 == a2)) && 0 <= a29 + 599989)) || (((((a29 <= 43 && 0 <= a0 + 44) && 0 < a29 + 144) || a4 + 86 <= 0) && a4 + 42 <= 0) && 3 == a2) - 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: 126.9s, OverallIterations: 15, TraceHistogramMax: 7, AutomataDifference: 87.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 17.5s, HoareTripleCheckerStatistics: 3410 SDtfs, 22760 SDslu, 2148 SDs, 0 SdLazy, 82402 SolverSat, 5935 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 64.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 3276 GetRequests, 3136 SyntacticMatches, 13 SemanticMatches, 127 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 11.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24024occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 40470 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 232 NumberOfFragments, 1261 HoareAnnotationTreeSize, 4 FomulaSimplifications, 219851 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 105248 FormulaSimplificationTreeSizeReductionInter, 15.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 11318 NumberOfCodeBlocks, 11318 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 11298 ConstructedInterpolants, 283 QuantifiedInterpolants, 38540277 SizeOfPredicates, 8 NumberOfNonLiveVariables, 3642 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 20 InterpolantComputations, 12 PerfectInterpolantSequences, 13039/14618 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...