./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label21.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_12aa1320-90f2-4b8d-a5f0-360d037cb96a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_12aa1320-90f2-4b8d-a5f0-360d037cb96a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_12aa1320-90f2-4b8d-a5f0-360d037cb96a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_12aa1320-90f2-4b8d-a5f0-360d037cb96a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label21.c -s /tmp/vcloud-vcloud-master/worker/run_dir_12aa1320-90f2-4b8d-a5f0-360d037cb96a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_12aa1320-90f2-4b8d-a5f0-360d037cb96a/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 3417c69af9082461360c89228cfebeb34dbd1c6e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:03:24,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:03:24,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:03:24,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:03:24,289 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:03:24,291 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:03:24,293 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:03:24,295 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:03:24,301 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:03:24,302 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:03:24,303 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:03:24,304 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:03:24,304 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:03:24,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:03:24,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:03:24,307 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:03:24,308 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:03:24,309 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:03:24,310 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:03:24,312 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:03:24,313 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:03:24,314 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:03:24,315 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:03:24,316 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:03:24,319 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:03:24,319 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:03:24,320 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:03:24,321 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:03:24,321 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:03:24,322 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:03:24,322 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:03:24,323 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:03:24,324 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:03:24,325 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:03:24,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:03:24,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:03:24,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:03:24,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:03:24,328 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:03:24,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:03:24,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:03:24,330 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_12aa1320-90f2-4b8d-a5f0-360d037cb96a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:03:24,344 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:03:24,345 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:03:24,346 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:03:24,346 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:03:24,346 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:03:24,346 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:03:24,347 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:03:24,347 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:03:24,347 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:03:24,347 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:03:24,348 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:03:24,348 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:03:24,348 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:03:24,348 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:03:24,348 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:03:24,349 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:03:24,349 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:03:24,349 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:03:24,349 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:03:24,350 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:03:24,350 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:03:24,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:03:24,350 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:03:24,351 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:03:24,351 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:03:24,351 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:03:24,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:03:24,351 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:03:24,352 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_12aa1320-90f2-4b8d-a5f0-360d037cb96a/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 -> 3417c69af9082461360c89228cfebeb34dbd1c6e [2019-11-16 00:03:24,382 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:03:24,392 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:03:24,395 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:03:24,396 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:03:24,397 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:03:24,397 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_12aa1320-90f2-4b8d-a5f0-360d037cb96a/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label21.c [2019-11-16 00:03:24,451 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_12aa1320-90f2-4b8d-a5f0-360d037cb96a/bin/uautomizer/data/d87250acc/928c3844380849f69fa3718c5cf69cbe/FLAG327474eba [2019-11-16 00:03:25,036 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:03:25,038 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_12aa1320-90f2-4b8d-a5f0-360d037cb96a/sv-benchmarks/c/eca-rers2012/Problem11_label21.c [2019-11-16 00:03:25,055 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_12aa1320-90f2-4b8d-a5f0-360d037cb96a/bin/uautomizer/data/d87250acc/928c3844380849f69fa3718c5cf69cbe/FLAG327474eba [2019-11-16 00:03:25,418 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_12aa1320-90f2-4b8d-a5f0-360d037cb96a/bin/uautomizer/data/d87250acc/928c3844380849f69fa3718c5cf69cbe [2019-11-16 00:03:25,421 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:03:25,422 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:03:25,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:03:25,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:03:25,427 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:03:25,428 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:03:25" (1/1) ... [2019-11-16 00:03:25,430 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@377ddfcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:25, skipping insertion in model container [2019-11-16 00:03:25,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:03:25" (1/1) ... [2019-11-16 00:03:25,438 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:03:25,512 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:03:26,054 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:03:26,058 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:03:26,339 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:03:26,357 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:03:26,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:26 WrapperNode [2019-11-16 00:03:26,358 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:03:26,359 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:03:26,359 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:03:26,359 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:03:26,368 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:03:26" (1/1) ... [2019-11-16 00:03:26,406 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:03:26" (1/1) ... [2019-11-16 00:03:26,502 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:03:26,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:03:26,504 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:03:26,504 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:03:26,513 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:26" (1/1) ... [2019-11-16 00:03:26,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:26" (1/1) ... [2019-11-16 00:03:26,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:26" (1/1) ... [2019-11-16 00:03:26,521 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:26" (1/1) ... [2019-11-16 00:03:26,571 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:26" (1/1) ... [2019-11-16 00:03:26,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:26" (1/1) ... [2019-11-16 00:03:26,617 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:26" (1/1) ... [2019-11-16 00:03:26,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:03:26,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:03:26,636 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:03:26,636 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:03:26,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_12aa1320-90f2-4b8d-a5f0-360d037cb96a/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:03:26,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:03:26,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:03:28,906 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:03:28,906 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-16 00:03:28,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:03:28 BoogieIcfgContainer [2019-11-16 00:03:28,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:03:28,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:03:28,909 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:03:28,912 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:03:28,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:03:25" (1/3) ... [2019-11-16 00:03:28,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d86658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:03:28, skipping insertion in model container [2019-11-16 00:03:28,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:03:26" (2/3) ... [2019-11-16 00:03:28,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57d86658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:03:28, skipping insertion in model container [2019-11-16 00:03:28,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:03:28" (3/3) ... [2019-11-16 00:03:28,919 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label21.c [2019-11-16 00:03:28,930 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:03:28,941 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-16 00:03:28,953 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-16 00:03:29,005 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:03:29,005 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:03:29,005 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:03:29,005 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:03:29,006 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:03:29,006 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:03:29,006 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:03:29,007 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:03:29,034 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-11-16 00:03:29,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-16 00:03:29,042 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:29,043 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] [2019-11-16 00:03:29,045 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:29,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:29,051 INFO L82 PathProgramCache]: Analyzing trace with hash -593706766, now seen corresponding path program 1 times [2019-11-16 00:03:29,058 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:29,059 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182335056] [2019-11-16 00:03:29,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:29,059 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:29,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:29,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:29,311 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:03:29,312 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182335056] [2019-11-16 00:03:29,312 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:29,312 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:03:29,313 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142233679] [2019-11-16 00:03:29,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:03:29,317 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:29,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:03:29,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:03:29,333 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-11-16 00:03:31,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:31,722 INFO L93 Difference]: Finished difference Result 959 states and 1737 transitions. [2019-11-16 00:03:31,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:03:31,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-16 00:03:31,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:31,746 INFO L225 Difference]: With dead ends: 959 [2019-11-16 00:03:31,746 INFO L226 Difference]: Without dead ends: 609 [2019-11-16 00:03:31,752 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:03:31,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 609 states. [2019-11-16 00:03:31,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 609 to 595. [2019-11-16 00:03:31,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-11-16 00:03:31,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 905 transitions. [2019-11-16 00:03:31,832 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 905 transitions. Word has length 24 [2019-11-16 00:03:31,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:31,833 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 905 transitions. [2019-11-16 00:03:31,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:03:31,833 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 905 transitions. [2019-11-16 00:03:31,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-16 00:03:31,838 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:31,839 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:31,839 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:31,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:31,839 INFO L82 PathProgramCache]: Analyzing trace with hash -1194274034, now seen corresponding path program 1 times [2019-11-16 00:03:31,840 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:31,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845355463] [2019-11-16 00:03:31,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:31,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:31,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:32,083 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:32,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845355463] [2019-11-16 00:03:32,084 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:32,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:03:32,085 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580176435] [2019-11-16 00:03:32,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:03:32,088 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:32,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:03:32,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:03:32,089 INFO L87 Difference]: Start difference. First operand 595 states and 905 transitions. Second operand 4 states. [2019-11-16 00:03:33,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:33,852 INFO L93 Difference]: Finished difference Result 2305 states and 3518 transitions. [2019-11-16 00:03:33,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:03:33,853 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-11-16 00:03:33,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:33,866 INFO L225 Difference]: With dead ends: 2305 [2019-11-16 00:03:33,866 INFO L226 Difference]: Without dead ends: 1712 [2019-11-16 00:03:33,872 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:03:33,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1712 states. [2019-11-16 00:03:33,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1712 to 1528. [2019-11-16 00:03:33,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1528 states. [2019-11-16 00:03:33,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1528 states to 1528 states and 2081 transitions. [2019-11-16 00:03:33,953 INFO L78 Accepts]: Start accepts. Automaton has 1528 states and 2081 transitions. Word has length 105 [2019-11-16 00:03:33,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:33,953 INFO L462 AbstractCegarLoop]: Abstraction has 1528 states and 2081 transitions. [2019-11-16 00:03:33,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:03:33,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1528 states and 2081 transitions. [2019-11-16 00:03:33,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-11-16 00:03:33,969 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:33,970 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:33,970 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:33,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:33,970 INFO L82 PathProgramCache]: Analyzing trace with hash -537546950, now seen corresponding path program 1 times [2019-11-16 00:03:33,971 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:33,971 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754777390] [2019-11-16 00:03:33,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:33,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:33,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:34,633 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:34,633 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754777390] [2019-11-16 00:03:34,634 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:34,634 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:03:34,634 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004299594] [2019-11-16 00:03:34,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:03:34,635 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:34,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:03:34,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:03:34,636 INFO L87 Difference]: Start difference. First operand 1528 states and 2081 transitions. Second operand 8 states. [2019-11-16 00:03:36,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:36,378 INFO L93 Difference]: Finished difference Result 3265 states and 4396 transitions. [2019-11-16 00:03:36,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:03:36,379 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 163 [2019-11-16 00:03:36,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:36,391 INFO L225 Difference]: With dead ends: 3265 [2019-11-16 00:03:36,392 INFO L226 Difference]: Without dead ends: 1739 [2019-11-16 00:03:36,395 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:03:36,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2019-11-16 00:03:36,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1713. [2019-11-16 00:03:36,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1713 states. [2019-11-16 00:03:36,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1713 states to 1713 states and 2272 transitions. [2019-11-16 00:03:36,459 INFO L78 Accepts]: Start accepts. Automaton has 1713 states and 2272 transitions. Word has length 163 [2019-11-16 00:03:36,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:36,460 INFO L462 AbstractCegarLoop]: Abstraction has 1713 states and 2272 transitions. [2019-11-16 00:03:36,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:03:36,460 INFO L276 IsEmpty]: Start isEmpty. Operand 1713 states and 2272 transitions. [2019-11-16 00:03:36,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-11-16 00:03:36,464 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:36,465 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:36,465 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:36,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:36,466 INFO L82 PathProgramCache]: Analyzing trace with hash 1825817793, now seen corresponding path program 1 times [2019-11-16 00:03:36,466 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:36,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807158543] [2019-11-16 00:03:36,466 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:36,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:36,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:36,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:36,994 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 66 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:36,994 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807158543] [2019-11-16 00:03:36,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [801267581] [2019-11-16 00:03:36,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_12aa1320-90f2-4b8d-a5f0-360d037cb96a/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:03:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:37,115 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-16 00:03:37,147 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:37,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,250 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,354 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,372 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,379 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,385 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,386 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:03:37,820 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 302 DAG size of output: 20 [2019-11-16 00:03:37,977 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 69 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:37,978 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-16 00:03:37,978 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4] total 11 [2019-11-16 00:03:37,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983803873] [2019-11-16 00:03:37,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-16 00:03:37,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:37,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:03:37,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:03:37,981 INFO L87 Difference]: Start difference. First operand 1713 states and 2272 transitions. Second operand 12 states. [2019-11-16 00:03:52,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:52,739 INFO L93 Difference]: Finished difference Result 15586 states and 21221 transitions. [2019-11-16 00:03:52,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-11-16 00:03:52,740 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 206 [2019-11-16 00:03:52,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:52,827 INFO L225 Difference]: With dead ends: 15586 [2019-11-16 00:03:52,827 INFO L226 Difference]: Without dead ends: 14060 [2019-11-16 00:03:52,833 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=451, Invalid=1271, Unknown=0, NotChecked=0, Total=1722 [2019-11-16 00:03:52,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14060 states. [2019-11-16 00:03:53,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14060 to 8336. [2019-11-16 00:03:53,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8336 states. [2019-11-16 00:03:53,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8336 states to 8336 states and 9769 transitions. [2019-11-16 00:03:53,103 INFO L78 Accepts]: Start accepts. Automaton has 8336 states and 9769 transitions. Word has length 206 [2019-11-16 00:03:53,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:53,105 INFO L462 AbstractCegarLoop]: Abstraction has 8336 states and 9769 transitions. [2019-11-16 00:03:53,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-16 00:03:53,105 INFO L276 IsEmpty]: Start isEmpty. Operand 8336 states and 9769 transitions. [2019-11-16 00:03:53,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-11-16 00:03:53,198 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:53,198 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:53,399 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:53,399 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:53,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:53,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1578687696, now seen corresponding path program 1 times [2019-11-16 00:03:53,400 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:53,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116082722] [2019-11-16 00:03:53,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:53,401 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:53,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:53,695 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 270 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-16 00:03:53,695 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116082722] [2019-11-16 00:03:53,695 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:53,696 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:03:53,696 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35470906] [2019-11-16 00:03:53,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:03:53,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:53,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:03:53,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:03:53,697 INFO L87 Difference]: Start difference. First operand 8336 states and 9769 transitions. Second operand 4 states. [2019-11-16 00:03:55,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:55,131 INFO L93 Difference]: Finished difference Result 17787 states and 21120 transitions. [2019-11-16 00:03:55,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:03:55,132 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2019-11-16 00:03:55,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:55,202 INFO L225 Difference]: With dead ends: 17787 [2019-11-16 00:03:55,202 INFO L226 Difference]: Without dead ends: 9637 [2019-11-16 00:03:55,212 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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:03:55,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9637 states. [2019-11-16 00:03:55,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9637 to 9440. [2019-11-16 00:03:55,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9440 states. [2019-11-16 00:03:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9440 states to 9440 states and 11083 transitions. [2019-11-16 00:03:55,448 INFO L78 Accepts]: Start accepts. Automaton has 9440 states and 11083 transitions. Word has length 306 [2019-11-16 00:03:55,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:55,449 INFO L462 AbstractCegarLoop]: Abstraction has 9440 states and 11083 transitions. [2019-11-16 00:03:55,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:03:55,449 INFO L276 IsEmpty]: Start isEmpty. Operand 9440 states and 11083 transitions. [2019-11-16 00:03:55,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2019-11-16 00:03:55,462 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:55,463 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:55,463 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:55,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:55,463 INFO L82 PathProgramCache]: Analyzing trace with hash 991660947, now seen corresponding path program 1 times [2019-11-16 00:03:55,464 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:55,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905611010] [2019-11-16 00:03:55,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:55,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:55,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:55,771 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 198 proven. 8 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2019-11-16 00:03:55,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905611010] [2019-11-16 00:03:55,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522877752] [2019-11-16 00:03:55,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_12aa1320-90f2-4b8d-a5f0-360d037cb96a/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:03:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:55,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:03:55,906 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:03:56,154 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2019-11-16 00:03:56,154 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:03:56,155 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-16 00:03:56,155 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675373260] [2019-11-16 00:03:56,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:56,156 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:56,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:56,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:56,157 INFO L87 Difference]: Start difference. First operand 9440 states and 11083 transitions. Second operand 3 states. [2019-11-16 00:03:57,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:57,226 INFO L93 Difference]: Finished difference Result 20533 states and 24198 transitions. [2019-11-16 00:03:57,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:57,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 330 [2019-11-16 00:03:57,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:57,246 INFO L225 Difference]: With dead ends: 20533 [2019-11-16 00:03:57,247 INFO L226 Difference]: Without dead ends: 10911 [2019-11-16 00:03:57,259 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:57,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10911 states. [2019-11-16 00:03:57,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10911 to 10359. [2019-11-16 00:03:57,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10359 states. [2019-11-16 00:03:57,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10359 states to 10359 states and 11934 transitions. [2019-11-16 00:03:57,426 INFO L78 Accepts]: Start accepts. Automaton has 10359 states and 11934 transitions. Word has length 330 [2019-11-16 00:03:57,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:57,427 INFO L462 AbstractCegarLoop]: Abstraction has 10359 states and 11934 transitions. [2019-11-16 00:03:57,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:57,427 INFO L276 IsEmpty]: Start isEmpty. Operand 10359 states and 11934 transitions. [2019-11-16 00:03:57,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2019-11-16 00:03:57,445 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:57,447 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:03:57,653 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:03:57,653 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:57,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:57,653 INFO L82 PathProgramCache]: Analyzing trace with hash 924839129, now seen corresponding path program 1 times [2019-11-16 00:03:57,653 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:57,653 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126770740] [2019-11-16 00:03:57,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:57,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:57,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:58,013 INFO L134 CoverageAnalysis]: Checked inductivity of 394 backedges. 292 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-11-16 00:03:58,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126770740] [2019-11-16 00:03:58,013 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:58,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:03:58,014 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036511481] [2019-11-16 00:03:58,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:03:58,015 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:58,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:03:58,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:03:58,015 INFO L87 Difference]: Start difference. First operand 10359 states and 11934 transitions. Second operand 4 states. [2019-11-16 00:03:59,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:59,399 INFO L93 Difference]: Finished difference Result 22754 states and 26114 transitions. [2019-11-16 00:03:59,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:03:59,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 387 [2019-11-16 00:03:59,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:59,424 INFO L225 Difference]: With dead ends: 22754 [2019-11-16 00:03:59,424 INFO L226 Difference]: Without dead ends: 12581 [2019-11-16 00:03:59,436 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:03:59,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12581 states. [2019-11-16 00:03:59,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12581 to 10542. [2019-11-16 00:03:59,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10542 states. [2019-11-16 00:03:59,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10542 states to 10542 states and 11963 transitions. [2019-11-16 00:03:59,598 INFO L78 Accepts]: Start accepts. Automaton has 10542 states and 11963 transitions. Word has length 387 [2019-11-16 00:03:59,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:59,599 INFO L462 AbstractCegarLoop]: Abstraction has 10542 states and 11963 transitions. [2019-11-16 00:03:59,599 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:03:59,599 INFO L276 IsEmpty]: Start isEmpty. Operand 10542 states and 11963 transitions. [2019-11-16 00:03:59,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2019-11-16 00:03:59,624 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:59,624 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:59,625 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:59,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:59,625 INFO L82 PathProgramCache]: Analyzing trace with hash 678613974, now seen corresponding path program 1 times [2019-11-16 00:03:59,626 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:59,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422248780] [2019-11-16 00:03:59,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:59,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:59,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:00,187 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 246 proven. 4 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2019-11-16 00:04:00,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422248780] [2019-11-16 00:04:00,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [501876475] [2019-11-16 00:04:00,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_12aa1320-90f2-4b8d-a5f0-360d037cb96a/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:04:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:00,328 INFO L256 TraceCheckSpWp]: Trace formula consists of 518 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:04:00,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:00,477 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-11-16 00:04:00,478 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:04:00,478 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-11-16 00:04:00,478 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438132535] [2019-11-16 00:04:00,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:04:00,479 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:00,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:04:00,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:04:00,480 INFO L87 Difference]: Start difference. First operand 10542 states and 11963 transitions. Second operand 3 states. [2019-11-16 00:04:01,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:01,435 INFO L93 Difference]: Finished difference Result 20712 states and 23530 transitions. [2019-11-16 00:04:01,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:04:01,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 393 [2019-11-16 00:04:01,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:01,453 INFO L225 Difference]: With dead ends: 20712 [2019-11-16 00:04:01,453 INFO L226 Difference]: Without dead ends: 10356 [2019-11-16 00:04:01,465 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 394 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:04:01,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10356 states. [2019-11-16 00:04:01,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10356 to 10356. [2019-11-16 00:04:01,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10356 states. [2019-11-16 00:04:01,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10356 states to 10356 states and 11521 transitions. [2019-11-16 00:04:01,610 INFO L78 Accepts]: Start accepts. Automaton has 10356 states and 11521 transitions. Word has length 393 [2019-11-16 00:04:01,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:01,611 INFO L462 AbstractCegarLoop]: Abstraction has 10356 states and 11521 transitions. [2019-11-16 00:04:01,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:04:01,612 INFO L276 IsEmpty]: Start isEmpty. Operand 10356 states and 11521 transitions. [2019-11-16 00:04:01,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2019-11-16 00:04:01,642 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:04:01,643 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:04:01,849 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:01,849 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:04:01,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:04:01,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1079830754, now seen corresponding path program 1 times [2019-11-16 00:04:01,850 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:04:01,850 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593815795] [2019-11-16 00:04:01,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:01,850 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:04:01,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:04:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:02,630 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 150 proven. 424 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2019-11-16 00:04:02,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593815795] [2019-11-16 00:04:02,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670226367] [2019-11-16 00:04:02,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_12aa1320-90f2-4b8d-a5f0-360d037cb96a/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:04:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:04:02,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 649 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-16 00:04:02,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-16 00:04:02,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-16 00:04:03,067 INFO L134 CoverageAnalysis]: Checked inductivity of 705 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 618 trivial. 0 not checked. [2019-11-16 00:04:03,068 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-16 00:04:03,068 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-11-16 00:04:03,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139039508] [2019-11-16 00:04:03,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:04:03,070 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:04:03,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:04:03,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:04:03,070 INFO L87 Difference]: Start difference. First operand 10356 states and 11521 transitions. Second operand 3 states. [2019-11-16 00:04:04,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:04:04,380 INFO L93 Difference]: Finished difference Result 12012 states and 13324 transitions. [2019-11-16 00:04:04,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:04:04,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 494 [2019-11-16 00:04:04,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:04:04,381 INFO L225 Difference]: With dead ends: 12012 [2019-11-16 00:04:04,381 INFO L226 Difference]: Without dead ends: 0 [2019-11-16 00:04:04,392 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:04:04,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-16 00:04:04,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-16 00:04:04,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-16 00:04:04,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-16 00:04:04,393 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 494 [2019-11-16 00:04:04,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:04:04,394 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-16 00:04:04,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:04:04,394 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-16 00:04:04,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-16 00:04:04,597 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-16 00:04:04,600 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-16 00:04:04,822 WARN L191 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 260 DAG size of output: 131 [2019-11-16 00:04:05,037 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 257 DAG size of output: 131 [2019-11-16 00:04:05,911 WARN L191 SmtUtils]: Spent 865.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 49 [2019-11-16 00:04:06,465 WARN L191 SmtUtils]: Spent 552.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 49 [2019-11-16 00:04:06,466 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-16 00:04:06,466 INFO L443 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-16 00:04:06,466 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-11-16 00:04:06,467 INFO L446 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-11-16 00:04:06,467 INFO L443 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,467 INFO L443 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,467 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,467 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,467 INFO L443 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,467 INFO L443 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,467 INFO L443 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,467 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-16 00:04:06,467 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-16 00:04:06,467 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-16 00:04:06,467 INFO L443 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,467 INFO L443 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,467 INFO L443 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,467 INFO L443 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,468 INFO L443 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,468 INFO L443 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,468 INFO L443 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,468 INFO L443 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,468 INFO L443 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,468 INFO L443 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-11-16 00:04:06,468 INFO L443 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-16 00:04:06,468 INFO L443 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-16 00:04:06,468 INFO L443 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,468 INFO L439 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse1 (= ~a25~0 13)) (.cse6 (<= (+ ~a23~0 43) 0)) (.cse0 (exists ((v_~a23~0_473 Int)) (let ((.cse7 (mod v_~a23~0_473 83))) (and (< v_~a23~0_473 0) (<= (+ .cse7 138) ~a23~0) (not (= 0 .cse7)))))) (.cse4 (<= ~a4~0 0)) (.cse5 (< 140 ~a29~0)) (.cse3 (<= ~a25~0 12)) (.cse2 (= 1 ~a4~0))) (or (and .cse0 .cse1 .cse2) (and (not (= ~a25~0 11)) .cse3 .cse2) (and .cse4 (<= ~a29~0 277)) (and (<= 304 ~a29~0) .cse2) (and .cse1 .cse5 .cse2) (and .cse4 .cse6) (and .cse5 .cse2 .cse6) (and .cse0 .cse3 .cse2) (and (not (= ~a25~0 9)) .cse4) (and .cse5 .cse3 .cse2))) [2019-11-16 00:04:06,468 INFO L443 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,468 INFO L443 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,468 INFO L443 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,468 INFO L443 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,469 INFO L443 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,469 INFO L443 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,469 INFO L443 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,469 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,469 INFO L443 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-16 00:04:06,469 INFO L443 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-11-16 00:04:06,469 INFO L443 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-11-16 00:04:06,469 INFO L443 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-11-16 00:04:06,469 INFO L443 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-11-16 00:04:06,469 INFO L443 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-11-16 00:04:06,469 INFO L443 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-11-16 00:04:06,469 INFO L443 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,469 INFO L443 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,469 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,469 INFO L443 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,469 INFO L443 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,470 INFO L443 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,470 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,470 INFO L443 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,470 INFO L443 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,470 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,470 INFO L443 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-16 00:04:06,470 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-11-16 00:04:06,470 INFO L443 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-11-16 00:04:06,470 INFO L443 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-11-16 00:04:06,470 INFO L443 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,470 INFO L443 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,470 INFO L443 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,470 INFO L443 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,470 INFO L443 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,470 INFO L443 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-16 00:04:06,470 INFO L443 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-11-16 00:04:06,471 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-16 00:04:06,471 INFO L443 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,471 INFO L443 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,471 INFO L443 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,471 INFO L443 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,471 INFO L443 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-11-16 00:04:06,471 INFO L443 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-11-16 00:04:06,471 INFO L443 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,471 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,471 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,471 INFO L443 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,471 INFO L443 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,471 INFO L443 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,471 INFO L443 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-11-16 00:04:06,471 INFO L443 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-11-16 00:04:06,471 INFO L443 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,472 INFO L443 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,472 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-16 00:04:06,472 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-16 00:04:06,472 INFO L443 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-16 00:04:06,472 INFO L443 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,472 INFO L443 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,472 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,472 INFO L443 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,472 INFO L443 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,472 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,472 INFO L443 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,472 INFO L443 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-11-16 00:04:06,472 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-16 00:04:06,472 INFO L443 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-16 00:04:06,472 INFO L443 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-11-16 00:04:06,472 INFO L443 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-11-16 00:04:06,473 INFO L443 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-11-16 00:04:06,473 INFO L443 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-11-16 00:04:06,473 INFO L443 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,473 INFO L443 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,473 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-16 00:04:06,473 INFO L443 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-11-16 00:04:06,473 INFO L443 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-11-16 00:04:06,473 INFO L443 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,473 INFO L443 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,473 INFO L443 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,473 INFO L443 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,473 INFO L443 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,473 INFO L443 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-16 00:04:06,473 INFO L443 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-11-16 00:04:06,473 INFO L443 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-11-16 00:04:06,474 INFO L443 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,474 INFO L443 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,474 INFO L443 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,474 INFO L443 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,474 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,474 INFO L443 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,474 INFO L443 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-11-16 00:04:06,474 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-11-16 00:04:06,474 INFO L443 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-11-16 00:04:06,474 INFO L443 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,474 INFO L443 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,474 INFO L443 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,474 INFO L443 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,474 INFO L443 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,474 INFO L443 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,474 INFO L443 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,475 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-16 00:04:06,475 INFO L443 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,475 INFO L443 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-11-16 00:04:06,475 INFO L443 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-16 00:04:06,475 INFO L443 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-11-16 00:04:06,475 INFO L443 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,475 INFO L443 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,475 INFO L443 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,475 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 78) no Hoare annotation was computed. [2019-11-16 00:04:06,475 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,475 INFO L443 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,475 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,475 INFO L443 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,475 INFO L443 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,475 INFO L443 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,475 INFO L443 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,476 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,476 INFO L443 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-11-16 00:04:06,476 INFO L443 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-11-16 00:04:06,476 INFO L443 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-16 00:04:06,476 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-11-16 00:04:06,476 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-16 00:04:06,476 INFO L443 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,476 INFO L443 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,476 INFO L443 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,476 INFO L443 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,476 INFO L443 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,476 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,476 INFO L443 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,476 INFO L443 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-11-16 00:04:06,476 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-16 00:04:06,480 INFO L443 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-11-16 00:04:06,480 INFO L443 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,480 INFO L443 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,480 INFO L443 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,480 INFO L443 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-11-16 00:04:06,481 INFO L443 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-11-16 00:04:06,481 INFO L443 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,481 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,481 INFO L443 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,481 INFO L443 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,481 INFO L443 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,481 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-16 00:04:06,481 INFO L443 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-16 00:04:06,481 INFO L443 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,481 INFO L443 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,481 INFO L443 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-11-16 00:04:06,481 INFO L443 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-11-16 00:04:06,481 INFO L443 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,481 INFO L443 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,481 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,481 INFO L443 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,482 INFO L443 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,482 INFO L443 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,482 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-11-16 00:04:06,482 INFO L443 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-16 00:04:06,482 INFO L443 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-11-16 00:04:06,482 INFO L443 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-11-16 00:04:06,482 INFO L443 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,482 INFO L443 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,483 INFO L443 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,483 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,483 INFO L443 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,483 INFO L443 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,483 INFO L443 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,483 INFO L443 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,483 INFO L443 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-16 00:04:06,483 INFO L443 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-16 00:04:06,484 INFO L443 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-11-16 00:04:06,484 INFO L443 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-11-16 00:04:06,484 INFO L443 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-11-16 00:04:06,484 INFO L443 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-11-16 00:04:06,484 INFO L443 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,484 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,484 INFO L443 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,485 INFO L443 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,485 INFO L443 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,485 INFO L443 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,485 INFO L443 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,485 INFO L443 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-16 00:04:06,485 INFO L443 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-16 00:04:06,485 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-16 00:04:06,485 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,486 INFO L443 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,486 INFO L443 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,486 INFO L443 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,486 INFO L443 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,486 INFO L443 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,486 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-16 00:04:06,486 INFO L443 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-16 00:04:06,487 INFO L443 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,487 INFO L443 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,487 INFO L443 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,487 INFO L443 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,487 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,487 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,487 INFO L443 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,487 INFO L443 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-11-16 00:04:06,488 INFO L443 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,488 INFO L443 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,488 INFO L443 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,488 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-16 00:04:06,488 INFO L443 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-16 00:04:06,488 INFO L443 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-11-16 00:04:06,488 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,488 INFO L443 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-11-16 00:04:06,489 INFO L443 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,489 INFO L443 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-11-16 00:04:06,489 INFO L443 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,489 INFO L443 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,489 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,489 INFO L443 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,489 INFO L443 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,490 INFO L443 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,490 INFO L443 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-11-16 00:04:06,490 INFO L443 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-16 00:04:06,490 INFO L443 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-11-16 00:04:06,490 INFO L443 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,490 INFO L443 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,490 INFO L443 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,491 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-16 00:04:06,491 INFO L443 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,491 INFO L443 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,491 INFO L443 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,491 INFO L443 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,491 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,491 INFO L443 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,491 INFO L443 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,492 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-16 00:04:06,492 INFO L443 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-11-16 00:04:06,492 INFO L443 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-11-16 00:04:06,492 INFO L443 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,492 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-11-16 00:04:06,492 INFO L443 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-11-16 00:04:06,492 INFO L443 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,493 INFO L443 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,493 INFO L443 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,493 INFO L443 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,493 INFO L443 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,493 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,493 INFO L443 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-11-16 00:04:06,493 INFO L443 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-16 00:04:06,494 INFO L443 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-16 00:04:06,494 INFO L443 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,494 INFO L443 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,494 INFO L443 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,494 INFO L439 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse1 (= ~a25~0 13)) (.cse6 (<= (+ ~a23~0 43) 0)) (.cse0 (exists ((v_~a23~0_473 Int)) (let ((.cse7 (mod v_~a23~0_473 83))) (and (< v_~a23~0_473 0) (<= (+ .cse7 138) ~a23~0) (not (= 0 .cse7)))))) (.cse4 (<= ~a4~0 0)) (.cse5 (< 140 ~a29~0)) (.cse3 (<= ~a25~0 12)) (.cse2 (= 1 ~a4~0))) (or (and .cse0 .cse1 .cse2) (and (not (= ~a25~0 11)) .cse3 .cse2) (and .cse4 (<= ~a29~0 277)) (and (<= 304 ~a29~0) .cse2) (and .cse1 .cse5 .cse2) (and .cse4 .cse6) (and .cse5 .cse2 .cse6) (and .cse0 .cse3 .cse2) (and (not (= ~a25~0 9)) .cse4) (and .cse5 .cse3 .cse2))) [2019-11-16 00:04:06,494 INFO L443 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,495 INFO L443 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-11-16 00:04:06,495 INFO L443 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-11-16 00:04:06,495 INFO L443 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,495 INFO L443 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,495 INFO L443 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-11-16 00:04:06,495 INFO L443 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,495 INFO L443 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,496 INFO L443 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-11-16 00:04:06,504 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,505 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,506 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,507 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,516 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,518 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,519 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,520 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:04:06 BoogieIcfgContainer [2019-11-16 00:04:06,525 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:04:06,526 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:04:06,526 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:04:06,526 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:04:06,527 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:03:28" (3/4) ... [2019-11-16 00:04:06,530 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-16 00:04:06,560 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-16 00:04:06,562 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-16 00:04:06,593 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((\exists v_~a23~0_473 : int :: (v_~a23~0_473 < 0 && v_~a23~0_473 % 83 + 138 <= a23) && !(0 == v_~a23~0_473 % 83)) && a25 == 13) && 1 == a4) || ((!(a25 == 11) && a25 <= 12) && 1 == a4)) || (a4 <= 0 && a29 <= 277)) || (304 <= a29 && 1 == a4)) || ((a25 == 13 && 140 < a29) && 1 == a4)) || (a4 <= 0 && a23 + 43 <= 0)) || ((140 < a29 && 1 == a4) && a23 + 43 <= 0)) || (((\exists v_~a23~0_473 : int :: (v_~a23~0_473 < 0 && v_~a23~0_473 % 83 + 138 <= a23) && !(0 == v_~a23~0_473 % 83)) && a25 <= 12) && 1 == a4)) || (!(a25 == 9) && a4 <= 0)) || ((140 < a29 && a25 <= 12) && 1 == a4) [2019-11-16 00:04:06,597 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((\exists v_~a23~0_473 : int :: (v_~a23~0_473 < 0 && v_~a23~0_473 % 83 + 138 <= a23) && !(0 == v_~a23~0_473 % 83)) && a25 == 13) && 1 == a4) || ((!(a25 == 11) && a25 <= 12) && 1 == a4)) || (a4 <= 0 && a29 <= 277)) || (304 <= a29 && 1 == a4)) || ((a25 == 13 && 140 < a29) && 1 == a4)) || (a4 <= 0 && a23 + 43 <= 0)) || ((140 < a29 && 1 == a4) && a23 + 43 <= 0)) || (((\exists v_~a23~0_473 : int :: (v_~a23~0_473 < 0 && v_~a23~0_473 % 83 + 138 <= a23) && !(0 == v_~a23~0_473 % 83)) && a25 <= 12) && 1 == a4)) || (!(a25 == 9) && a4 <= 0)) || ((140 < a29 && a25 <= 12) && 1 == a4) [2019-11-16 00:04:06,758 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_12aa1320-90f2-4b8d-a5f0-360d037cb96a/bin/uautomizer/witness.graphml [2019-11-16 00:04:06,759 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:04:06,760 INFO L168 Benchmark]: Toolchain (without parser) took 41338.31 ms. Allocated memory was 1.0 GB in the beginning and 2.1 GB in the end (delta: 1.1 GB). Free memory was 939.4 MB in the beginning and 916.1 MB in the end (delta: 23.3 MB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2019-11-16 00:04:06,760 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-16 00:04:06,761 INFO L168 Benchmark]: CACSL2BoogieTranslator took 935.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -147.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:04:06,761 INFO L168 Benchmark]: Boogie Procedure Inliner took 144.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. [2019-11-16 00:04:06,762 INFO L168 Benchmark]: Boogie Preprocessor took 130.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2019-11-16 00:04:06,762 INFO L168 Benchmark]: RCFGBuilder took 2272.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 881.1 MB in the end (delta: 171.6 MB). Peak memory consumption was 171.6 MB. Max. memory is 11.5 GB. [2019-11-16 00:04:06,762 INFO L168 Benchmark]: TraceAbstraction took 37616.08 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 932.2 MB). Free memory was 881.1 MB in the beginning and 948.1 MB in the end (delta: -67.0 MB). Peak memory consumption was 865.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:04:06,763 INFO L168 Benchmark]: Witness Printer took 233.13 ms. Allocated memory is still 2.1 GB. Free memory was 948.1 MB in the beginning and 916.1 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 MB. Max. memory is 11.5 GB. [2019-11-16 00:04:06,765 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 935.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -147.2 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 144.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.3 MB). Peak memory consumption was 20.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 130.19 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2272.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 881.1 MB in the end (delta: 171.6 MB). Peak memory consumption was 171.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 37616.08 ms. Allocated memory was 1.2 GB in the beginning and 2.1 GB in the end (delta: 932.2 MB). Free memory was 881.1 MB in the beginning and 948.1 MB in the end (delta: -67.0 MB). Peak memory consumption was 865.2 MB. Max. memory is 11.5 GB. * Witness Printer took 233.13 ms. Allocated memory is still 2.1 GB. Free memory was 948.1 MB in the beginning and 916.1 MB in the end (delta: 32.0 MB). Peak memory consumption was 32.0 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_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 78]: 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: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2019-11-16 00:04:06,774 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,774 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,775 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,779 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,780 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] Derived loop invariant: (((((((((((\exists v_~a23~0_473 : int :: (v_~a23~0_473 < 0 && v_~a23~0_473 % 83 + 138 <= a23) && !(0 == v_~a23~0_473 % 83)) && a25 == 13) && 1 == a4) || ((!(a25 == 11) && a25 <= 12) && 1 == a4)) || (a4 <= 0 && a29 <= 277)) || (304 <= a29 && 1 == a4)) || ((a25 == 13 && 140 < a29) && 1 == a4)) || (a4 <= 0 && a23 + 43 <= 0)) || ((140 < a29 && 1 == a4) && a23 + 43 <= 0)) || (((\exists v_~a23~0_473 : int :: (v_~a23~0_473 < 0 && v_~a23~0_473 % 83 + 138 <= a23) && !(0 == v_~a23~0_473 % 83)) && a25 <= 12) && 1 == a4)) || (!(a25 == 9) && a4 <= 0)) || ((140 < a29 && a25 <= 12) && 1 == a4) - InvariantResult [Line: 22]: Loop Invariant [2019-11-16 00:04:06,782 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,782 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,782 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,783 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,786 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,787 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,787 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,787 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] [2019-11-16 00:04:06,787 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_473,QUANTIFIED] Derived loop invariant: (((((((((((\exists v_~a23~0_473 : int :: (v_~a23~0_473 < 0 && v_~a23~0_473 % 83 + 138 <= a23) && !(0 == v_~a23~0_473 % 83)) && a25 == 13) && 1 == a4) || ((!(a25 == 11) && a25 <= 12) && 1 == a4)) || (a4 <= 0 && a29 <= 277)) || (304 <= a29 && 1 == a4)) || ((a25 == 13 && 140 < a29) && 1 == a4)) || (a4 <= 0 && a23 + 43 <= 0)) || ((140 < a29 && 1 == a4) && a23 + 43 <= 0)) || (((\exists v_~a23~0_473 : int :: (v_~a23~0_473 < 0 && v_~a23~0_473 % 83 + 138 <= a23) && !(0 == v_~a23~0_473 % 83)) && a25 <= 12) && 1 == a4)) || (!(a25 == 9) && a4 <= 0)) || ((140 < a29 && a25 <= 12) && 1 == a4) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 37.4s, OverallIterations: 9, TraceHistogramMax: 5, AutomataDifference: 27.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, HoareTripleCheckerStatistics: 1344 SDtfs, 7765 SDslu, 635 SDs, 0 SdLazy, 19458 SolverSat, 3076 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1498 GetRequests, 1427 SyntacticMatches, 5 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10542occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 8736 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 140 NumberOfFragments, 251 HoareAnnotationTreeSize, 3 FomulaSimplifications, 17378 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 4568 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 3831 NumberOfCodeBlocks, 3831 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 3818 ConstructedInterpolants, 44 QuantifiedInterpolants, 4254436 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1921 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 13 InterpolantComputations, 8 PerfectInterpolantSequences, 3181/3706 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...