./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label00.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_0db078eb-89dd-4205-bcc1-a88763d9488b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0db078eb-89dd-4205-bcc1-a88763d9488b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0db078eb-89dd-4205-bcc1-a88763d9488b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0db078eb-89dd-4205-bcc1-a88763d9488b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label00.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0db078eb-89dd-4205-bcc1-a88763d9488b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0db078eb-89dd-4205-bcc1-a88763d9488b/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 e521cfa02db8c2eac8727300620f5ffec2ecc0c7 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 19:54:49,235 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 19:54:49,237 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 19:54:49,251 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 19:54:49,252 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 19:54:49,253 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 19:54:49,255 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 19:54:49,266 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 19:54:49,268 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 19:54:49,269 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 19:54:49,269 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 19:54:49,270 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 19:54:49,271 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 19:54:49,271 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 19:54:49,272 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 19:54:49,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 19:54:49,274 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 19:54:49,275 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 19:54:49,276 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 19:54:49,278 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 19:54:49,279 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 19:54:49,280 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 19:54:49,281 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 19:54:49,282 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 19:54:49,284 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 19:54:49,284 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 19:54:49,285 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 19:54:49,286 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 19:54:49,286 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 19:54:49,287 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 19:54:49,287 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 19:54:49,288 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 19:54:49,288 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 19:54:49,289 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 19:54:49,290 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 19:54:49,290 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 19:54:49,291 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 19:54:49,291 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 19:54:49,291 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 19:54:49,292 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 19:54:49,292 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 19:54:49,293 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0db078eb-89dd-4205-bcc1-a88763d9488b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 19:54:49,306 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 19:54:49,306 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 19:54:49,307 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 19:54:49,307 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 19:54:49,307 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 19:54:49,308 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 19:54:49,308 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 19:54:49,308 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 19:54:49,308 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 19:54:49,308 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 19:54:49,309 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 19:54:49,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 19:54:49,309 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 19:54:49,309 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 19:54:49,309 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 19:54:49,309 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 19:54:49,310 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 19:54:49,310 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 19:54:49,310 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 19:54:49,310 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 19:54:49,310 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 19:54:49,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 19:54:49,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 19:54:49,311 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 19:54:49,311 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 19:54:49,311 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 19:54:49,312 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 19:54:49,312 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 19:54:49,312 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_0db078eb-89dd-4205-bcc1-a88763d9488b/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 -> e521cfa02db8c2eac8727300620f5ffec2ecc0c7 [2019-11-15 19:54:49,336 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 19:54:49,345 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 19:54:49,349 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 19:54:49,351 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 19:54:49,351 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 19:54:49,353 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0db078eb-89dd-4205-bcc1-a88763d9488b/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label00.c [2019-11-15 19:54:49,417 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0db078eb-89dd-4205-bcc1-a88763d9488b/bin/uautomizer/data/86bef35d6/9229ea8fccab494cb243862a1ce924f5/FLAGde1d6b1f7 [2019-11-15 19:54:49,900 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 19:54:49,901 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0db078eb-89dd-4205-bcc1-a88763d9488b/sv-benchmarks/c/eca-rers2012/Problem02_label00.c [2019-11-15 19:54:49,911 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0db078eb-89dd-4205-bcc1-a88763d9488b/bin/uautomizer/data/86bef35d6/9229ea8fccab494cb243862a1ce924f5/FLAGde1d6b1f7 [2019-11-15 19:54:50,232 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0db078eb-89dd-4205-bcc1-a88763d9488b/bin/uautomizer/data/86bef35d6/9229ea8fccab494cb243862a1ce924f5 [2019-11-15 19:54:50,234 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 19:54:50,236 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 19:54:50,237 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 19:54:50,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 19:54:50,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 19:54:50,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:54:50" (1/1) ... [2019-11-15 19:54:50,244 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56c06bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:50, skipping insertion in model container [2019-11-15 19:54:50,245 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:54:50" (1/1) ... [2019-11-15 19:54:50,251 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 19:54:50,297 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 19:54:50,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:54:50,705 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 19:54:50,810 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:54:50,825 INFO L192 MainTranslator]: Completed translation [2019-11-15 19:54:50,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:50 WrapperNode [2019-11-15 19:54:50,826 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 19:54:50,827 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 19:54:50,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 19:54:50,827 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 19:54:50,835 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:50" (1/1) ... [2019-11-15 19:54:50,852 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:50" (1/1) ... [2019-11-15 19:54:50,897 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 19:54:50,898 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 19:54:50,898 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 19:54:50,898 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 19:54:50,907 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:50" (1/1) ... [2019-11-15 19:54:50,908 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:50" (1/1) ... [2019-11-15 19:54:50,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:50" (1/1) ... [2019-11-15 19:54:50,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:50" (1/1) ... [2019-11-15 19:54:50,931 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:50" (1/1) ... [2019-11-15 19:54:50,956 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:50" (1/1) ... [2019-11-15 19:54:50,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:50" (1/1) ... [2019-11-15 19:54:50,986 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 19:54:50,986 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 19:54:50,986 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 19:54:50,986 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 19:54:50,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0db078eb-89dd-4205-bcc1-a88763d9488b/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 19:54:51,052 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 19:54:51,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 19:54:52,266 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 19:54:52,267 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 19:54:52,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:54:52 BoogieIcfgContainer [2019-11-15 19:54:52,268 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 19:54:52,269 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 19:54:52,269 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 19:54:52,271 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 19:54:52,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 07:54:50" (1/3) ... [2019-11-15 19:54:52,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54bf59f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 07:54:52, skipping insertion in model container [2019-11-15 19:54:52,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:50" (2/3) ... [2019-11-15 19:54:52,273 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54bf59f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 07:54:52, skipping insertion in model container [2019-11-15 19:54:52,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:54:52" (3/3) ... [2019-11-15 19:54:52,278 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem02_label00.c [2019-11-15 19:54:52,286 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 19:54:52,294 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 19:54:52,304 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 19:54:52,332 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 19:54:52,332 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 19:54:52,332 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 19:54:52,332 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 19:54:52,333 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 19:54:52,333 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 19:54:52,333 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 19:54:52,333 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 19:54:52,357 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-11-15 19:54:52,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-15 19:54:52,377 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:52,378 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:52,380 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:52,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:52,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1162953203, now seen corresponding path program 1 times [2019-11-15 19:54:52,393 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:52,393 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572347846] [2019-11-15 19:54:52,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:52,394 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:52,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:52,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:54:52,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572347846] [2019-11-15 19:54:52,859 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:52,859 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:54:52,860 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602649405] [2019-11-15 19:54:52,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:54:52,864 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:52,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:54:52,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:54:52,880 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-11-15 19:54:54,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:54,326 INFO L93 Difference]: Finished difference Result 775 states and 1353 transitions. [2019-11-15 19:54:54,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:54:54,329 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-15 19:54:54,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:54,352 INFO L225 Difference]: With dead ends: 775 [2019-11-15 19:54:54,352 INFO L226 Difference]: Without dead ends: 460 [2019-11-15 19:54:54,365 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:54:54,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2019-11-15 19:54:54,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 308. [2019-11-15 19:54:54,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-11-15 19:54:54,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 451 transitions. [2019-11-15 19:54:54,454 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 451 transitions. Word has length 115 [2019-11-15 19:54:54,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:54,456 INFO L462 AbstractCegarLoop]: Abstraction has 308 states and 451 transitions. [2019-11-15 19:54:54,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:54:54,456 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 451 transitions. [2019-11-15 19:54:54,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-15 19:54:54,468 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:54,469 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:54,470 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:54,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:54,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1399875752, now seen corresponding path program 1 times [2019-11-15 19:54:54,471 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:54,471 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141787262] [2019-11-15 19:54:54,471 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:54,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:54,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:54,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:54,635 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:54:54,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141787262] [2019-11-15 19:54:54,635 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:54,636 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:54:54,636 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622361366] [2019-11-15 19:54:54,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:54:54,639 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:54,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:54:54,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:54:54,639 INFO L87 Difference]: Start difference. First operand 308 states and 451 transitions. Second operand 3 states. [2019-11-15 19:54:55,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:55,127 INFO L93 Difference]: Finished difference Result 903 states and 1331 transitions. [2019-11-15 19:54:55,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:54:55,128 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 119 [2019-11-15 19:54:55,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:55,133 INFO L225 Difference]: With dead ends: 903 [2019-11-15 19:54:55,134 INFO L226 Difference]: Without dead ends: 597 [2019-11-15 19:54:55,135 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:54:55,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-11-15 19:54:55,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 592. [2019-11-15 19:54:55,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-11-15 19:54:55,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 825 transitions. [2019-11-15 19:54:55,182 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 825 transitions. Word has length 119 [2019-11-15 19:54:55,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:55,183 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 825 transitions. [2019-11-15 19:54:55,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:54:55,184 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 825 transitions. [2019-11-15 19:54:55,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-15 19:54:55,191 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:55,191 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:55,192 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:55,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:55,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1868435191, now seen corresponding path program 1 times [2019-11-15 19:54:55,192 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:55,193 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533936836] [2019-11-15 19:54:55,193 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:55,194 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:55,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:55,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:55,302 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:54:55,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533936836] [2019-11-15 19:54:55,303 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:55,303 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 19:54:55,303 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557304593] [2019-11-15 19:54:55,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:54:55,304 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:55,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:54:55,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:54:55,305 INFO L87 Difference]: Start difference. First operand 592 states and 825 transitions. Second operand 3 states. [2019-11-15 19:54:55,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:55,827 INFO L93 Difference]: Finished difference Result 1742 states and 2434 transitions. [2019-11-15 19:54:55,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:54:55,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-11-15 19:54:55,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:55,834 INFO L225 Difference]: With dead ends: 1742 [2019-11-15 19:54:55,834 INFO L226 Difference]: Without dead ends: 1152 [2019-11-15 19:54:55,836 INFO L600 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-15 19:54:55,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1152 states. [2019-11-15 19:54:55,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1152 to 1152. [2019-11-15 19:54:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1152 states. [2019-11-15 19:54:55,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1152 states to 1152 states and 1520 transitions. [2019-11-15 19:54:55,863 INFO L78 Accepts]: Start accepts. Automaton has 1152 states and 1520 transitions. Word has length 125 [2019-11-15 19:54:55,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:55,863 INFO L462 AbstractCegarLoop]: Abstraction has 1152 states and 1520 transitions. [2019-11-15 19:54:55,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:54:55,864 INFO L276 IsEmpty]: Start isEmpty. Operand 1152 states and 1520 transitions. [2019-11-15 19:54:55,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-11-15 19:54:55,867 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:55,867 INFO L380 BasicCegarLoop]: trace histogram [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-15 19:54:55,867 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:55,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:55,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1256805806, now seen corresponding path program 1 times [2019-11-15 19:54:55,868 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:55,868 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552586699] [2019-11-15 19:54:55,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:55,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:55,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:55,932 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:54:55,932 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552586699] [2019-11-15 19:54:55,932 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:55,933 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:54:55,933 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669482111] [2019-11-15 19:54:55,933 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:54:55,934 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:55,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:54:55,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:54:55,934 INFO L87 Difference]: Start difference. First operand 1152 states and 1520 transitions. Second operand 4 states. [2019-11-15 19:54:56,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:56,540 INFO L93 Difference]: Finished difference Result 2306 states and 3045 transitions. [2019-11-15 19:54:56,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:54:56,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-11-15 19:54:56,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:56,548 INFO L225 Difference]: With dead ends: 2306 [2019-11-15 19:54:56,548 INFO L226 Difference]: Without dead ends: 1156 [2019-11-15 19:54:56,550 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:54:56,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2019-11-15 19:54:56,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1151. [2019-11-15 19:54:56,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2019-11-15 19:54:56,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1466 transitions. [2019-11-15 19:54:56,578 INFO L78 Accepts]: Start accepts. Automaton has 1151 states and 1466 transitions. Word has length 133 [2019-11-15 19:54:56,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:56,579 INFO L462 AbstractCegarLoop]: Abstraction has 1151 states and 1466 transitions. [2019-11-15 19:54:56,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:54:56,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1151 states and 1466 transitions. [2019-11-15 19:54:56,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-15 19:54:56,583 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:56,583 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:56,583 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:56,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:56,584 INFO L82 PathProgramCache]: Analyzing trace with hash -848335417, now seen corresponding path program 1 times [2019-11-15 19:54:56,584 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:56,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873668947] [2019-11-15 19:54:56,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:56,585 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:56,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:56,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:56,677 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:54:56,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873668947] [2019-11-15 19:54:56,678 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:56,678 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:54:56,679 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485693209] [2019-11-15 19:54:56,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:54:56,679 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:56,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:54:56,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:54:56,681 INFO L87 Difference]: Start difference. First operand 1151 states and 1466 transitions. Second operand 4 states. [2019-11-15 19:54:57,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:57,714 INFO L93 Difference]: Finished difference Result 3563 states and 4486 transitions. [2019-11-15 19:54:57,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:54:57,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-11-15 19:54:57,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:57,727 INFO L225 Difference]: With dead ends: 3563 [2019-11-15 19:54:57,727 INFO L226 Difference]: Without dead ends: 2414 [2019-11-15 19:54:57,729 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:54:57,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2414 states. [2019-11-15 19:54:57,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2414 to 2411. [2019-11-15 19:54:57,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2019-11-15 19:54:57,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 2847 transitions. [2019-11-15 19:54:57,789 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 2847 transitions. Word has length 137 [2019-11-15 19:54:57,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:57,790 INFO L462 AbstractCegarLoop]: Abstraction has 2411 states and 2847 transitions. [2019-11-15 19:54:57,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:54:57,790 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 2847 transitions. [2019-11-15 19:54:57,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-11-15 19:54:57,795 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:57,795 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:57,795 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:57,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:57,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1795097999, now seen corresponding path program 1 times [2019-11-15 19:54:57,796 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:57,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679309613] [2019-11-15 19:54:57,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:57,796 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:57,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:57,938 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 19:54:57,938 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679309613] [2019-11-15 19:54:57,939 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:57,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 19:54:57,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232645999] [2019-11-15 19:54:57,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:54:57,940 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:57,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:54:57,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:54:57,941 INFO L87 Difference]: Start difference. First operand 2411 states and 2847 transitions. Second operand 4 states. [2019-11-15 19:54:58,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:58,571 INFO L93 Difference]: Finished difference Result 4820 states and 5692 transitions. [2019-11-15 19:54:58,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:54:58,571 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-11-15 19:54:58,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:58,585 INFO L225 Difference]: With dead ends: 4820 [2019-11-15 19:54:58,585 INFO L226 Difference]: Without dead ends: 2411 [2019-11-15 19:54:58,588 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:54:58,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2411 states. [2019-11-15 19:54:58,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2411 to 2131. [2019-11-15 19:54:58,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2131 states. [2019-11-15 19:54:58,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 2410 transitions. [2019-11-15 19:54:58,650 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 2410 transitions. Word has length 142 [2019-11-15 19:54:58,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:58,650 INFO L462 AbstractCegarLoop]: Abstraction has 2131 states and 2410 transitions. [2019-11-15 19:54:58,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:54:58,651 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 2410 transitions. [2019-11-15 19:54:58,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-15 19:54:58,656 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:58,656 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:58,657 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:58,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:58,663 INFO L82 PathProgramCache]: Analyzing trace with hash 487075866, now seen corresponding path program 1 times [2019-11-15 19:54:58,664 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:58,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358113287] [2019-11-15 19:54:58,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:58,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:58,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:58,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:58,805 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 19:54:58,806 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358113287] [2019-11-15 19:54:58,807 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:58,807 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:54:58,807 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123309690] [2019-11-15 19:54:58,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:54:58,808 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:58,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:54:58,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:54:58,808 INFO L87 Difference]: Start difference. First operand 2131 states and 2410 transitions. Second operand 3 states. [2019-11-15 19:54:59,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:59,290 INFO L93 Difference]: Finished difference Result 4257 states and 4810 transitions. [2019-11-15 19:54:59,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:54:59,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-11-15 19:54:59,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:59,300 INFO L225 Difference]: With dead ends: 4257 [2019-11-15 19:54:59,300 INFO L226 Difference]: Without dead ends: 1848 [2019-11-15 19:54:59,303 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:54:59,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1848 states. [2019-11-15 19:54:59,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1848 to 1568. [2019-11-15 19:54:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1568 states. [2019-11-15 19:54:59,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 1706 transitions. [2019-11-15 19:54:59,336 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 1706 transitions. Word has length 208 [2019-11-15 19:54:59,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:59,337 INFO L462 AbstractCegarLoop]: Abstraction has 1568 states and 1706 transitions. [2019-11-15 19:54:59,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:54:59,337 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 1706 transitions. [2019-11-15 19:54:59,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2019-11-15 19:54:59,342 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:59,342 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:59,343 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:59,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:59,343 INFO L82 PathProgramCache]: Analyzing trace with hash 1239133772, now seen corresponding path program 1 times [2019-11-15 19:54:59,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:59,343 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835613287] [2019-11-15 19:54:59,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:59,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:59,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:59,416 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-11-15 19:54:59,416 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835613287] [2019-11-15 19:54:59,416 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:59,416 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:54:59,417 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743842571] [2019-11-15 19:54:59,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 19:54:59,417 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:59,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 19:54:59,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:54:59,418 INFO L87 Difference]: Start difference. First operand 1568 states and 1706 transitions. Second operand 4 states. [2019-11-15 19:54:59,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:59,837 INFO L93 Difference]: Finished difference Result 3263 states and 3549 transitions. [2019-11-15 19:54:59,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 19:54:59,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 210 [2019-11-15 19:54:59,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:59,843 INFO L225 Difference]: With dead ends: 3263 [2019-11-15 19:54:59,844 INFO L226 Difference]: Without dead ends: 1275 [2019-11-15 19:54:59,846 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 19:54:59,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1275 states. [2019-11-15 19:54:59,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1275 to 1275. [2019-11-15 19:54:59,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-11-15 19:54:59,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1362 transitions. [2019-11-15 19:54:59,871 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1362 transitions. Word has length 210 [2019-11-15 19:54:59,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:59,872 INFO L462 AbstractCegarLoop]: Abstraction has 1275 states and 1362 transitions. [2019-11-15 19:54:59,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 19:54:59,872 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1362 transitions. [2019-11-15 19:54:59,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2019-11-15 19:54:59,876 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:59,877 INFO L380 BasicCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-11-15 19:54:59,877 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:59,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:59,877 INFO L82 PathProgramCache]: Analyzing trace with hash -192429443, now seen corresponding path program 1 times [2019-11-15 19:54:59,878 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:59,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131327078] [2019-11-15 19:54:59,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:59,878 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:59,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:00,066 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 85 proven. 3 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-15 19:55:00,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131327078] [2019-11-15 19:55:00,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453826886] [2019-11-15 19:55:00,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0db078eb-89dd-4205-bcc1-a88763d9488b/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:55:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:00,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 19:55:00,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:55:00,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 19:55:00,342 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-15 19:55:00,343 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:55:00,343 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 6 [2019-11-15 19:55:00,343 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792583835] [2019-11-15 19:55:00,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 19:55:00,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:55:00,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 19:55:00,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:55:00,345 INFO L87 Difference]: Start difference. First operand 1275 states and 1362 transitions. Second operand 5 states. [2019-11-15 19:55:01,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:55:01,186 INFO L93 Difference]: Finished difference Result 2712 states and 2899 transitions. [2019-11-15 19:55:01,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 19:55:01,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 222 [2019-11-15 19:55:01,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:55:01,194 INFO L225 Difference]: With dead ends: 2712 [2019-11-15 19:55:01,194 INFO L226 Difference]: Without dead ends: 1439 [2019-11-15 19:55:01,197 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-11-15 19:55:01,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2019-11-15 19:55:01,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1275. [2019-11-15 19:55:01,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-11-15 19:55:01,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1349 transitions. [2019-11-15 19:55:01,229 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1349 transitions. Word has length 222 [2019-11-15 19:55:01,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:55:01,230 INFO L462 AbstractCegarLoop]: Abstraction has 1275 states and 1349 transitions. [2019-11-15 19:55:01,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 19:55:01,230 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1349 transitions. [2019-11-15 19:55:01,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-11-15 19:55:01,235 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:55:01,235 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:55:01,438 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:55:01,438 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:55:01,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:01,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1835643882, now seen corresponding path program 1 times [2019-11-15 19:55:01,439 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:01,441 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694766407] [2019-11-15 19:55:01,441 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:01,441 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:01,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:01,549 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 103 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-11-15 19:55:01,549 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694766407] [2019-11-15 19:55:01,549 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:55:01,549 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 19:55:01,550 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664028467] [2019-11-15 19:55:01,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:55:01,554 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:55:01,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:55:01,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:55:01,555 INFO L87 Difference]: Start difference. First operand 1275 states and 1349 transitions. Second operand 3 states. [2019-11-15 19:55:01,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:55:01,983 INFO L93 Difference]: Finished difference Result 3109 states and 3312 transitions. [2019-11-15 19:55:01,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:55:01,984 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2019-11-15 19:55:01,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:55:01,992 INFO L225 Difference]: With dead ends: 3109 [2019-11-15 19:55:01,992 INFO L226 Difference]: Without dead ends: 1696 [2019-11-15 19:55:01,994 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:55:01,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1696 states. [2019-11-15 19:55:02,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1696 to 1556. [2019-11-15 19:55:02,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1556 states. [2019-11-15 19:55:02,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 1631 transitions. [2019-11-15 19:55:02,023 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 1631 transitions. Word has length 250 [2019-11-15 19:55:02,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:55:02,023 INFO L462 AbstractCegarLoop]: Abstraction has 1556 states and 1631 transitions. [2019-11-15 19:55:02,024 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:55:02,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 1631 transitions. [2019-11-15 19:55:02,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-11-15 19:55:02,030 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:55:02,030 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:55:02,031 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:55:02,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:55:02,031 INFO L82 PathProgramCache]: Analyzing trace with hash -546420939, now seen corresponding path program 1 times [2019-11-15 19:55:02,031 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:55:02,032 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116337345] [2019-11-15 19:55:02,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:02,032 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:55:02,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:55:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:02,317 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 177 proven. 9 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-15 19:55:02,317 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116337345] [2019-11-15 19:55:02,317 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684568397] [2019-11-15 19:55:02,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0db078eb-89dd-4205-bcc1-a88763d9488b/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:55:02,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:55:02,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 19:55:02,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 19:55:02,512 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2019-11-15 19:55:02,512 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 19:55:02,513 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-11-15 19:55:02,513 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609850260] [2019-11-15 19:55:02,513 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:55:02,514 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:55:02,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:55:02,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 19:55:02,514 INFO L87 Difference]: Start difference. First operand 1556 states and 1631 transitions. Second operand 3 states. [2019-11-15 19:55:02,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:55:02,921 INFO L93 Difference]: Finished difference Result 3108 states and 3267 transitions. [2019-11-15 19:55:02,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:55:02,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-11-15 19:55:02,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:55:02,921 INFO L225 Difference]: With dead ends: 3108 [2019-11-15 19:55:02,921 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 19:55:02,924 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-15 19:55:02,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 19:55:02,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 19:55:02,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 19:55:02,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 19:55:02,925 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 255 [2019-11-15 19:55:02,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:55:02,926 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 19:55:02,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:55:02,926 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 19:55:02,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 19:55:03,130 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 19:55:03,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 19:55:03,557 WARN L191 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-11-15 19:55:03,916 WARN L191 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2019-11-15 19:55:03,918 INFO L443 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,918 INFO L443 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,918 INFO L443 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,919 INFO L443 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-11-15 19:55:03,919 INFO L443 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-11-15 19:55:03,919 INFO L443 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-11-15 19:55:03,919 INFO L443 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-11-15 19:55:03,919 INFO L443 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-11-15 19:55:03,919 INFO L443 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-11-15 19:55:03,919 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-11-15 19:55:03,919 INFO L443 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,919 INFO L443 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,919 INFO L443 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,920 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-11-15 19:55:03,920 INFO L443 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-11-15 19:55:03,920 INFO L443 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-11-15 19:55:03,920 INFO L443 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-11-15 19:55:03,920 INFO L443 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-11-15 19:55:03,920 INFO L443 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-11-15 19:55:03,920 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-11-15 19:55:03,920 INFO L443 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,920 INFO L443 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,921 INFO L443 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,921 INFO L443 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-11-15 19:55:03,921 INFO L443 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-11-15 19:55:03,921 INFO L443 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-11-15 19:55:03,921 INFO L443 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-11-15 19:55:03,921 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-11-15 19:55:03,921 INFO L443 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,921 INFO L443 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,921 INFO L443 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,922 INFO L443 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-11-15 19:55:03,922 INFO L443 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-11-15 19:55:03,922 INFO L443 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-11-15 19:55:03,922 INFO L443 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-11-15 19:55:03,922 INFO L443 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-11-15 19:55:03,922 INFO L443 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-11-15 19:55:03,922 INFO L443 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-11-15 19:55:03,922 INFO L443 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-11-15 19:55:03,922 INFO L443 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,922 INFO L443 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,923 INFO L443 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,923 INFO L443 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-11-15 19:55:03,923 INFO L443 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-11-15 19:55:03,923 INFO L443 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-11-15 19:55:03,923 INFO L443 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-11-15 19:55:03,923 INFO L443 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-11-15 19:55:03,923 INFO L443 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-11-15 19:55:03,923 INFO L443 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-11-15 19:55:03,923 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-11-15 19:55:03,924 INFO L443 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,924 INFO L443 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,924 INFO L443 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,924 INFO L443 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-11-15 19:55:03,924 INFO L443 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-11-15 19:55:03,924 INFO L443 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-11-15 19:55:03,924 INFO L443 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-11-15 19:55:03,924 INFO L443 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-11-15 19:55:03,924 INFO L443 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-11-15 19:55:03,924 INFO L443 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-11-15 19:55:03,925 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 517) no Hoare annotation was computed. [2019-11-15 19:55:03,925 INFO L443 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-11-15 19:55:03,925 INFO L443 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-11-15 19:55:03,925 INFO L443 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,925 INFO L443 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,925 INFO L443 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,925 INFO L443 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-11-15 19:55:03,925 INFO L443 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-11-15 19:55:03,925 INFO L443 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-11-15 19:55:03,926 INFO L443 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-11-15 19:55:03,926 INFO L443 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-11-15 19:55:03,926 INFO L443 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-11-15 19:55:03,926 INFO L443 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,926 INFO L443 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,926 INFO L443 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,926 INFO L443 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-11-15 19:55:03,926 INFO L443 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-11-15 19:55:03,926 INFO L443 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-11-15 19:55:03,927 INFO L443 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-11-15 19:55:03,927 INFO L443 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-11-15 19:55:03,927 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 19:55:03,927 INFO L443 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-11-15 19:55:03,927 INFO L443 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-11-15 19:55:03,927 INFO L443 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-11-15 19:55:03,927 INFO L443 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,927 INFO L443 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,927 INFO L443 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,928 INFO L443 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-11-15 19:55:03,928 INFO L443 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-11-15 19:55:03,928 INFO L443 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-11-15 19:55:03,928 INFO L443 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-11-15 19:55:03,928 INFO L443 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-11-15 19:55:03,928 INFO L443 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,928 INFO L443 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,928 INFO L443 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,928 INFO L443 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-11-15 19:55:03,929 INFO L443 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-11-15 19:55:03,929 INFO L443 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-11-15 19:55:03,929 INFO L443 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-11-15 19:55:03,929 INFO L443 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-11-15 19:55:03,929 INFO L443 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-11-15 19:55:03,929 INFO L443 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-11-15 19:55:03,929 INFO L443 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-11-15 19:55:03,929 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-11-15 19:55:03,929 INFO L443 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-11-15 19:55:03,930 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 19:55:03,930 INFO L443 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-11-15 19:55:03,930 INFO L443 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,930 INFO L443 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,930 INFO L443 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-11-15 19:55:03,930 INFO L443 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-11-15 19:55:03,931 INFO L443 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-11-15 19:55:03,931 INFO L443 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-11-15 19:55:03,931 INFO L443 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-11-15 19:55:03,931 INFO L443 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-11-15 19:55:03,931 INFO L443 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-11-15 19:55:03,931 INFO L443 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-11-15 19:55:03,931 INFO L443 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-11-15 19:55:03,932 INFO L439 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse7 (not (= ~a28~0 11))) (.cse11 (<= ~a19~0 0)) (.cse4 (<= ~a25~0 0)) (.cse5 (not (= 1 ~a11~0)))) (let ((.cse2 (= ~a28~0 7)) (.cse8 (or (and .cse11 .cse4 .cse7) (and .cse11 .cse4 .cse5))) (.cse10 (= ~a28~0 9)) (.cse12 (<= 10 ~a28~0)) (.cse0 (= ~a17~0 8)) (.cse3 (= ~a21~0 1)) (.cse1 (= ~a19~0 1)) (.cse6 (= ~a25~0 1)) (.cse13 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse5 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse0 .cse1 .cse3 .cse6) (and .cse0 .cse1 .cse6 .cse7) (and .cse8 .cse9) (and .cse10 .cse11 .cse6 .cse9) (and .cse11 .cse12 .cse0 .cse6 .cse5 .cse7) (and (and .cse10 .cse1 .cse4 .cse9) .cse0) (and .cse11 .cse0 .cse2 .cse6 .cse5) (and .cse8 .cse0) (and .cse10 .cse0 .cse1 .cse3 .cse4) (and .cse12 .cse1 .cse4 .cse9 .cse13) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse7) (and .cse1 .cse6 .cse13 .cse9 .cse7)))) [2019-11-15 19:55:03,932 INFO L443 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,933 INFO L443 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,933 INFO L443 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-11-15 19:55:03,933 INFO L443 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-11-15 19:55:03,933 INFO L443 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-11-15 19:55:03,933 INFO L443 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-11-15 19:55:03,933 INFO L443 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-11-15 19:55:03,933 INFO L443 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-11-15 19:55:03,934 INFO L446 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-11-15 19:55:03,934 INFO L443 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,934 INFO L443 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,934 INFO L443 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-11-15 19:55:03,934 INFO L443 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-11-15 19:55:03,934 INFO L443 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-11-15 19:55:03,934 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-11-15 19:55:03,935 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-11-15 19:55:03,935 INFO L443 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-11-15 19:55:03,935 INFO L443 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-11-15 19:55:03,935 INFO L443 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-11-15 19:55:03,935 INFO L443 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-11-15 19:55:03,935 INFO L443 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,935 INFO L443 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,936 INFO L443 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-11-15 19:55:03,936 INFO L443 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-11-15 19:55:03,936 INFO L443 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-11-15 19:55:03,936 INFO L443 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-11-15 19:55:03,936 INFO L443 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-11-15 19:55:03,936 INFO L443 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-11-15 19:55:03,937 INFO L439 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse7 (not (= ~a28~0 11))) (.cse11 (<= ~a19~0 0)) (.cse4 (<= ~a25~0 0)) (.cse5 (not (= 1 ~a11~0)))) (let ((.cse2 (= ~a28~0 7)) (.cse8 (or (and .cse11 .cse4 .cse7) (and .cse11 .cse4 .cse5))) (.cse10 (= ~a28~0 9)) (.cse12 (<= 10 ~a28~0)) (.cse0 (= ~a17~0 8)) (.cse3 (= ~a21~0 1)) (.cse1 (= ~a19~0 1)) (.cse6 (= ~a25~0 1)) (.cse13 (<= ~a17~0 8)) (.cse9 (= ~a11~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse5 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse0 .cse1 .cse3 .cse6) (and .cse0 .cse1 .cse6 .cse7) (and .cse8 .cse9) (and .cse10 .cse11 .cse6 .cse9) (and .cse11 .cse12 .cse0 .cse6 .cse5 .cse7) (and (and .cse10 .cse1 .cse4 .cse9) .cse0) (and .cse11 .cse0 .cse2 .cse6 .cse5) (and .cse8 .cse0) (and .cse10 .cse0 .cse1 .cse3 .cse4) (and .cse12 .cse1 .cse4 .cse9 .cse13) (and .cse12 .cse0 .cse1 .cse3 .cse4 .cse7) (and .cse1 .cse6 .cse13 .cse9 .cse7)))) [2019-11-15 19:55:03,937 INFO L443 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,937 INFO L443 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,937 INFO L443 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-11-15 19:55:03,937 INFO L443 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-11-15 19:55:03,937 INFO L443 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-11-15 19:55:03,937 INFO L443 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-11-15 19:55:03,937 INFO L443 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-11-15 19:55:03,938 INFO L443 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,938 INFO L443 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,938 INFO L443 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-11-15 19:55:03,938 INFO L443 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-11-15 19:55:03,938 INFO L443 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-11-15 19:55:03,938 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-11-15 19:55:03,938 INFO L443 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-11-15 19:55:03,939 INFO L443 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-11-15 19:55:03,939 INFO L443 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-11-15 19:55:03,939 INFO L443 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-11-15 19:55:03,939 INFO L443 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-11-15 19:55:03,939 INFO L443 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,939 INFO L443 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,939 INFO L443 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-11-15 19:55:03,939 INFO L443 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,940 INFO L443 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-11-15 19:55:03,940 INFO L443 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-11-15 19:55:03,940 INFO L443 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-11-15 19:55:03,940 INFO L443 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-11-15 19:55:03,940 INFO L443 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-11-15 19:55:03,940 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 19:55:03,940 INFO L443 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-11-15 19:55:03,940 INFO L443 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,941 INFO L443 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,941 INFO L443 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,941 INFO L443 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-11-15 19:55:03,941 INFO L443 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-11-15 19:55:03,941 INFO L443 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-11-15 19:55:03,941 INFO L443 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-11-15 19:55:03,941 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-11-15 19:55:03,942 INFO L443 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,942 INFO L443 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,942 INFO L443 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,942 INFO L443 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-11-15 19:55:03,942 INFO L443 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-11-15 19:55:03,942 INFO L443 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-11-15 19:55:03,942 INFO L443 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-11-15 19:55:03,942 INFO L443 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-11-15 19:55:03,943 INFO L443 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-11-15 19:55:03,943 INFO L443 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,943 INFO L443 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,943 INFO L443 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,943 INFO L443 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-11-15 19:55:03,943 INFO L443 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-11-15 19:55:03,943 INFO L443 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-11-15 19:55:03,943 INFO L443 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-11-15 19:55:03,944 INFO L443 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-11-15 19:55:03,944 INFO L443 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-11-15 19:55:03,944 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 19:55:03,944 INFO L443 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-11-15 19:55:03,944 INFO L443 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-11-15 19:55:03,944 INFO L443 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,944 INFO L443 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,945 INFO L443 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,945 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-11-15 19:55:03,945 INFO L443 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-11-15 19:55:03,945 INFO L443 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-11-15 19:55:03,945 INFO L443 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-11-15 19:55:03,945 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-11-15 19:55:03,945 INFO L443 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,945 INFO L443 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,946 INFO L443 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-11-15 19:55:03,946 INFO L443 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-11-15 19:55:03,946 INFO L443 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-11-15 19:55:03,946 INFO L443 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-11-15 19:55:03,946 INFO L443 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-11-15 19:55:03,946 INFO L443 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-11-15 19:55:03,946 INFO L443 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-11-15 19:55:03,946 INFO L443 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-11-15 19:55:03,947 INFO L443 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-11-15 19:55:03,947 INFO L443 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-11-15 19:55:03,947 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-11-15 19:55:04,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 07:55:04 BoogieIcfgContainer [2019-11-15 19:55:04,013 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 19:55:04,013 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 19:55:04,013 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 19:55:04,014 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 19:55:04,015 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:54:52" (3/4) ... [2019-11-15 19:55:04,017 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 19:55:04,037 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-15 19:55:04,038 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-15 19:55:04,187 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0db078eb-89dd-4205-bcc1-a88763d9488b/bin/uautomizer/witness.graphml [2019-11-15 19:55:04,187 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 19:55:04,188 INFO L168 Benchmark]: Toolchain (without parser) took 13953.08 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 431.0 MB). Free memory was 939.4 MB in the beginning and 938.9 MB in the end (delta: 497.2 kB). Peak memory consumption was 431.5 MB. Max. memory is 11.5 GB. [2019-11-15 19:55:04,189 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 19:55:04,189 INFO L168 Benchmark]: CACSL2BoogieTranslator took 589.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-15 19:55:04,190 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.97 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 19:55:04,190 INFO L168 Benchmark]: Boogie Preprocessor took 88.02 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 19:55:04,190 INFO L168 Benchmark]: RCFGBuilder took 1281.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.1 MB in the end (delta: 109.2 MB). Peak memory consumption was 109.2 MB. Max. memory is 11.5 GB. [2019-11-15 19:55:04,191 INFO L168 Benchmark]: TraceAbstraction took 11744.46 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 289.9 MB). Free memory was 998.1 MB in the beginning and 965.5 MB in the end (delta: 32.6 MB). Peak memory consumption was 322.5 MB. Max. memory is 11.5 GB. [2019-11-15 19:55:04,192 INFO L168 Benchmark]: Witness Printer took 173.81 ms. Allocated memory is still 1.5 GB. Free memory was 965.5 MB in the beginning and 938.9 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. [2019-11-15 19:55:04,194 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 962.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 589.61 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 70.97 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 88.02 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1281.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 998.1 MB in the end (delta: 109.2 MB). Peak memory consumption was 109.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11744.46 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 289.9 MB). Free memory was 998.1 MB in the beginning and 965.5 MB in the end (delta: 32.6 MB). Peak memory consumption was 322.5 MB. Max. memory is 11.5 GB. * Witness Printer took 173.81 ms. Allocated memory is still 1.5 GB. Free memory was 965.5 MB in the beginning and 938.9 MB in the end (delta: 26.6 MB). Peak memory consumption was 26.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 517]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((((((((a17 == 8 && a19 == 1) && a28 == 7) && a21 == 1) && a25 <= 0) && !(1 == a11)) || (((((!(1 == a11) && !(3 == input)) && a17 == 8) && a19 == 1) && a21 == 1) && a25 == 1)) || (((a17 == 8 && a19 == 1) && a25 == 1) && !(a28 == 11))) || ((((a19 <= 0 && a25 <= 0) && !(a28 == 11)) || ((a19 <= 0 && a25 <= 0) && !(1 == a11))) && a11 == 1)) || (((a28 == 9 && a19 <= 0) && a25 == 1) && a11 == 1)) || (((((a19 <= 0 && 10 <= a28) && a17 == 8) && a25 == 1) && !(1 == a11)) && !(a28 == 11))) || ((((a28 == 9 && a19 == 1) && a25 <= 0) && a11 == 1) && a17 == 8)) || ((((a19 <= 0 && a17 == 8) && a28 == 7) && a25 == 1) && !(1 == a11))) || ((((a19 <= 0 && a25 <= 0) && !(a28 == 11)) || ((a19 <= 0 && a25 <= 0) && !(1 == a11))) && a17 == 8)) || ((((a28 == 9 && a17 == 8) && a19 == 1) && a21 == 1) && a25 <= 0)) || ((((10 <= a28 && a19 == 1) && a25 <= 0) && a11 == 1) && a17 <= 8)) || (((((10 <= a28 && a17 == 8) && a19 == 1) && a21 == 1) && a25 <= 0) && !(a28 == 11))) || ((((a19 == 1 && a25 == 1) && a17 <= 8) && a11 == 1) && !(a28 == 11)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((((((((a17 == 8 && a19 == 1) && a28 == 7) && a21 == 1) && a25 <= 0) && !(1 == a11)) || (((((!(1 == a11) && !(3 == input)) && a17 == 8) && a19 == 1) && a21 == 1) && a25 == 1)) || (((a17 == 8 && a19 == 1) && a25 == 1) && !(a28 == 11))) || ((((a19 <= 0 && a25 <= 0) && !(a28 == 11)) || ((a19 <= 0 && a25 <= 0) && !(1 == a11))) && a11 == 1)) || (((a28 == 9 && a19 <= 0) && a25 == 1) && a11 == 1)) || (((((a19 <= 0 && 10 <= a28) && a17 == 8) && a25 == 1) && !(1 == a11)) && !(a28 == 11))) || ((((a28 == 9 && a19 == 1) && a25 <= 0) && a11 == 1) && a17 == 8)) || ((((a19 <= 0 && a17 == 8) && a28 == 7) && a25 == 1) && !(1 == a11))) || ((((a19 <= 0 && a25 <= 0) && !(a28 == 11)) || ((a19 <= 0 && a25 <= 0) && !(1 == a11))) && a17 == 8)) || ((((a28 == 9 && a17 == 8) && a19 == 1) && a21 == 1) && a25 <= 0)) || ((((10 <= a28 && a19 == 1) && a25 <= 0) && a11 == 1) && a17 <= 8)) || (((((10 <= a28 && a17 == 8) && a19 == 1) && a21 == 1) && a25 <= 0) && !(a28 == 11))) || ((((a19 == 1 && a25 == 1) && a17 <= 8) && a11 == 1) && !(a28 == 11)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Result: SAFE, OverallTime: 11.6s, OverallIterations: 11, TraceHistogramMax: 5, AutomataDifference: 7.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, HoareTripleCheckerStatistics: 1298 SDtfs, 2205 SDslu, 262 SDs, 0 SdLazy, 5499 SolverSat, 885 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 520 GetRequests, 488 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2411occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 11 MinimizatonAttempts, 1029 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 42 NumberOfFragments, 495 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1078 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 482 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2393 NumberOfCodeBlocks, 2393 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2380 ConstructedInterpolants, 0 QuantifiedInterpolants, 1162816 SizeOfPredicates, 6 NumberOfNonLiveVariables, 773 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 1366/1378 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...