./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem11_label30.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_20e317fa-dab2-4b0e-ba4c-38b5f1ba4861/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_20e317fa-dab2-4b0e-ba4c-38b5f1ba4861/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_20e317fa-dab2-4b0e-ba4c-38b5f1ba4861/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_20e317fa-dab2-4b0e-ba4c-38b5f1ba4861/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem11_label30.c -s /tmp/vcloud-vcloud-master/worker/run_dir_20e317fa-dab2-4b0e-ba4c-38b5f1ba4861/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_20e317fa-dab2-4b0e-ba4c-38b5f1ba4861/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 8d242fd154f76fbbdca66276c5caf34f74dcc939 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 03:28:43,076 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 03:28:43,078 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 03:28:43,094 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 03:28:43,094 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 03:28:43,096 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 03:28:43,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 03:28:43,108 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 03:28:43,113 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 03:28:43,117 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 03:28:43,119 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 03:28:43,120 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 03:28:43,120 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 03:28:43,123 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 03:28:43,124 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 03:28:43,126 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 03:28:43,127 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 03:28:43,128 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 03:28:43,131 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 03:28:43,135 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 03:28:43,139 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 03:28:43,141 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 03:28:43,144 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 03:28:43,145 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 03:28:43,147 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 03:28:43,148 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 03:28:43,148 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 03:28:43,150 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 03:28:43,150 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 03:28:43,151 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 03:28:43,151 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 03:28:43,152 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 03:28:43,153 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 03:28:43,154 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 03:28:43,155 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 03:28:43,155 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 03:28:43,156 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 03:28:43,156 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 03:28:43,156 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 03:28:43,157 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 03:28:43,159 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 03:28:43,160 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_20e317fa-dab2-4b0e-ba4c-38b5f1ba4861/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 03:28:43,187 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 03:28:43,197 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 03:28:43,198 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 03:28:43,199 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 03:28:43,199 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 03:28:43,199 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 03:28:43,200 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 03:28:43,200 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 03:28:43,200 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 03:28:43,200 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 03:28:43,200 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 03:28:43,201 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 03:28:43,201 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 03:28:43,201 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 03:28:43,201 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 03:28:43,201 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 03:28:43,202 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 03:28:43,202 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 03:28:43,202 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 03:28:43,202 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 03:28:43,203 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 03:28:43,203 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:28:43,203 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 03:28:43,203 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 03:28:43,204 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 03:28:43,204 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 03:28:43,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 03:28:43,205 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 03:28:43,206 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_20e317fa-dab2-4b0e-ba4c-38b5f1ba4861/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 -> 8d242fd154f76fbbdca66276c5caf34f74dcc939 [2019-11-20 03:28:43,377 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 03:28:43,392 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 03:28:43,396 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 03:28:43,397 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 03:28:43,398 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 03:28:43,398 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_20e317fa-dab2-4b0e-ba4c-38b5f1ba4861/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem11_label30.c [2019-11-20 03:28:43,461 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_20e317fa-dab2-4b0e-ba4c-38b5f1ba4861/bin/uautomizer/data/c85626eb6/7e82f915ef014e0aa5a49af82910c263/FLAG33db33e8c [2019-11-20 03:28:43,955 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 03:28:43,959 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_20e317fa-dab2-4b0e-ba4c-38b5f1ba4861/sv-benchmarks/c/eca-rers2012/Problem11_label30.c [2019-11-20 03:28:43,973 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_20e317fa-dab2-4b0e-ba4c-38b5f1ba4861/bin/uautomizer/data/c85626eb6/7e82f915ef014e0aa5a49af82910c263/FLAG33db33e8c [2019-11-20 03:28:44,202 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_20e317fa-dab2-4b0e-ba4c-38b5f1ba4861/bin/uautomizer/data/c85626eb6/7e82f915ef014e0aa5a49af82910c263 [2019-11-20 03:28:44,205 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 03:28:44,207 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 03:28:44,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 03:28:44,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 03:28:44,212 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 03:28:44,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:28:44" (1/1) ... [2019-11-20 03:28:44,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cdfe7f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:44, skipping insertion in model container [2019-11-20 03:28:44,218 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:28:44" (1/1) ... [2019-11-20 03:28:44,226 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 03:28:44,288 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 03:28:45,026 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:28:45,034 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 03:28:45,201 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 03:28:45,220 INFO L192 MainTranslator]: Completed translation [2019-11-20 03:28:45,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:45 WrapperNode [2019-11-20 03:28:45,221 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 03:28:45,221 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 03:28:45,222 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 03:28:45,222 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 03:28:45,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:45" (1/1) ... [2019-11-20 03:28:45,259 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:45" (1/1) ... [2019-11-20 03:28:45,340 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 03:28:45,341 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 03:28:45,341 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 03:28:45,341 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 03:28:45,351 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:45" (1/1) ... [2019-11-20 03:28:45,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:45" (1/1) ... [2019-11-20 03:28:45,364 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:45" (1/1) ... [2019-11-20 03:28:45,364 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:45" (1/1) ... [2019-11-20 03:28:45,406 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:45" (1/1) ... [2019-11-20 03:28:45,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:45" (1/1) ... [2019-11-20 03:28:45,440 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:45" (1/1) ... [2019-11-20 03:28:45,450 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 03:28:45,451 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 03:28:45,451 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 03:28:45,451 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 03:28:45,453 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20e317fa-dab2-4b0e-ba4c-38b5f1ba4861/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 03:28:45,523 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 03:28:45,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 03:28:47,517 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 03:28:47,518 INFO L285 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-20 03:28:47,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:28:47 BoogieIcfgContainer [2019-11-20 03:28:47,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 03:28:47,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 03:28:47,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 03:28:47,526 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 03:28:47,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:28:44" (1/3) ... [2019-11-20 03:28:47,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@491234a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:28:47, skipping insertion in model container [2019-11-20 03:28:47,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:28:45" (2/3) ... [2019-11-20 03:28:47,528 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@491234a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:28:47, skipping insertion in model container [2019-11-20 03:28:47,528 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:28:47" (3/3) ... [2019-11-20 03:28:47,530 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem11_label30.c [2019-11-20 03:28:47,541 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 03:28:47,549 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 03:28:47,561 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 03:28:47,604 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 03:28:47,605 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 03:28:47,606 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 03:28:47,606 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 03:28:47,606 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 03:28:47,606 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 03:28:47,606 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 03:28:47,607 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 03:28:47,638 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states. [2019-11-20 03:28:47,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-20 03:28:47,646 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:28:47,647 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:28:47,648 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:28:47,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:28:47,654 INFO L82 PathProgramCache]: Analyzing trace with hash -748286455, now seen corresponding path program 1 times [2019-11-20 03:28:47,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:28:47,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689983026] [2019-11-20 03:28:47,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:28:47,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:28:47,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:28:47,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689983026] [2019-11-20 03:28:47,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:28:47,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:28:47,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884548210] [2019-11-20 03:28:47,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:28:47,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:28:48,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:28:48,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:28:48,003 INFO L87 Difference]: Start difference. First operand 283 states. Second operand 4 states. [2019-11-20 03:28:50,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:28:50,650 INFO L93 Difference]: Finished difference Result 973 states and 1743 transitions. [2019-11-20 03:28:50,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:28:50,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-11-20 03:28:50,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:28:50,674 INFO L225 Difference]: With dead ends: 973 [2019-11-20 03:28:50,675 INFO L226 Difference]: Without dead ends: 607 [2019-11-20 03:28:50,680 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:28:50,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-11-20 03:28:50,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 604. [2019-11-20 03:28:50,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2019-11-20 03:28:50,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 874 transitions. [2019-11-20 03:28:50,756 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 874 transitions. Word has length 29 [2019-11-20 03:28:50,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:28:50,757 INFO L462 AbstractCegarLoop]: Abstraction has 604 states and 874 transitions. [2019-11-20 03:28:50,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:28:50,757 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 874 transitions. [2019-11-20 03:28:50,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-20 03:28:50,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:28:50,762 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:28:50,762 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:28:50,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:28:50,763 INFO L82 PathProgramCache]: Analyzing trace with hash -618924976, now seen corresponding path program 1 times [2019-11-20 03:28:50,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:28:50,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852985417] [2019-11-20 03:28:50,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:28:50,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:28:50,896 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:28:50,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852985417] [2019-11-20 03:28:50,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:28:50,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:28:50,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595402521] [2019-11-20 03:28:50,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:28:50,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:28:50,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:28:50,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:28:50,900 INFO L87 Difference]: Start difference. First operand 604 states and 874 transitions. Second operand 4 states. [2019-11-20 03:28:52,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:28:52,733 INFO L93 Difference]: Finished difference Result 2328 states and 3390 transitions. [2019-11-20 03:28:52,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:28:52,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-11-20 03:28:52,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:28:52,747 INFO L225 Difference]: With dead ends: 2328 [2019-11-20 03:28:52,747 INFO L226 Difference]: Without dead ends: 1726 [2019-11-20 03:28:52,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:28:52,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2019-11-20 03:28:52,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1710. [2019-11-20 03:28:52,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2019-11-20 03:28:52,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2342 transitions. [2019-11-20 03:28:52,839 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2342 transitions. Word has length 97 [2019-11-20 03:28:52,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:28:52,840 INFO L462 AbstractCegarLoop]: Abstraction has 1710 states and 2342 transitions. [2019-11-20 03:28:52,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:28:52,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2342 transitions. [2019-11-20 03:28:52,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-20 03:28:52,851 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:28:52,851 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:28:52,852 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:28:52,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:28:52,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1171000047, now seen corresponding path program 1 times [2019-11-20 03:28:52,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:28:52,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088803795] [2019-11-20 03:28:52,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:28:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:28:53,041 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:28:53,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088803795] [2019-11-20 03:28:53,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:28:53,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:28:53,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139434321] [2019-11-20 03:28:53,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:28:53,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:28:53,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:28:53,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:28:53,047 INFO L87 Difference]: Start difference. First operand 1710 states and 2342 transitions. Second operand 3 states. [2019-11-20 03:28:54,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:28:54,046 INFO L93 Difference]: Finished difference Result 4707 states and 6454 transitions. [2019-11-20 03:28:54,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:28:54,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-20 03:28:54,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:28:54,066 INFO L225 Difference]: With dead ends: 4707 [2019-11-20 03:28:54,066 INFO L226 Difference]: Without dead ends: 2999 [2019-11-20 03:28:54,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:28:54,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2999 states. [2019-11-20 03:28:54,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2999 to 2999. [2019-11-20 03:28:54,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2999 states. [2019-11-20 03:28:54,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2999 states to 2999 states and 3735 transitions. [2019-11-20 03:28:54,137 INFO L78 Accepts]: Start accepts. Automaton has 2999 states and 3735 transitions. Word has length 123 [2019-11-20 03:28:54,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:28:54,139 INFO L462 AbstractCegarLoop]: Abstraction has 2999 states and 3735 transitions. [2019-11-20 03:28:54,139 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:28:54,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2999 states and 3735 transitions. [2019-11-20 03:28:54,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-20 03:28:54,154 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:28:54,154 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:28:54,155 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:28:54,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:28:54,155 INFO L82 PathProgramCache]: Analyzing trace with hash -1063098843, now seen corresponding path program 1 times [2019-11-20 03:28:54,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:28:54,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548115342] [2019-11-20 03:28:54,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:28:54,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:28:54,386 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-20 03:28:54,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548115342] [2019-11-20 03:28:54,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865703847] [2019-11-20 03:28:54,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20e317fa-dab2-4b0e-ba4c-38b5f1ba4861/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:28:54,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:28:54,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 03:28:54,486 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:28:54,542 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-11-20 03:28:54,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:28:54,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2019-11-20 03:28:54,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269077372] [2019-11-20 03:28:54,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:28:54,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:28:54,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:28:54,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:28:54,545 INFO L87 Difference]: Start difference. First operand 2999 states and 3735 transitions. Second operand 3 states. [2019-11-20 03:28:55,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:28:55,713 INFO L93 Difference]: Finished difference Result 7658 states and 9369 transitions. [2019-11-20 03:28:55,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:28:55,713 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-20 03:28:55,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:28:55,744 INFO L225 Difference]: With dead ends: 7658 [2019-11-20 03:28:55,744 INFO L226 Difference]: Without dead ends: 4661 [2019-11-20 03:28:55,748 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:28:55,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4661 states. [2019-11-20 03:28:55,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4661 to 4660. [2019-11-20 03:28:55,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2019-11-20 03:28:55,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 5631 transitions. [2019-11-20 03:28:55,860 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 5631 transitions. Word has length 151 [2019-11-20 03:28:55,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:28:55,861 INFO L462 AbstractCegarLoop]: Abstraction has 4660 states and 5631 transitions. [2019-11-20 03:28:55,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:28:55,862 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 5631 transitions. [2019-11-20 03:28:55,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-20 03:28:55,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:28:55,867 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:28:56,070 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:28:56,070 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:28:56,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:28:56,071 INFO L82 PathProgramCache]: Analyzing trace with hash 786326133, now seen corresponding path program 1 times [2019-11-20 03:28:56,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:28:56,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972687213] [2019-11-20 03:28:56,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:28:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:28:56,232 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:28:56,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972687213] [2019-11-20 03:28:56,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:28:56,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:28:56,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502206687] [2019-11-20 03:28:56,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:28:56,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:28:56,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:28:56,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:28:56,235 INFO L87 Difference]: Start difference. First operand 4660 states and 5631 transitions. Second operand 4 states. [2019-11-20 03:28:58,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:28:58,099 INFO L93 Difference]: Finished difference Result 10812 states and 13165 transitions. [2019-11-20 03:28:58,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:28:58,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 156 [2019-11-20 03:28:58,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:28:58,136 INFO L225 Difference]: With dead ends: 10812 [2019-11-20 03:28:58,136 INFO L226 Difference]: Without dead ends: 6338 [2019-11-20 03:28:58,142 INFO L630 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-20 03:28:58,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6338 states. [2019-11-20 03:28:58,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6338 to 5948. [2019-11-20 03:28:58,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5948 states. [2019-11-20 03:28:58,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5948 states to 5948 states and 7113 transitions. [2019-11-20 03:28:58,264 INFO L78 Accepts]: Start accepts. Automaton has 5948 states and 7113 transitions. Word has length 156 [2019-11-20 03:28:58,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:28:58,265 INFO L462 AbstractCegarLoop]: Abstraction has 5948 states and 7113 transitions. [2019-11-20 03:28:58,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:28:58,265 INFO L276 IsEmpty]: Start isEmpty. Operand 5948 states and 7113 transitions. [2019-11-20 03:28:58,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-11-20 03:28:58,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:28:58,269 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-20 03:28:58,270 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:28:58,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:28:58,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1660657955, now seen corresponding path program 1 times [2019-11-20 03:28:58,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:28:58,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460139043] [2019-11-20 03:28:58,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:28:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:28:58,803 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 0 proven. 142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:28:58,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460139043] [2019-11-20 03:28:58,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851001986] [2019-11-20 03:28:58,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20e317fa-dab2-4b0e-ba4c-38b5f1ba4861/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-20 03:28:58,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:28:58,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 03:28:58,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:28:58,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:28:58,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:28:59,385 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 53 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:28:59,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:28:59,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3] total 8 [2019-11-20 03:28:59,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019920193] [2019-11-20 03:28:59,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 03:28:59,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:28:59,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 03:28:59,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-20 03:28:59,388 INFO L87 Difference]: Start difference. First operand 5948 states and 7113 transitions. Second operand 9 states. [2019-11-20 03:29:12,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:29:12,877 INFO L93 Difference]: Finished difference Result 22413 states and 26718 transitions. [2019-11-20 03:29:12,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-20 03:29:12,880 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 241 [2019-11-20 03:29:12,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:29:12,956 INFO L225 Difference]: With dead ends: 22413 [2019-11-20 03:29:12,956 INFO L226 Difference]: Without dead ends: 15730 [2019-11-20 03:29:12,966 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=392, Unknown=0, NotChecked=0, Total=506 [2019-11-20 03:29:12,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15730 states. [2019-11-20 03:29:13,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15730 to 13135. [2019-11-20 03:29:13,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13135 states. [2019-11-20 03:29:13,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13135 states to 13135 states and 15300 transitions. [2019-11-20 03:29:13,286 INFO L78 Accepts]: Start accepts. Automaton has 13135 states and 15300 transitions. Word has length 241 [2019-11-20 03:29:13,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:29:13,287 INFO L462 AbstractCegarLoop]: Abstraction has 13135 states and 15300 transitions. [2019-11-20 03:29:13,287 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 03:29:13,288 INFO L276 IsEmpty]: Start isEmpty. Operand 13135 states and 15300 transitions. [2019-11-20 03:29:13,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2019-11-20 03:29:13,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:29:13,304 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:29:13,507 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:29:13,508 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:29:13,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:29:13,508 INFO L82 PathProgramCache]: Analyzing trace with hash 378186544, now seen corresponding path program 1 times [2019-11-20 03:29:13,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:29:13,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530447544] [2019-11-20 03:29:13,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:29:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:29:13,759 INFO L134 CoverageAnalysis]: Checked inductivity of 323 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2019-11-20 03:29:13,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530447544] [2019-11-20 03:29:13,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:29:13,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:29:13,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885454477] [2019-11-20 03:29:13,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:29:13,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:29:13,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:29:13,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:29:13,762 INFO L87 Difference]: Start difference. First operand 13135 states and 15300 transitions. Second operand 4 states. [2019-11-20 03:29:15,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:29:15,416 INFO L93 Difference]: Finished difference Result 29031 states and 34020 transitions. [2019-11-20 03:29:15,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:29:15,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 306 [2019-11-20 03:29:15,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:29:15,453 INFO L225 Difference]: With dead ends: 29031 [2019-11-20 03:29:15,453 INFO L226 Difference]: Without dead ends: 16266 [2019-11-20 03:29:15,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:29:15,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16266 states. [2019-11-20 03:29:15,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16266 to 14608. [2019-11-20 03:29:15,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14608 states. [2019-11-20 03:29:15,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14608 states to 14608 states and 16863 transitions. [2019-11-20 03:29:15,876 INFO L78 Accepts]: Start accepts. Automaton has 14608 states and 16863 transitions. Word has length 306 [2019-11-20 03:29:15,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:29:15,877 INFO L462 AbstractCegarLoop]: Abstraction has 14608 states and 16863 transitions. [2019-11-20 03:29:15,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:29:15,877 INFO L276 IsEmpty]: Start isEmpty. Operand 14608 states and 16863 transitions. [2019-11-20 03:29:15,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2019-11-20 03:29:15,891 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:29:15,892 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:29:15,892 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:29:15,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:29:15,893 INFO L82 PathProgramCache]: Analyzing trace with hash -2019684113, now seen corresponding path program 1 times [2019-11-20 03:29:15,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:29:15,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762587941] [2019-11-20 03:29:15,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:29:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:29:16,158 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 249 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-11-20 03:29:16,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762587941] [2019-11-20 03:29:16,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:29:16,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:29:16,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022410176] [2019-11-20 03:29:16,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:29:16,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:29:16,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:29:16,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:29:16,166 INFO L87 Difference]: Start difference. First operand 14608 states and 16863 transitions. Second operand 4 states. [2019-11-20 03:29:17,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:29:17,935 INFO L93 Difference]: Finished difference Result 32002 states and 37013 transitions. [2019-11-20 03:29:17,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:29:17,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 311 [2019-11-20 03:29:17,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:29:17,967 INFO L225 Difference]: With dead ends: 32002 [2019-11-20 03:29:17,967 INFO L226 Difference]: Without dead ends: 17764 [2019-11-20 03:29:17,985 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:29:18,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17764 states. [2019-11-20 03:29:18,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17764 to 15896. [2019-11-20 03:29:18,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15896 states. [2019-11-20 03:29:18,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15896 states to 15896 states and 18199 transitions. [2019-11-20 03:29:18,254 INFO L78 Accepts]: Start accepts. Automaton has 15896 states and 18199 transitions. Word has length 311 [2019-11-20 03:29:18,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:29:18,255 INFO L462 AbstractCegarLoop]: Abstraction has 15896 states and 18199 transitions. [2019-11-20 03:29:18,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:29:18,256 INFO L276 IsEmpty]: Start isEmpty. Operand 15896 states and 18199 transitions. [2019-11-20 03:29:18,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2019-11-20 03:29:18,268 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:29:18,269 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:29:18,269 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:29:18,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:29:18,270 INFO L82 PathProgramCache]: Analyzing trace with hash 586529090, now seen corresponding path program 1 times [2019-11-20 03:29:18,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:29:18,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177686772] [2019-11-20 03:29:18,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:29:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:29:18,720 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 03:29:18,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177686772] [2019-11-20 03:29:18,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:29:18,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:29:18,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122068137] [2019-11-20 03:29:18,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:29:18,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:29:18,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:29:18,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:29:18,723 INFO L87 Difference]: Start difference. First operand 15896 states and 18199 transitions. Second operand 4 states. [2019-11-20 03:29:20,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:29:20,178 INFO L93 Difference]: Finished difference Result 29964 states and 34514 transitions. [2019-11-20 03:29:20,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:29:20,182 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 315 [2019-11-20 03:29:20,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:29:20,209 INFO L225 Difference]: With dead ends: 29964 [2019-11-20 03:29:20,209 INFO L226 Difference]: Without dead ends: 17021 [2019-11-20 03:29:20,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:29:20,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17021 states. [2019-11-20 03:29:20,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17021 to 16453. [2019-11-20 03:29:20,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16453 states. [2019-11-20 03:29:20,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16453 states to 16453 states and 18773 transitions. [2019-11-20 03:29:20,461 INFO L78 Accepts]: Start accepts. Automaton has 16453 states and 18773 transitions. Word has length 315 [2019-11-20 03:29:20,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:29:20,462 INFO L462 AbstractCegarLoop]: Abstraction has 16453 states and 18773 transitions. [2019-11-20 03:29:20,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:29:20,462 INFO L276 IsEmpty]: Start isEmpty. Operand 16453 states and 18773 transitions. [2019-11-20 03:29:20,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-11-20 03:29:20,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:29:20,482 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:29:20,483 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:29:20,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:29:20,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1565769179, now seen corresponding path program 1 times [2019-11-20 03:29:20,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:29:20,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776143092] [2019-11-20 03:29:20,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:29:20,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:29:20,740 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2019-11-20 03:29:20,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776143092] [2019-11-20 03:29:20,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:29:20,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:29:20,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96665537] [2019-11-20 03:29:20,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:29:20,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:29:20,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:29:20,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:29:20,743 INFO L87 Difference]: Start difference. First operand 16453 states and 18773 transitions. Second operand 4 states. [2019-11-20 03:29:22,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:29:22,220 INFO L93 Difference]: Finished difference Result 34390 states and 39143 transitions. [2019-11-20 03:29:22,233 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:29:22,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 326 [2019-11-20 03:29:22,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:29:22,265 INFO L225 Difference]: With dead ends: 34390 [2019-11-20 03:29:22,265 INFO L226 Difference]: Without dead ends: 18123 [2019-11-20 03:29:22,280 INFO L630 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-20 03:29:22,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18123 states. [2019-11-20 03:29:22,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18123 to 16636. [2019-11-20 03:29:22,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16636 states. [2019-11-20 03:29:22,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16636 states to 16636 states and 18630 transitions. [2019-11-20 03:29:22,525 INFO L78 Accepts]: Start accepts. Automaton has 16636 states and 18630 transitions. Word has length 326 [2019-11-20 03:29:22,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:29:22,526 INFO L462 AbstractCegarLoop]: Abstraction has 16636 states and 18630 transitions. [2019-11-20 03:29:22,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:29:22,526 INFO L276 IsEmpty]: Start isEmpty. Operand 16636 states and 18630 transitions. [2019-11-20 03:29:22,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-11-20 03:29:22,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:29:22,544 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:29:22,545 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:29:22,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:29:22,545 INFO L82 PathProgramCache]: Analyzing trace with hash -139580508, now seen corresponding path program 1 times [2019-11-20 03:29:22,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:29:22,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432237621] [2019-11-20 03:29:22,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:29:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:29:23,061 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 276 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 03:29:23,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432237621] [2019-11-20 03:29:23,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010361237] [2019-11-20 03:29:23,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20e317fa-dab2-4b0e-ba4c-38b5f1ba4861/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-20 03:29:23,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:29:23,200 INFO L255 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-20 03:29:23,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:29:23,355 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 279 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 03:29:23,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:29:23,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-11-20 03:29:23,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654440594] [2019-11-20 03:29:23,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:29:23,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:29:23,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:29:23,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 03:29:23,358 INFO L87 Difference]: Start difference. First operand 16636 states and 18630 transitions. Second operand 4 states. [2019-11-20 03:29:24,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:29:24,709 INFO L93 Difference]: Finished difference Result 33276 states and 37268 transitions. [2019-11-20 03:29:24,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:29:24,710 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 331 [2019-11-20 03:29:24,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:29:24,724 INFO L225 Difference]: With dead ends: 33276 [2019-11-20 03:29:24,725 INFO L226 Difference]: Without dead ends: 16642 [2019-11-20 03:29:24,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-20 03:29:24,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16642 states. [2019-11-20 03:29:24,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16642 to 15532. [2019-11-20 03:29:24,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15532 states. [2019-11-20 03:29:24,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15532 states to 15532 states and 17277 transitions. [2019-11-20 03:29:24,940 INFO L78 Accepts]: Start accepts. Automaton has 15532 states and 17277 transitions. Word has length 331 [2019-11-20 03:29:24,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:29:24,941 INFO L462 AbstractCegarLoop]: Abstraction has 15532 states and 17277 transitions. [2019-11-20 03:29:24,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:29:24,941 INFO L276 IsEmpty]: Start isEmpty. Operand 15532 states and 17277 transitions. [2019-11-20 03:29:24,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2019-11-20 03:29:24,953 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:29:24,954 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-20 03:29:25,158 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:29:25,166 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:29:25,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:29:25,166 INFO L82 PathProgramCache]: Analyzing trace with hash -2055586056, now seen corresponding path program 1 times [2019-11-20 03:29:25,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:29:25,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893187908] [2019-11-20 03:29:25,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:29:25,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:29:25,824 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 211 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:29:25,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893187908] [2019-11-20 03:29:25,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1697414058] [2019-11-20 03:29:25,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20e317fa-dab2-4b0e-ba4c-38b5f1ba4861/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-20 03:29:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:29:25,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-20 03:29:25,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:29:25,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:29:25,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:29:25,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:29:25,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:29:25,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:29:25,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:29:25,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:29:25,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:29:26,199 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 27 [2019-11-20 03:29:26,773 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 80 proven. 179 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-20 03:29:26,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:29:26,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 3] total 10 [2019-11-20 03:29:26,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122641238] [2019-11-20 03:29:26,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 03:29:26,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:29:26,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 03:29:26,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 03:29:26,783 INFO L87 Difference]: Start difference. First operand 15532 states and 17277 transitions. Second operand 10 states. [2019-11-20 03:29:35,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:29:35,571 INFO L93 Difference]: Finished difference Result 37356 states and 41761 transitions. [2019-11-20 03:29:35,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-20 03:29:35,571 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 338 [2019-11-20 03:29:35,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:29:35,592 INFO L225 Difference]: With dead ends: 37356 [2019-11-20 03:29:35,592 INFO L226 Difference]: Without dead ends: 24040 [2019-11-20 03:29:35,601 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2019-11-20 03:29:35,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24040 states. [2019-11-20 03:29:35,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24040 to 15716. [2019-11-20 03:29:35,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15716 states. [2019-11-20 03:29:35,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15716 states to 15716 states and 17470 transitions. [2019-11-20 03:29:35,826 INFO L78 Accepts]: Start accepts. Automaton has 15716 states and 17470 transitions. Word has length 338 [2019-11-20 03:29:35,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:29:35,827 INFO L462 AbstractCegarLoop]: Abstraction has 15716 states and 17470 transitions. [2019-11-20 03:29:35,827 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 03:29:35,827 INFO L276 IsEmpty]: Start isEmpty. Operand 15716 states and 17470 transitions. [2019-11-20 03:29:35,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2019-11-20 03:29:35,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:29:35,845 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:29:36,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:29:36,048 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:29:36,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:29:36,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1174714697, now seen corresponding path program 1 times [2019-11-20 03:29:36,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:29:36,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509260116] [2019-11-20 03:29:36,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:29:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:29:36,382 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 310 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-20 03:29:36,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509260116] [2019-11-20 03:29:36,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:29:36,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:29:36,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252840185] [2019-11-20 03:29:36,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 03:29:36,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:29:36,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 03:29:36,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:29:36,385 INFO L87 Difference]: Start difference. First operand 15716 states and 17470 transitions. Second operand 5 states. [2019-11-20 03:29:38,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:29:38,607 INFO L93 Difference]: Finished difference Result 35857 states and 39884 transitions. [2019-11-20 03:29:38,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 03:29:38,607 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 356 [2019-11-20 03:29:38,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:29:38,624 INFO L225 Difference]: With dead ends: 35857 [2019-11-20 03:29:38,624 INFO L226 Difference]: Without dead ends: 21247 [2019-11-20 03:29:38,634 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-20 03:29:38,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21247 states. [2019-11-20 03:29:38,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21247 to 18101. [2019-11-20 03:29:38,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18101 states. [2019-11-20 03:29:38,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18101 states to 18101 states and 19801 transitions. [2019-11-20 03:29:38,849 INFO L78 Accepts]: Start accepts. Automaton has 18101 states and 19801 transitions. Word has length 356 [2019-11-20 03:29:38,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:29:38,850 INFO L462 AbstractCegarLoop]: Abstraction has 18101 states and 19801 transitions. [2019-11-20 03:29:38,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 03:29:38,850 INFO L276 IsEmpty]: Start isEmpty. Operand 18101 states and 19801 transitions. [2019-11-20 03:29:38,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2019-11-20 03:29:38,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:29:38,865 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:29:38,865 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:29:38,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:29:38,866 INFO L82 PathProgramCache]: Analyzing trace with hash -174982330, now seen corresponding path program 1 times [2019-11-20 03:29:38,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:29:38,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21830232] [2019-11-20 03:29:38,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:29:38,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:29:39,129 INFO L134 CoverageAnalysis]: Checked inductivity of 417 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 337 trivial. 0 not checked. [2019-11-20 03:29:39,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21830232] [2019-11-20 03:29:39,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:29:39,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 03:29:39,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67611364] [2019-11-20 03:29:39,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:29:39,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:29:39,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:29:39,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:29:39,132 INFO L87 Difference]: Start difference. First operand 18101 states and 19801 transitions. Second operand 3 states. [2019-11-20 03:29:40,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:29:40,104 INFO L93 Difference]: Finished difference Result 21047 states and 22928 transitions. [2019-11-20 03:29:40,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:29:40,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 424 [2019-11-20 03:29:40,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:29:40,126 INFO L225 Difference]: With dead ends: 21047 [2019-11-20 03:29:40,126 INFO L226 Difference]: Without dead ends: 21045 [2019-11-20 03:29:40,132 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:29:40,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21045 states. [2019-11-20 03:29:40,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21045 to 18469. [2019-11-20 03:29:40,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18469 states. [2019-11-20 03:29:40,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18469 states to 18469 states and 20203 transitions. [2019-11-20 03:29:40,386 INFO L78 Accepts]: Start accepts. Automaton has 18469 states and 20203 transitions. Word has length 424 [2019-11-20 03:29:40,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:29:40,387 INFO L462 AbstractCegarLoop]: Abstraction has 18469 states and 20203 transitions. [2019-11-20 03:29:40,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:29:40,388 INFO L276 IsEmpty]: Start isEmpty. Operand 18469 states and 20203 transitions. [2019-11-20 03:29:40,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2019-11-20 03:29:40,406 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:29:40,407 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:29:40,407 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:29:40,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:29:40,408 INFO L82 PathProgramCache]: Analyzing trace with hash -1385650959, now seen corresponding path program 1 times [2019-11-20 03:29:40,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:29:40,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479700938] [2019-11-20 03:29:40,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:29:40,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:29:41,625 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 299 proven. 374 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 03:29:41,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479700938] [2019-11-20 03:29:41,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701112854] [2019-11-20 03:29:41,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20e317fa-dab2-4b0e-ba4c-38b5f1ba4861/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:29:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:29:41,768 INFO L255 TraceCheckSpWp]: Trace formula consists of 643 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 03:29:41,774 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:29:41,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:29:41,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:29:41,975 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 529 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-20 03:29:41,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-20 03:29:41,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 11 [2019-11-20 03:29:41,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315077806] [2019-11-20 03:29:41,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:29:41,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:29:41,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:29:41,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-20 03:29:41,978 INFO L87 Difference]: Start difference. First operand 18469 states and 20203 transitions. Second operand 4 states. [2019-11-20 03:29:43,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:29:43,633 INFO L93 Difference]: Finished difference Result 42469 states and 46508 transitions. [2019-11-20 03:29:43,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:29:43,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 489 [2019-11-20 03:29:43,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:29:43,653 INFO L225 Difference]: With dead ends: 42469 [2019-11-20 03:29:43,653 INFO L226 Difference]: Without dead ends: 24370 [2019-11-20 03:29:43,662 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 488 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-11-20 03:29:43,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24370 states. [2019-11-20 03:29:43,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24370 to 21600. [2019-11-20 03:29:43,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21600 states. [2019-11-20 03:29:43,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21600 states to 21600 states and 23450 transitions. [2019-11-20 03:29:43,894 INFO L78 Accepts]: Start accepts. Automaton has 21600 states and 23450 transitions. Word has length 489 [2019-11-20 03:29:43,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:29:43,894 INFO L462 AbstractCegarLoop]: Abstraction has 21600 states and 23450 transitions. [2019-11-20 03:29:43,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:29:43,894 INFO L276 IsEmpty]: Start isEmpty. Operand 21600 states and 23450 transitions. [2019-11-20 03:29:43,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2019-11-20 03:29:43,915 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:29:43,916 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:29:44,116 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:29:44,116 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:29:44,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:29:44,117 INFO L82 PathProgramCache]: Analyzing trace with hash 439563746, now seen corresponding path program 1 times [2019-11-20 03:29:44,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:29:44,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728478973] [2019-11-20 03:29:44,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:29:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:29:44,540 INFO L134 CoverageAnalysis]: Checked inductivity of 797 backedges. 646 proven. 0 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2019-11-20 03:29:44,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728478973] [2019-11-20 03:29:44,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:29:44,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:29:44,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60570892] [2019-11-20 03:29:44,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:29:44,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:29:44,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:29:44,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:29:44,543 INFO L87 Difference]: Start difference. First operand 21600 states and 23450 transitions. Second operand 4 states. [2019-11-20 03:29:45,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:29:45,851 INFO L93 Difference]: Finished difference Result 42293 states and 45938 transitions. [2019-11-20 03:29:45,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:29:45,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 541 [2019-11-20 03:29:45,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:29:45,876 INFO L225 Difference]: With dead ends: 42293 [2019-11-20 03:29:45,876 INFO L226 Difference]: Without dead ends: 22907 [2019-11-20 03:29:45,886 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:29:45,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22907 states. [2019-11-20 03:29:46,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22907 to 21600. [2019-11-20 03:29:46,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21600 states. [2019-11-20 03:29:46,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21600 states to 21600 states and 23340 transitions. [2019-11-20 03:29:46,121 INFO L78 Accepts]: Start accepts. Automaton has 21600 states and 23340 transitions. Word has length 541 [2019-11-20 03:29:46,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:29:46,122 INFO L462 AbstractCegarLoop]: Abstraction has 21600 states and 23340 transitions. [2019-11-20 03:29:46,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:29:46,122 INFO L276 IsEmpty]: Start isEmpty. Operand 21600 states and 23340 transitions. [2019-11-20 03:29:46,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2019-11-20 03:29:46,135 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:29:46,136 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:29:46,136 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:29:46,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:29:46,136 INFO L82 PathProgramCache]: Analyzing trace with hash 881604247, now seen corresponding path program 1 times [2019-11-20 03:29:46,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:29:46,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157314946] [2019-11-20 03:29:46,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:29:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:29:46,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 630 proven. 144 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-11-20 03:29:46,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157314946] [2019-11-20 03:29:46,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476380054] [2019-11-20 03:29:46,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_20e317fa-dab2-4b0e-ba4c-38b5f1ba4861/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:29:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:29:47,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 03:29:47,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 03:29:47,153 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:29:47,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:29:47,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:29:47,263 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:29:47,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 03:29:48,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 720 proven. 54 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2019-11-20 03:29:48,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-20 03:29:48,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2019-11-20 03:29:48,123 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484106296] [2019-11-20 03:29:48,124 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 03:29:48,124 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:29:48,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 03:29:48,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-20 03:29:48,126 INFO L87 Difference]: Start difference. First operand 21600 states and 23340 transitions. Second operand 11 states. [2019-11-20 03:29:59,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:29:59,712 INFO L93 Difference]: Finished difference Result 51142 states and 55190 transitions. [2019-11-20 03:29:59,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-20 03:29:59,712 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 566 [2019-11-20 03:29:59,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:29:59,736 INFO L225 Difference]: With dead ends: 51142 [2019-11-20 03:29:59,736 INFO L226 Difference]: Without dead ends: 29912 [2019-11-20 03:29:59,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 576 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2019-11-20 03:29:59,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29912 states. [2019-11-20 03:30:00,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29912 to 22888. [2019-11-20 03:30:00,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22888 states. [2019-11-20 03:30:00,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22888 states to 22888 states and 24485 transitions. [2019-11-20 03:30:00,025 INFO L78 Accepts]: Start accepts. Automaton has 22888 states and 24485 transitions. Word has length 566 [2019-11-20 03:30:00,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:30:00,025 INFO L462 AbstractCegarLoop]: Abstraction has 22888 states and 24485 transitions. [2019-11-20 03:30:00,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 03:30:00,026 INFO L276 IsEmpty]: Start isEmpty. Operand 22888 states and 24485 transitions. [2019-11-20 03:30:00,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 749 [2019-11-20 03:30:00,041 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:30:00,042 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 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] [2019-11-20 03:30:00,245 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-20 03:30:00,248 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:30:00,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:30:00,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1107746161, now seen corresponding path program 1 times [2019-11-20 03:30:00,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:30:00,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367639994] [2019-11-20 03:30:00,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:30:00,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:30:01,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1655 backedges. 603 proven. 0 refuted. 0 times theorem prover too weak. 1052 trivial. 0 not checked. [2019-11-20 03:30:01,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367639994] [2019-11-20 03:30:01,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:30:01,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 03:30:01,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573125945] [2019-11-20 03:30:01,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 03:30:01,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:30:01,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 03:30:01,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 03:30:01,115 INFO L87 Difference]: Start difference. First operand 22888 states and 24485 transitions. Second operand 4 states. [2019-11-20 03:30:02,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:30:02,307 INFO L93 Difference]: Finished difference Result 42463 states and 45394 transitions. [2019-11-20 03:30:02,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 03:30:02,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 748 [2019-11-20 03:30:02,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:30:02,323 INFO L225 Difference]: With dead ends: 42463 [2019-11-20 03:30:02,323 INFO L226 Difference]: Without dead ends: 19945 [2019-11-20 03:30:02,332 INFO L630 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-20 03:30:02,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19945 states. [2019-11-20 03:30:02,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19945 to 13304. [2019-11-20 03:30:02,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13304 states. [2019-11-20 03:30:02,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13304 states to 13304 states and 14191 transitions. [2019-11-20 03:30:02,503 INFO L78 Accepts]: Start accepts. Automaton has 13304 states and 14191 transitions. Word has length 748 [2019-11-20 03:30:02,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:30:02,504 INFO L462 AbstractCegarLoop]: Abstraction has 13304 states and 14191 transitions. [2019-11-20 03:30:02,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 03:30:02,504 INFO L276 IsEmpty]: Start isEmpty. Operand 13304 states and 14191 transitions. [2019-11-20 03:30:02,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1016 [2019-11-20 03:30:02,518 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 03:30:02,518 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 03:30:02,519 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 03:30:02,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 03:30:02,519 INFO L82 PathProgramCache]: Analyzing trace with hash 904594841, now seen corresponding path program 1 times [2019-11-20 03:30:02,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 03:30:02,520 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493592550] [2019-11-20 03:30:02,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 03:30:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 03:30:03,964 INFO L134 CoverageAnalysis]: Checked inductivity of 3180 backedges. 215 proven. 0 refuted. 0 times theorem prover too weak. 2965 trivial. 0 not checked. [2019-11-20 03:30:03,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493592550] [2019-11-20 03:30:03,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 03:30:03,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 03:30:03,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513120014] [2019-11-20 03:30:03,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 03:30:03,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 03:30:03,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 03:30:03,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:30:03,966 INFO L87 Difference]: Start difference. First operand 13304 states and 14191 transitions. Second operand 3 states. [2019-11-20 03:30:04,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 03:30:04,410 INFO L93 Difference]: Finished difference Result 25125 states and 26814 transitions. [2019-11-20 03:30:04,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 03:30:04,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 1015 [2019-11-20 03:30:04,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 03:30:04,415 INFO L225 Difference]: With dead ends: 25125 [2019-11-20 03:30:04,415 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 03:30:04,425 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 03:30:04,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 03:30:04,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 03:30:04,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 03:30:04,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 03:30:04,426 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1015 [2019-11-20 03:30:04,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 03:30:04,427 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 03:30:04,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 03:30:04,427 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 03:30:04,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 03:30:04,434 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 03:30:05,557 WARN L191 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 679 DAG size of output: 483 [2019-11-20 03:30:06,501 WARN L191 SmtUtils]: Spent 941.00 ms on a formula simplification. DAG size of input: 679 DAG size of output: 483 [2019-11-20 03:30:10,491 WARN L191 SmtUtils]: Spent 3.98 s on a formula simplification. DAG size of input: 449 DAG size of output: 145 [2019-11-20 03:30:13,590 WARN L191 SmtUtils]: Spent 3.10 s on a formula simplification. DAG size of input: 449 DAG size of output: 145 [2019-11-20 03:30:13,593 INFO L444 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-20 03:30:13,593 INFO L444 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-20 03:30:13,593 INFO L444 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-11-20 03:30:13,593 INFO L447 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2019-11-20 03:30:13,593 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,593 INFO L444 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,593 INFO L444 ceAbstractionStarter]: For program point L170-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,593 INFO L444 ceAbstractionStarter]: For program point L104-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,593 INFO L444 ceAbstractionStarter]: For program point L38-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,593 INFO L444 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,594 INFO L444 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,594 INFO L444 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-20 03:30:13,594 INFO L444 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-20 03:30:13,594 INFO L444 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-11-20 03:30:13,594 INFO L444 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,594 INFO L444 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,594 INFO L444 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,594 INFO L444 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,594 INFO L444 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,594 INFO L444 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,594 INFO L444 ceAbstractionStarter]: For program point L107-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,594 INFO L444 ceAbstractionStarter]: For program point L41-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,594 INFO L444 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,594 INFO L444 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-11-20 03:30:13,594 INFO L444 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-20 03:30:13,595 INFO L444 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2019-11-20 03:30:13,595 INFO L444 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,595 INFO L440 ceAbstractionStarter]: At program point L1034-2(lines 1034 1043) the Hoare annotation is: (let ((.cse25 (+ ~a23~0 43)) (.cse21 (< 277 ~a29~0)) (.cse18 (= 10 ~a25~0)) (.cse6 (<= ~a25~0 12)) (.cse17 (<= ~a29~0 130)) (.cse13 (= ~a25~0 11))) (let ((.cse10 (<= (+ ~a29~0 (* 5 ~a23~0)) 101230)) (.cse8 (exists ((v_~a23~0_474 Int)) (let ((.cse27 (div v_~a23~0_474 5))) (and (= (mod v_~a23~0_474 5) 0) (<= ~a23~0 (+ (mod (* .cse27 4) 83) 180)) (<= 312 v_~a23~0_474) (<= 0 (* 4 .cse27)))))) (.cse5 (not .cse13)) (.cse0 (and .cse6 .cse17)) (.cse23 (<= 260 ~a29~0)) (.cse14 (< 138 ~a23~0)) (.cse24 (<= ~a29~0 275)) (.cse19 (<= 141 ~a29~0)) (.cse1 (<= ~a25~0 9)) (.cse11 (and .cse21 (not .cse18))) (.cse12 (<= ~a23~0 312)) (.cse16 (= ~a4~0 1)) (.cse3 (= ~a25~0 9)) (.cse22 (<= ~a29~0 245)) (.cse20 (= 12 ~a25~0)) (.cse15 (<= (+ ~a29~0 193245) 0)) (.cse4 (= 15 ~a8~0)) (.cse9 (= ~a25~0 13)) (.cse2 (= 1 ~a4~0)) (.cse26 (<= 130 ~a29~0)) (.cse7 (<= .cse25 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and (and .cse5 .cse6 .cse2) .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse2) (and .cse12 .cse4 .cse2 .cse13 .cse14) (and .cse5 (<= (+ (* 5 ~a29~0) ~a23~0) 1687) .cse15 .cse6 .cse4 .cse16) (and .cse9 .cse12 .cse4 (or .cse10 (<= ~a23~0 306))) (and .cse8 .cse9 .cse17 .cse2) (and .cse18 .cse4 .cse2 .cse14) (and (or (and .cse2 .cse13 .cse14 .cse19) (and .cse20 (< 140 ~a29~0) (<= ~a29~0 277) .cse2 .cse14)) .cse4) (and .cse3 (and .cse21 .cse7) .cse4) (and .cse12 .cse18 .cse4 .cse22) (and .cse17 .cse18 .cse4) (and .cse4 (and (and .cse12 .cse1 .cse2) .cse23)) (and (and .cse5 .cse12 .cse0 .cse2) .cse4) (and .cse18 .cse4 .cse7) (and (and (and .cse1 .cse24 .cse2) .cse23) .cse4) (and .cse12 .cse3 (< 0 .cse25) .cse4 .cse22) (and .cse12 .cse20 .cse4 .cse14) (and (and .cse9 (exists ((v_~a29~0_505 Int)) (and (<= v_~a29~0_505 140) (<= ~a29~0 (+ (div v_~a29~0_505 5) 206649)) (<= 0 v_~a29~0_505))) .cse2) .cse4) (and .cse4 (and (and (or .cse20 (and .cse2 .cse13)) .cse24) .cse19)) (and (or (and (or (and .cse18 .cse21) (and .cse11 .cse13)) .cse2) (and .cse1 .cse11 .cse2)) .cse4) (and .cse12 (and .cse20 (not .cse16)) .cse4) (and .cse3 .cse15 .cse7 .cse4) (and .cse4 .cse13 .cse7) (and .cse22 .cse2 .cse26 .cse7) (and .cse20 (<= ~a4~0 0) .cse15 .cse4) (and (not .cse9) .cse2 .cse26 .cse7)))) [2019-11-20 03:30:13,595 INFO L444 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,595 INFO L444 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,595 INFO L444 ceAbstractionStarter]: For program point L176-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,595 INFO L444 ceAbstractionStarter]: For program point L110-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,595 INFO L444 ceAbstractionStarter]: For program point L44-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,595 INFO L444 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,596 INFO L444 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,596 INFO L444 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,596 INFO L444 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2019-11-20 03:30:13,596 INFO L444 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2019-11-20 03:30:13,596 INFO L444 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2019-11-20 03:30:13,596 INFO L444 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2019-11-20 03:30:13,596 INFO L444 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2019-11-20 03:30:13,596 INFO L444 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2019-11-20 03:30:13,596 INFO L444 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2019-11-20 03:30:13,596 INFO L444 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,596 INFO L444 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,596 INFO L444 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,597 INFO L444 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,597 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,597 INFO L444 ceAbstractionStarter]: For program point L179-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,597 INFO L444 ceAbstractionStarter]: For program point L113-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,597 INFO L444 ceAbstractionStarter]: For program point L47-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,597 INFO L444 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,597 INFO L444 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,597 INFO L444 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2019-11-20 03:30:13,597 INFO L444 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-11-20 03:30:13,597 INFO L444 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2019-11-20 03:30:13,598 INFO L444 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2019-11-20 03:30:13,598 INFO L444 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,598 INFO L444 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,598 INFO L444 ceAbstractionStarter]: For program point L182-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,598 INFO L444 ceAbstractionStarter]: For program point L116-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,598 INFO L444 ceAbstractionStarter]: For program point L50-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,598 INFO L444 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2019-11-20 03:30:13,598 INFO L444 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2019-11-20 03:30:13,598 INFO L444 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-20 03:30:13,598 INFO L444 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,598 INFO L444 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,598 INFO L444 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,598 INFO L444 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,598 INFO L444 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2019-11-20 03:30:13,598 INFO L444 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2019-11-20 03:30:13,599 INFO L444 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,599 INFO L444 ceAbstractionStarter]: For program point L185-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,599 INFO L444 ceAbstractionStarter]: For program point L119-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,599 INFO L444 ceAbstractionStarter]: For program point L53-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,599 INFO L444 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,599 INFO L444 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,599 INFO L444 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2019-11-20 03:30:13,599 INFO L444 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2019-11-20 03:30:13,599 INFO L444 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,599 INFO L444 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,599 INFO L444 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-20 03:30:13,599 INFO L444 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-11-20 03:30:13,599 INFO L444 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2019-11-20 03:30:13,599 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,599 INFO L444 ceAbstractionStarter]: For program point L188-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,599 INFO L444 ceAbstractionStarter]: For program point L122-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,600 INFO L444 ceAbstractionStarter]: For program point L56-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,600 INFO L444 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,600 INFO L444 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,600 INFO L444 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,600 INFO L444 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-11-20 03:30:13,600 INFO L444 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-20 03:30:13,600 INFO L444 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-20 03:30:13,600 INFO L444 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2019-11-20 03:30:13,600 INFO L444 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2019-11-20 03:30:13,600 INFO L444 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2019-11-20 03:30:13,600 INFO L444 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2019-11-20 03:30:13,601 INFO L444 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,601 INFO L444 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,601 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 03:30:13,601 INFO L444 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2019-11-20 03:30:13,601 INFO L444 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2019-11-20 03:30:13,601 INFO L444 ceAbstractionStarter]: For program point L191-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,601 INFO L444 ceAbstractionStarter]: For program point L125-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,601 INFO L444 ceAbstractionStarter]: For program point L59-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,601 INFO L444 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,601 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,602 INFO L444 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2019-11-20 03:30:13,602 INFO L444 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2019-11-20 03:30:13,602 INFO L444 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2019-11-20 03:30:13,602 INFO L444 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,602 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,602 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,602 INFO L444 ceAbstractionStarter]: For program point L194-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,602 INFO L444 ceAbstractionStarter]: For program point L128-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,602 INFO L444 ceAbstractionStarter]: For program point L62-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,602 INFO L444 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2019-11-20 03:30:13,602 INFO L444 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-11-20 03:30:13,602 INFO L444 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2019-11-20 03:30:13,602 INFO L444 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,603 INFO L444 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,603 INFO L444 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,603 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,603 INFO L444 ceAbstractionStarter]: For program point L197-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,603 INFO L444 ceAbstractionStarter]: For program point L131-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,603 INFO L444 ceAbstractionStarter]: For program point L65-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,603 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 03:30:13,603 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 93) no Hoare annotation was computed. [2019-11-20 03:30:13,603 INFO L444 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,603 INFO L444 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2019-11-20 03:30:13,603 INFO L444 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2019-11-20 03:30:13,603 INFO L444 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2019-11-20 03:30:13,603 INFO L444 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,603 INFO L444 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,604 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,604 INFO L444 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,604 INFO L444 ceAbstractionStarter]: For program point L200-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,604 INFO L444 ceAbstractionStarter]: For program point L134-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,604 INFO L444 ceAbstractionStarter]: For program point L68-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,604 INFO L444 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,604 INFO L444 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,604 INFO L444 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,604 INFO L444 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,604 INFO L444 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2019-11-20 03:30:13,604 INFO L444 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2019-11-20 03:30:13,604 INFO L444 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2019-11-20 03:30:13,604 INFO L444 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-11-20 03:30:13,604 INFO L444 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-20 03:30:13,604 INFO L444 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,604 INFO L444 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,605 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,605 INFO L444 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,605 INFO L444 ceAbstractionStarter]: For program point L203-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,605 INFO L444 ceAbstractionStarter]: For program point L137-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,605 INFO L444 ceAbstractionStarter]: For program point L71-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,605 INFO L444 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-11-20 03:30:13,605 INFO L444 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-20 03:30:13,605 INFO L444 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2019-11-20 03:30:13,605 INFO L444 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,605 INFO L444 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,605 INFO L444 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,605 INFO L444 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2019-11-20 03:30:13,605 INFO L444 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2019-11-20 03:30:13,605 INFO L444 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,605 INFO L444 ceAbstractionStarter]: For program point L140-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,605 INFO L444 ceAbstractionStarter]: For program point L74-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,606 INFO L444 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,606 INFO L444 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,606 INFO L444 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-20 03:30:13,606 INFO L444 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-20 03:30:13,606 INFO L444 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,606 INFO L444 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,606 INFO L444 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2019-11-20 03:30:13,606 INFO L444 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2019-11-20 03:30:13,606 INFO L444 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,606 INFO L444 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,606 INFO L444 ceAbstractionStarter]: For program point L143-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,607 INFO L444 ceAbstractionStarter]: For program point L77-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,607 INFO L444 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,607 INFO L444 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,607 INFO L444 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-11-20 03:30:13,607 INFO L444 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2019-11-20 03:30:13,607 INFO L444 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2019-11-20 03:30:13,607 INFO L444 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2019-11-20 03:30:13,608 INFO L444 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,608 INFO L444 ceAbstractionStarter]: For program point L146-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,608 INFO L444 ceAbstractionStarter]: For program point L80-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,608 INFO L444 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,608 INFO L444 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,608 INFO L444 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,608 INFO L444 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,609 INFO L444 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,609 INFO L444 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2019-11-20 03:30:13,609 INFO L444 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-20 03:30:13,609 INFO L444 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2019-11-20 03:30:13,609 INFO L444 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2019-11-20 03:30:13,609 INFO L444 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2019-11-20 03:30:13,609 INFO L444 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2019-11-20 03:30:13,610 INFO L444 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,610 INFO L444 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,610 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,610 INFO L444 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,610 INFO L444 ceAbstractionStarter]: For program point L149-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,610 INFO L444 ceAbstractionStarter]: For program point L83-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,610 INFO L444 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,611 INFO L444 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-20 03:30:13,611 INFO L444 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-20 03:30:13,611 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 03:30:13,611 INFO L444 ceAbstractionStarter]: For program point L152-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,611 INFO L444 ceAbstractionStarter]: For program point L86-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,611 INFO L444 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,611 INFO L444 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,612 INFO L444 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,612 INFO L444 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,612 INFO L444 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-20 03:30:13,612 INFO L444 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-20 03:30:13,612 INFO L444 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,612 INFO L444 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,612 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,613 INFO L444 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,613 INFO L444 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,613 INFO L444 ceAbstractionStarter]: For program point L155-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,613 INFO L444 ceAbstractionStarter]: For program point L89-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,613 INFO L444 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2019-11-20 03:30:13,613 INFO L444 ceAbstractionStarter]: For program point L23-2(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,613 INFO L444 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,614 INFO L444 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,614 INFO L444 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-20 03:30:13,614 INFO L444 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2019-11-20 03:30:13,614 INFO L444 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2019-11-20 03:30:13,614 INFO L444 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,614 INFO L444 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2019-11-20 03:30:13,614 INFO L444 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,615 INFO L444 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2019-11-20 03:30:13,615 INFO L444 ceAbstractionStarter]: For program point L158-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,615 INFO L444 ceAbstractionStarter]: For program point L92-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,615 INFO L444 ceAbstractionStarter]: For program point L26-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,615 INFO L444 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,615 INFO L444 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,615 INFO L444 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,616 INFO L444 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-11-20 03:30:13,616 INFO L444 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2019-11-20 03:30:13,616 INFO L444 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2019-11-20 03:30:13,616 INFO L444 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,616 INFO L444 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,616 INFO L444 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,616 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 03:30:13,617 INFO L444 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,617 INFO L444 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,617 INFO L444 ceAbstractionStarter]: For program point L161-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,617 INFO L444 ceAbstractionStarter]: For program point L95-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,617 INFO L444 ceAbstractionStarter]: For program point L29-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,617 INFO L444 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,617 INFO L444 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,618 INFO L444 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-11-20 03:30:13,618 INFO L444 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2019-11-20 03:30:13,618 INFO L444 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2019-11-20 03:30:13,618 INFO L444 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,618 INFO L444 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2019-11-20 03:30:13,618 INFO L444 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2019-11-20 03:30:13,618 INFO L444 ceAbstractionStarter]: For program point L164-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,619 INFO L444 ceAbstractionStarter]: For program point L98-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,619 INFO L444 ceAbstractionStarter]: For program point L32-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,619 INFO L444 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,619 INFO L444 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,619 INFO L444 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,619 INFO L444 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2019-11-20 03:30:13,619 INFO L444 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2019-11-20 03:30:13,620 INFO L444 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2019-11-20 03:30:13,620 INFO L444 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,620 INFO L444 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,620 INFO L444 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,621 INFO L440 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse25 (+ ~a23~0 43)) (.cse21 (< 277 ~a29~0)) (.cse18 (= 10 ~a25~0)) (.cse6 (<= ~a25~0 12)) (.cse17 (<= ~a29~0 130)) (.cse13 (= ~a25~0 11))) (let ((.cse10 (<= (+ ~a29~0 (* 5 ~a23~0)) 101230)) (.cse8 (exists ((v_~a23~0_474 Int)) (let ((.cse27 (div v_~a23~0_474 5))) (and (= (mod v_~a23~0_474 5) 0) (<= ~a23~0 (+ (mod (* .cse27 4) 83) 180)) (<= 312 v_~a23~0_474) (<= 0 (* 4 .cse27)))))) (.cse5 (not .cse13)) (.cse0 (and .cse6 .cse17)) (.cse23 (<= 260 ~a29~0)) (.cse14 (< 138 ~a23~0)) (.cse24 (<= ~a29~0 275)) (.cse19 (<= 141 ~a29~0)) (.cse1 (<= ~a25~0 9)) (.cse11 (and .cse21 (not .cse18))) (.cse12 (<= ~a23~0 312)) (.cse16 (= ~a4~0 1)) (.cse3 (= ~a25~0 9)) (.cse22 (<= ~a29~0 245)) (.cse20 (= 12 ~a25~0)) (.cse15 (<= (+ ~a29~0 193245) 0)) (.cse4 (= 15 ~a8~0)) (.cse9 (= ~a25~0 13)) (.cse2 (= 1 ~a4~0)) (.cse26 (<= 130 ~a29~0)) (.cse7 (<= .cse25 0))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse2) (and (and .cse5 .cse6 .cse2) .cse7) (and .cse8 .cse9 .cse10 .cse11 .cse2) (and .cse12 .cse4 .cse2 .cse13 .cse14) (and .cse5 (<= (+ (* 5 ~a29~0) ~a23~0) 1687) .cse15 .cse6 .cse4 .cse16) (and .cse9 .cse12 .cse4 (or .cse10 (<= ~a23~0 306))) (and .cse8 .cse9 .cse17 .cse2) (and .cse18 .cse4 .cse2 .cse14) (and (or (and .cse2 .cse13 .cse14 .cse19) (and .cse20 (< 140 ~a29~0) (<= ~a29~0 277) .cse2 .cse14)) .cse4) (and .cse3 (and .cse21 .cse7) .cse4) (and .cse12 .cse18 .cse4 .cse22) (and .cse17 .cse18 .cse4) (and .cse4 (and (and .cse12 .cse1 .cse2) .cse23)) (and (and .cse5 .cse12 .cse0 .cse2) .cse4) (and .cse18 .cse4 .cse7) (and (and (and .cse1 .cse24 .cse2) .cse23) .cse4) (and .cse12 .cse3 (< 0 .cse25) .cse4 .cse22) (and .cse12 .cse20 .cse4 .cse14) (and (and .cse9 (exists ((v_~a29~0_505 Int)) (and (<= v_~a29~0_505 140) (<= ~a29~0 (+ (div v_~a29~0_505 5) 206649)) (<= 0 v_~a29~0_505))) .cse2) .cse4) (and .cse4 (and (and (or .cse20 (and .cse2 .cse13)) .cse24) .cse19)) (and (or (and (or (and .cse18 .cse21) (and .cse11 .cse13)) .cse2) (and .cse1 .cse11 .cse2)) .cse4) (and .cse12 (and .cse20 (not .cse16)) .cse4) (and .cse3 .cse15 .cse7 .cse4) (and .cse4 .cse13 .cse7) (and .cse22 .cse2 .cse26 .cse7) (and .cse20 (<= ~a4~0 0) .cse15 .cse4) (and (not .cse9) .cse2 .cse26 .cse7)))) [2019-11-20 03:30:13,621 INFO L444 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,621 INFO L444 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2019-11-20 03:30:13,621 INFO L444 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2019-11-20 03:30:13,621 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,621 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,621 INFO L444 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2019-11-20 03:30:13,621 INFO L444 ceAbstractionStarter]: For program point L167-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,621 INFO L444 ceAbstractionStarter]: For program point L101-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,621 INFO L444 ceAbstractionStarter]: For program point L35-1(lines 22 1026) no Hoare annotation was computed. [2019-11-20 03:30:13,631 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,632 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,633 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,634 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,635 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,635 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 03:30:13,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 03:30:13,636 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 03:30:13,648 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,649 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,650 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,651 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 03:30:13,652 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 03:30:13,653 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 03:30:13,660 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,661 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,662 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,663 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 03:30:13,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 03:30:13,664 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 03:30:13,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,668 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,669 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,669 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,669 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,670 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,671 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,671 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 03:30:13,672 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 03:30:13,672 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 03:30:13,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:30:13 BoogieIcfgContainer [2019-11-20 03:30:13,677 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 03:30:13,677 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 03:30:13,677 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 03:30:13,678 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 03:30:13,678 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:28:47" (3/4) ... [2019-11-20 03:30:13,682 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 03:30:13,709 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-20 03:30:13,711 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-20 03:30:13,742 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((a25 <= 12 && a29 <= 130) && a25 <= 9) && 1 == a4) || ((a25 == 9 && 15 == a8) && 1 == a4)) || (((!(a25 == 11) && a25 <= 12) && 1 == a4) && a23 + 43 <= 0)) || (((((\exists v_~a23~0_474 : int :: ((v_~a23~0_474 % 5 == 0 && a23 <= v_~a23~0_474 / 5 * 4 % 83 + 180) && 312 <= v_~a23~0_474) && 0 <= 4 * (v_~a23~0_474 / 5)) && a25 == 13) && a29 + 5 * a23 <= 101230) && 277 < a29 && !(10 == a25)) && 1 == a4)) || ((((a23 <= 312 && 15 == a8) && 1 == a4) && a25 == 11) && 138 < a23)) || (((((!(a25 == 11) && 5 * a29 + a23 <= 1687) && a29 + 193245 <= 0) && a25 <= 12) && 15 == a8) && a4 == 1)) || (((a25 == 13 && a23 <= 312) && 15 == a8) && (a29 + 5 * a23 <= 101230 || a23 <= 306))) || ((((\exists v_~a23~0_474 : int :: ((v_~a23~0_474 % 5 == 0 && a23 <= v_~a23~0_474 / 5 * 4 % 83 + 180) && 312 <= v_~a23~0_474) && 0 <= 4 * (v_~a23~0_474 / 5)) && a25 == 13) && a29 <= 130) && 1 == a4)) || (((10 == a25 && 15 == a8) && 1 == a4) && 138 < a23)) || (((((1 == a4 && a25 == 11) && 138 < a23) && 141 <= a29) || ((((12 == a25 && 140 < a29) && a29 <= 277) && 1 == a4) && 138 < a23)) && 15 == a8)) || ((a25 == 9 && 277 < a29 && a23 + 43 <= 0) && 15 == a8)) || (((a23 <= 312 && 10 == a25) && 15 == a8) && a29 <= 245)) || ((a29 <= 130 && 10 == a25) && 15 == a8)) || (15 == a8 && ((a23 <= 312 && a25 <= 9) && 1 == a4) && 260 <= a29)) || ((((!(a25 == 11) && a23 <= 312) && a25 <= 12 && a29 <= 130) && 1 == a4) && 15 == a8)) || ((10 == a25 && 15 == a8) && a23 + 43 <= 0)) || ((((a25 <= 9 && a29 <= 275) && 1 == a4) && 260 <= a29) && 15 == a8)) || ((((a23 <= 312 && a25 == 9) && 0 < a23 + 43) && 15 == a8) && a29 <= 245)) || (((a23 <= 312 && 12 == a25) && 15 == a8) && 138 < a23)) || (((a25 == 13 && (\exists v_~a29~0_505 : int :: (v_~a29~0_505 <= 140 && a29 <= v_~a29~0_505 / 5 + 206649) && 0 <= v_~a29~0_505)) && 1 == a4) && 15 == a8)) || (15 == a8 && ((12 == a25 || (1 == a4 && a25 == 11)) && a29 <= 275) && 141 <= a29)) || (((((10 == a25 && 277 < a29) || ((277 < a29 && !(10 == a25)) && a25 == 11)) && 1 == a4) || ((a25 <= 9 && 277 < a29 && !(10 == a25)) && 1 == a4)) && 15 == a8)) || ((a23 <= 312 && 12 == a25 && !(a4 == 1)) && 15 == a8)) || (((a25 == 9 && a29 + 193245 <= 0) && a23 + 43 <= 0) && 15 == a8)) || ((15 == a8 && a25 == 11) && a23 + 43 <= 0)) || (((a29 <= 245 && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || (((12 == a25 && a4 <= 0) && a29 + 193245 <= 0) && 15 == a8)) || (((!(a25 == 13) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0) [2019-11-20 03:30:13,746 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((a25 <= 12 && a29 <= 130) && a25 <= 9) && 1 == a4) || ((a25 == 9 && 15 == a8) && 1 == a4)) || (((!(a25 == 11) && a25 <= 12) && 1 == a4) && a23 + 43 <= 0)) || (((((\exists v_~a23~0_474 : int :: ((v_~a23~0_474 % 5 == 0 && a23 <= v_~a23~0_474 / 5 * 4 % 83 + 180) && 312 <= v_~a23~0_474) && 0 <= 4 * (v_~a23~0_474 / 5)) && a25 == 13) && a29 + 5 * a23 <= 101230) && 277 < a29 && !(10 == a25)) && 1 == a4)) || ((((a23 <= 312 && 15 == a8) && 1 == a4) && a25 == 11) && 138 < a23)) || (((((!(a25 == 11) && 5 * a29 + a23 <= 1687) && a29 + 193245 <= 0) && a25 <= 12) && 15 == a8) && a4 == 1)) || (((a25 == 13 && a23 <= 312) && 15 == a8) && (a29 + 5 * a23 <= 101230 || a23 <= 306))) || ((((\exists v_~a23~0_474 : int :: ((v_~a23~0_474 % 5 == 0 && a23 <= v_~a23~0_474 / 5 * 4 % 83 + 180) && 312 <= v_~a23~0_474) && 0 <= 4 * (v_~a23~0_474 / 5)) && a25 == 13) && a29 <= 130) && 1 == a4)) || (((10 == a25 && 15 == a8) && 1 == a4) && 138 < a23)) || (((((1 == a4 && a25 == 11) && 138 < a23) && 141 <= a29) || ((((12 == a25 && 140 < a29) && a29 <= 277) && 1 == a4) && 138 < a23)) && 15 == a8)) || ((a25 == 9 && 277 < a29 && a23 + 43 <= 0) && 15 == a8)) || (((a23 <= 312 && 10 == a25) && 15 == a8) && a29 <= 245)) || ((a29 <= 130 && 10 == a25) && 15 == a8)) || (15 == a8 && ((a23 <= 312 && a25 <= 9) && 1 == a4) && 260 <= a29)) || ((((!(a25 == 11) && a23 <= 312) && a25 <= 12 && a29 <= 130) && 1 == a4) && 15 == a8)) || ((10 == a25 && 15 == a8) && a23 + 43 <= 0)) || ((((a25 <= 9 && a29 <= 275) && 1 == a4) && 260 <= a29) && 15 == a8)) || ((((a23 <= 312 && a25 == 9) && 0 < a23 + 43) && 15 == a8) && a29 <= 245)) || (((a23 <= 312 && 12 == a25) && 15 == a8) && 138 < a23)) || (((a25 == 13 && (\exists v_~a29~0_505 : int :: (v_~a29~0_505 <= 140 && a29 <= v_~a29~0_505 / 5 + 206649) && 0 <= v_~a29~0_505)) && 1 == a4) && 15 == a8)) || (15 == a8 && ((12 == a25 || (1 == a4 && a25 == 11)) && a29 <= 275) && 141 <= a29)) || (((((10 == a25 && 277 < a29) || ((277 < a29 && !(10 == a25)) && a25 == 11)) && 1 == a4) || ((a25 <= 9 && 277 < a29 && !(10 == a25)) && 1 == a4)) && 15 == a8)) || ((a23 <= 312 && 12 == a25 && !(a4 == 1)) && 15 == a8)) || (((a25 == 9 && a29 + 193245 <= 0) && a23 + 43 <= 0) && 15 == a8)) || ((15 == a8 && a25 == 11) && a23 + 43 <= 0)) || (((a29 <= 245 && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || (((12 == a25 && a4 <= 0) && a29 + 193245 <= 0) && 15 == a8)) || (((!(a25 == 13) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0) [2019-11-20 03:30:13,903 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_20e317fa-dab2-4b0e-ba4c-38b5f1ba4861/bin/uautomizer/witness.graphml [2019-11-20 03:30:13,903 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 03:30:13,905 INFO L168 Benchmark]: Toolchain (without parser) took 89698.05 ms. Allocated memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: 2.5 GB). Free memory was 946.1 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 846.4 MB. Max. memory is 11.5 GB. [2019-11-20 03:30:13,905 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 03:30:13,905 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1013.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-20 03:30:13,906 INFO L168 Benchmark]: Boogie Procedure Inliner took 119.33 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.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-20 03:30:13,906 INFO L168 Benchmark]: Boogie Preprocessor took 109.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-20 03:30:13,907 INFO L168 Benchmark]: RCFGBuilder took 2068.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 909.2 MB in the end (delta: 183.8 MB). Peak memory consumption was 183.8 MB. Max. memory is 11.5 GB. [2019-11-20 03:30:13,907 INFO L168 Benchmark]: TraceAbstraction took 86156.35 ms. Allocated memory was 1.2 GB in the beginning and 3.5 GB in the end (delta: 2.3 GB). Free memory was 909.2 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-11-20 03:30:13,908 INFO L168 Benchmark]: Witness Printer took 226.07 ms. Allocated memory is still 3.5 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2019-11-20 03:30:13,910 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1013.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.6 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -173.8 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 119.33 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.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 109.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2068.96 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 909.2 MB in the end (delta: 183.8 MB). Peak memory consumption was 183.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 86156.35 ms. Allocated memory was 1.2 GB in the beginning and 3.5 GB in the end (delta: 2.3 GB). Free memory was 909.2 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 226.07 ms. Allocated memory is still 3.5 GB. Free memory was 2.6 GB in the beginning and 2.6 GB in the end (delta: 16.9 MB). Peak memory consumption was 16.9 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_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 93]: 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-20 03:30:13,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,922 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,923 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,924 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 03:30:13,925 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 03:30:13,926 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 03:30:13,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,929 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,930 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,931 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 03:30:13,932 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 03:30:13,933 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((a25 <= 12 && a29 <= 130) && a25 <= 9) && 1 == a4) || ((a25 == 9 && 15 == a8) && 1 == a4)) || (((!(a25 == 11) && a25 <= 12) && 1 == a4) && a23 + 43 <= 0)) || (((((\exists v_~a23~0_474 : int :: ((v_~a23~0_474 % 5 == 0 && a23 <= v_~a23~0_474 / 5 * 4 % 83 + 180) && 312 <= v_~a23~0_474) && 0 <= 4 * (v_~a23~0_474 / 5)) && a25 == 13) && a29 + 5 * a23 <= 101230) && 277 < a29 && !(10 == a25)) && 1 == a4)) || ((((a23 <= 312 && 15 == a8) && 1 == a4) && a25 == 11) && 138 < a23)) || (((((!(a25 == 11) && 5 * a29 + a23 <= 1687) && a29 + 193245 <= 0) && a25 <= 12) && 15 == a8) && a4 == 1)) || (((a25 == 13 && a23 <= 312) && 15 == a8) && (a29 + 5 * a23 <= 101230 || a23 <= 306))) || ((((\exists v_~a23~0_474 : int :: ((v_~a23~0_474 % 5 == 0 && a23 <= v_~a23~0_474 / 5 * 4 % 83 + 180) && 312 <= v_~a23~0_474) && 0 <= 4 * (v_~a23~0_474 / 5)) && a25 == 13) && a29 <= 130) && 1 == a4)) || (((10 == a25 && 15 == a8) && 1 == a4) && 138 < a23)) || (((((1 == a4 && a25 == 11) && 138 < a23) && 141 <= a29) || ((((12 == a25 && 140 < a29) && a29 <= 277) && 1 == a4) && 138 < a23)) && 15 == a8)) || ((a25 == 9 && 277 < a29 && a23 + 43 <= 0) && 15 == a8)) || (((a23 <= 312 && 10 == a25) && 15 == a8) && a29 <= 245)) || ((a29 <= 130 && 10 == a25) && 15 == a8)) || (15 == a8 && ((a23 <= 312 && a25 <= 9) && 1 == a4) && 260 <= a29)) || ((((!(a25 == 11) && a23 <= 312) && a25 <= 12 && a29 <= 130) && 1 == a4) && 15 == a8)) || ((10 == a25 && 15 == a8) && a23 + 43 <= 0)) || ((((a25 <= 9 && a29 <= 275) && 1 == a4) && 260 <= a29) && 15 == a8)) || ((((a23 <= 312 && a25 == 9) && 0 < a23 + 43) && 15 == a8) && a29 <= 245)) || (((a23 <= 312 && 12 == a25) && 15 == a8) && 138 < a23)) || (((a25 == 13 && (\exists v_~a29~0_505 : int :: (v_~a29~0_505 <= 140 && a29 <= v_~a29~0_505 / 5 + 206649) && 0 <= v_~a29~0_505)) && 1 == a4) && 15 == a8)) || (15 == a8 && ((12 == a25 || (1 == a4 && a25 == 11)) && a29 <= 275) && 141 <= a29)) || (((((10 == a25 && 277 < a29) || ((277 < a29 && !(10 == a25)) && a25 == 11)) && 1 == a4) || ((a25 <= 9 && 277 < a29 && !(10 == a25)) && 1 == a4)) && 15 == a8)) || ((a23 <= 312 && 12 == a25 && !(a4 == 1)) && 15 == a8)) || (((a25 == 9 && a29 + 193245 <= 0) && a23 + 43 <= 0) && 15 == a8)) || ((15 == a8 && a25 == 11) && a23 + 43 <= 0)) || (((a29 <= 245 && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || (((12 == a25 && a4 <= 0) && a29 + 193245 <= 0) && 15 == a8)) || (((!(a25 == 13) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0) - InvariantResult [Line: 22]: Loop Invariant [2019-11-20 03:30:13,935 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,936 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,937 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 03:30:13,938 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 03:30:13,939 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 03:30:13,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,941 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,942 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,943 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a23~0_474,QUANTIFIED] [2019-11-20 03:30:13,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 03:30:13,944 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] [2019-11-20 03:30:13,945 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_505,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((a25 <= 12 && a29 <= 130) && a25 <= 9) && 1 == a4) || ((a25 == 9 && 15 == a8) && 1 == a4)) || (((!(a25 == 11) && a25 <= 12) && 1 == a4) && a23 + 43 <= 0)) || (((((\exists v_~a23~0_474 : int :: ((v_~a23~0_474 % 5 == 0 && a23 <= v_~a23~0_474 / 5 * 4 % 83 + 180) && 312 <= v_~a23~0_474) && 0 <= 4 * (v_~a23~0_474 / 5)) && a25 == 13) && a29 + 5 * a23 <= 101230) && 277 < a29 && !(10 == a25)) && 1 == a4)) || ((((a23 <= 312 && 15 == a8) && 1 == a4) && a25 == 11) && 138 < a23)) || (((((!(a25 == 11) && 5 * a29 + a23 <= 1687) && a29 + 193245 <= 0) && a25 <= 12) && 15 == a8) && a4 == 1)) || (((a25 == 13 && a23 <= 312) && 15 == a8) && (a29 + 5 * a23 <= 101230 || a23 <= 306))) || ((((\exists v_~a23~0_474 : int :: ((v_~a23~0_474 % 5 == 0 && a23 <= v_~a23~0_474 / 5 * 4 % 83 + 180) && 312 <= v_~a23~0_474) && 0 <= 4 * (v_~a23~0_474 / 5)) && a25 == 13) && a29 <= 130) && 1 == a4)) || (((10 == a25 && 15 == a8) && 1 == a4) && 138 < a23)) || (((((1 == a4 && a25 == 11) && 138 < a23) && 141 <= a29) || ((((12 == a25 && 140 < a29) && a29 <= 277) && 1 == a4) && 138 < a23)) && 15 == a8)) || ((a25 == 9 && 277 < a29 && a23 + 43 <= 0) && 15 == a8)) || (((a23 <= 312 && 10 == a25) && 15 == a8) && a29 <= 245)) || ((a29 <= 130 && 10 == a25) && 15 == a8)) || (15 == a8 && ((a23 <= 312 && a25 <= 9) && 1 == a4) && 260 <= a29)) || ((((!(a25 == 11) && a23 <= 312) && a25 <= 12 && a29 <= 130) && 1 == a4) && 15 == a8)) || ((10 == a25 && 15 == a8) && a23 + 43 <= 0)) || ((((a25 <= 9 && a29 <= 275) && 1 == a4) && 260 <= a29) && 15 == a8)) || ((((a23 <= 312 && a25 == 9) && 0 < a23 + 43) && 15 == a8) && a29 <= 245)) || (((a23 <= 312 && 12 == a25) && 15 == a8) && 138 < a23)) || (((a25 == 13 && (\exists v_~a29~0_505 : int :: (v_~a29~0_505 <= 140 && a29 <= v_~a29~0_505 / 5 + 206649) && 0 <= v_~a29~0_505)) && 1 == a4) && 15 == a8)) || (15 == a8 && ((12 == a25 || (1 == a4 && a25 == 11)) && a29 <= 275) && 141 <= a29)) || (((((10 == a25 && 277 < a29) || ((277 < a29 && !(10 == a25)) && a25 == 11)) && 1 == a4) || ((a25 <= 9 && 277 < a29 && !(10 == a25)) && 1 == a4)) && 15 == a8)) || ((a23 <= 312 && 12 == a25 && !(a4 == 1)) && 15 == a8)) || (((a25 == 9 && a29 + 193245 <= 0) && a23 + 43 <= 0) && 15 == a8)) || ((15 == a8 && a25 == 11) && a23 + 43 <= 0)) || (((a29 <= 245 && 1 == a4) && 130 <= a29) && a23 + 43 <= 0)) || (((12 == a25 && a4 <= 0) && a29 + 193245 <= 0) && 15 == a8)) || (((!(a25 == 13) && 1 == a4) && 130 <= a29) && a23 + 43 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Result: SAFE, OverallTime: 86.0s, OverallIterations: 19, TraceHistogramMax: 9, AutomataDifference: 58.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 9.1s, HoareTripleCheckerStatistics: 2876 SDtfs, 12471 SDslu, 1381 SDs, 0 SdLazy, 44178 SolverSat, 4466 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 45.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2262 GetRequests, 2151 SyntacticMatches, 8 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22888occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 41484 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 180 NumberOfFragments, 1127 HoareAnnotationTreeSize, 3 FomulaSimplifications, 80934 FormulaSimplificationTreeSizeReduction, 2.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 53002 FormulaSimplificationTreeSizeReductionInter, 7.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.6s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 8979 NumberOfCodeBlocks, 8979 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 8954 ConstructedInterpolants, 297 QuantifiedInterpolants, 16796626 SizeOfPredicates, 2 NumberOfNonLiveVariables, 2864 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 25 InterpolantComputations, 16 PerfectInterpolantSequences, 11655/12788 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...