./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label24.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_321762e3-5898-4a72-a85d-3c6d2a7617af/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_321762e3-5898-4a72-a85d-3c6d2a7617af/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_321762e3-5898-4a72-a85d-3c6d2a7617af/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_321762e3-5898-4a72-a85d-3c6d2a7617af/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label24.c -s /tmp/vcloud-vcloud-master/worker/run_dir_321762e3-5898-4a72-a85d-3c6d2a7617af/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_321762e3-5898-4a72-a85d-3c6d2a7617af/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 c5fe2c6077c684b4b50af2f6570d6f5c736d513e ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:54:20,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:54:20,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:54:20,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:54:20,287 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:54:20,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:54:20,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:54:20,299 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:54:20,303 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:54:20,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:54:20,308 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:54:20,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:54:20,309 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:54:20,311 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:54:20,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:54:20,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:54:20,314 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:54:20,315 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:54:20,318 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:54:20,321 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:54:20,325 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:54:20,328 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:54:20,329 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:54:20,330 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:54:20,332 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:54:20,332 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:54:20,332 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:54:20,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:54:20,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:54:20,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:54:20,335 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:54:20,336 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:54:20,337 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:54:20,337 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:54:20,338 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:54:20,338 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:54:20,339 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:54:20,339 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:54:20,339 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:54:20,340 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:54:20,341 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:54:20,342 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_321762e3-5898-4a72-a85d-3c6d2a7617af/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:54:20,355 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:54:20,355 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:54:20,356 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:54:20,356 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:54:20,357 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:54:20,357 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:54:20,357 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:54:20,357 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:54:20,357 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:54:20,357 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:54:20,358 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:54:20,358 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:54:20,358 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:54:20,358 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:54:20,358 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:54:20,358 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:54:20,359 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:54:20,359 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:54:20,359 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:54:20,359 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:54:20,359 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:54:20,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:54:20,360 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:54:20,360 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:54:20,360 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:54:20,360 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:54:20,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:54:20,361 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:54:20,361 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_321762e3-5898-4a72-a85d-3c6d2a7617af/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 -> c5fe2c6077c684b4b50af2f6570d6f5c736d513e [2019-11-25 08:54:20,531 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:54:20,544 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:54:20,546 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:54:20,548 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:54:20,548 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:54:20,549 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_321762e3-5898-4a72-a85d-3c6d2a7617af/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem01_label24.c [2019-11-25 08:54:20,597 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_321762e3-5898-4a72-a85d-3c6d2a7617af/bin/uautomizer/data/20e8a0a61/8eb11e1d3ae84b32a9517a68617262d7/FLAG0ff3027c5 [2019-11-25 08:54:21,059 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:54:21,060 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_321762e3-5898-4a72-a85d-3c6d2a7617af/sv-benchmarks/c/eca-rers2012/Problem01_label24.c [2019-11-25 08:54:21,070 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_321762e3-5898-4a72-a85d-3c6d2a7617af/bin/uautomizer/data/20e8a0a61/8eb11e1d3ae84b32a9517a68617262d7/FLAG0ff3027c5 [2019-11-25 08:54:21,082 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_321762e3-5898-4a72-a85d-3c6d2a7617af/bin/uautomizer/data/20e8a0a61/8eb11e1d3ae84b32a9517a68617262d7 [2019-11-25 08:54:21,085 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:54:21,086 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:54:21,087 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:54:21,087 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:54:21,090 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:54:21,091 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:54:21" (1/1) ... [2019-11-25 08:54:21,093 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b33eedf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:21, skipping insertion in model container [2019-11-25 08:54:21,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:54:21" (1/1) ... [2019-11-25 08:54:21,100 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:54:21,139 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:54:21,626 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:54:21,633 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:54:21,743 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:54:21,759 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:54:21,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:21 WrapperNode [2019-11-25 08:54:21,760 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:54:21,760 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:54:21,760 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:54:21,761 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:54:21,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:21" (1/1) ... [2019-11-25 08:54:21,791 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:21" (1/1) ... [2019-11-25 08:54:21,848 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:54:21,848 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:54:21,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:54:21,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:54:21,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:21" (1/1) ... [2019-11-25 08:54:21,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:21" (1/1) ... [2019-11-25 08:54:21,871 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:21" (1/1) ... [2019-11-25 08:54:21,871 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:21" (1/1) ... [2019-11-25 08:54:21,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:21" (1/1) ... [2019-11-25 08:54:21,899 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:21" (1/1) ... [2019-11-25 08:54:21,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:21" (1/1) ... [2019-11-25 08:54:21,931 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:54:21,931 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:54:21,931 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:54:21,931 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:54:21,932 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_321762e3-5898-4a72-a85d-3c6d2a7617af/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-25 08:54:21,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:54:21,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:54:23,227 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:54:23,227 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:54:23,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:54:23 BoogieIcfgContainer [2019-11-25 08:54:23,228 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:54:23,229 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:54:23,229 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:54:23,232 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:54:23,232 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:54:21" (1/3) ... [2019-11-25 08:54:23,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de23c12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:54:23, skipping insertion in model container [2019-11-25 08:54:23,233 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:54:21" (2/3) ... [2019-11-25 08:54:23,233 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6de23c12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:54:23, skipping insertion in model container [2019-11-25 08:54:23,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:54:23" (3/3) ... [2019-11-25 08:54:23,235 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label24.c [2019-11-25 08:54:23,245 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:54:23,252 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:54:23,262 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:54:23,297 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:54:23,297 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:54:23,298 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:54:23,298 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:54:23,298 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:54:23,298 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:54:23,298 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:54:23,299 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:54:23,323 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-25 08:54:23,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-25 08:54:23,336 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:23,337 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 08:54:23,337 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:23,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:23,342 INFO L82 PathProgramCache]: Analyzing trace with hash -342959657, now seen corresponding path program 1 times [2019-11-25 08:54:23,351 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:23,351 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554157047] [2019-11-25 08:54:23,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:23,803 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-25 08:54:23,804 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554157047] [2019-11-25 08:54:23,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:23,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:54:23,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961510588] [2019-11-25 08:54:23,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:54:23,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:23,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:54:23,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:54:23,827 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-11-25 08:54:25,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:25,269 INFO L93 Difference]: Finished difference Result 687 states and 1203 transitions. [2019-11-25 08:54:25,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:54:25,271 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-25 08:54:25,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:25,296 INFO L225 Difference]: With dead ends: 687 [2019-11-25 08:54:25,296 INFO L226 Difference]: Without dead ends: 397 [2019-11-25 08:54:25,303 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:54:25,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-11-25 08:54:25,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2019-11-25 08:54:25,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-25 08:54:25,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-11-25 08:54:25,384 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 98 [2019-11-25 08:54:25,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:25,385 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-11-25 08:54:25,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:54:25,385 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-11-25 08:54:25,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-25 08:54:25,392 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:25,392 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:54:25,393 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:25,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:25,394 INFO L82 PathProgramCache]: Analyzing trace with hash 687887018, now seen corresponding path program 1 times [2019-11-25 08:54:25,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:25,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063899475] [2019-11-25 08:54:25,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:25,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:25,493 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:54:25,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063899475] [2019-11-25 08:54:25,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:25,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:54:25,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051162932] [2019-11-25 08:54:25,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:54:25,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:25,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:54:25,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:54:25,505 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-11-25 08:54:26,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:26,308 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2019-11-25 08:54:26,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:54:26,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-11-25 08:54:26,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:26,313 INFO L225 Difference]: With dead ends: 1054 [2019-11-25 08:54:26,314 INFO L226 Difference]: Without dead ends: 790 [2019-11-25 08:54:26,315 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:54:26,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-11-25 08:54:26,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-11-25 08:54:26,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-11-25 08:54:26,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1068 transitions. [2019-11-25 08:54:26,384 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1068 transitions. Word has length 104 [2019-11-25 08:54:26,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:26,386 INFO L462 AbstractCegarLoop]: Abstraction has 790 states and 1068 transitions. [2019-11-25 08:54:26,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:54:26,386 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1068 transitions. [2019-11-25 08:54:26,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-25 08:54:26,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:26,391 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:54:26,391 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:26,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:26,392 INFO L82 PathProgramCache]: Analyzing trace with hash 61656490, now seen corresponding path program 1 times [2019-11-25 08:54:26,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:26,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360308609] [2019-11-25 08:54:26,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:26,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:54:26,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360308609] [2019-11-25 08:54:26,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:26,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:54:26,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943267974] [2019-11-25 08:54:26,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:54:26,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:26,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:54:26,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:54:26,521 INFO L87 Difference]: Start difference. First operand 790 states and 1068 transitions. Second operand 4 states. [2019-11-25 08:54:27,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:27,358 INFO L93 Difference]: Finished difference Result 2626 states and 3534 transitions. [2019-11-25 08:54:27,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:54:27,358 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2019-11-25 08:54:27,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:27,368 INFO L225 Difference]: With dead ends: 2626 [2019-11-25 08:54:27,368 INFO L226 Difference]: Without dead ends: 1707 [2019-11-25 08:54:27,370 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:54:27,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-25 08:54:27,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1052. [2019-11-25 08:54:27,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-11-25 08:54:27,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1301 transitions. [2019-11-25 08:54:27,408 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1301 transitions. Word has length 105 [2019-11-25 08:54:27,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:27,409 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 1301 transitions. [2019-11-25 08:54:27,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:54:27,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1301 transitions. [2019-11-25 08:54:27,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-25 08:54:27,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:27,412 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:54:27,412 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:27,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:27,413 INFO L82 PathProgramCache]: Analyzing trace with hash -320878716, now seen corresponding path program 1 times [2019-11-25 08:54:27,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:27,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411511896] [2019-11-25 08:54:27,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:27,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:27,478 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-25 08:54:27,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411511896] [2019-11-25 08:54:27,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:27,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:54:27,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30638186] [2019-11-25 08:54:27,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:27,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:27,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:27,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:27,481 INFO L87 Difference]: Start difference. First operand 1052 states and 1301 transitions. Second operand 3 states. [2019-11-25 08:54:27,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:27,929 INFO L93 Difference]: Finished difference Result 2364 states and 2896 transitions. [2019-11-25 08:54:27,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:27,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-25 08:54:27,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:27,936 INFO L225 Difference]: With dead ends: 2364 [2019-11-25 08:54:27,937 INFO L226 Difference]: Without dead ends: 1183 [2019-11-25 08:54:27,939 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:27,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2019-11-25 08:54:27,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1052. [2019-11-25 08:54:27,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-11-25 08:54:27,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1263 transitions. [2019-11-25 08:54:27,968 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1263 transitions. Word has length 121 [2019-11-25 08:54:27,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:27,968 INFO L462 AbstractCegarLoop]: Abstraction has 1052 states and 1263 transitions. [2019-11-25 08:54:27,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:27,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1263 transitions. [2019-11-25 08:54:27,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-11-25 08:54:27,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:27,973 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 08:54:27,973 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:27,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:27,974 INFO L82 PathProgramCache]: Analyzing trace with hash 2118438855, now seen corresponding path program 1 times [2019-11-25 08:54:27,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:27,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251880028] [2019-11-25 08:54:27,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:28,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:28,111 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-11-25 08:54:28,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251880028] [2019-11-25 08:54:28,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:28,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:54:28,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788246018] [2019-11-25 08:54:28,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:28,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:28,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:28,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:28,112 INFO L87 Difference]: Start difference. First operand 1052 states and 1263 transitions. Second operand 3 states. [2019-11-25 08:54:28,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:28,588 INFO L93 Difference]: Finished difference Result 2626 states and 3162 transitions. [2019-11-25 08:54:28,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:28,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2019-11-25 08:54:28,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:28,597 INFO L225 Difference]: With dead ends: 2626 [2019-11-25 08:54:28,597 INFO L226 Difference]: Without dead ends: 1445 [2019-11-25 08:54:28,600 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:28,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-25 08:54:28,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1314. [2019-11-25 08:54:28,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-11-25 08:54:28,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1455 transitions. [2019-11-25 08:54:28,634 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1455 transitions. Word has length 132 [2019-11-25 08:54:28,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:28,635 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1455 transitions. [2019-11-25 08:54:28,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:28,635 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1455 transitions. [2019-11-25 08:54:28,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-11-25 08:54:28,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:28,640 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 08:54:28,641 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:28,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:28,641 INFO L82 PathProgramCache]: Analyzing trace with hash -909410889, now seen corresponding path program 1 times [2019-11-25 08:54:28,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:28,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564486619] [2019-11-25 08:54:28,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:28,699 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-25 08:54:28,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564486619] [2019-11-25 08:54:28,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:28,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:54:28,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367506325] [2019-11-25 08:54:28,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:28,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:28,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:28,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:28,702 INFO L87 Difference]: Start difference. First operand 1314 states and 1455 transitions. Second operand 3 states. [2019-11-25 08:54:29,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:29,142 INFO L93 Difference]: Finished difference Result 3281 states and 3647 transitions. [2019-11-25 08:54:29,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:29,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-11-25 08:54:29,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:29,152 INFO L225 Difference]: With dead ends: 3281 [2019-11-25 08:54:29,152 INFO L226 Difference]: Without dead ends: 1969 [2019-11-25 08:54:29,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:29,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-25 08:54:29,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707. [2019-11-25 08:54:29,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-25 08:54:29,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1884 transitions. [2019-11-25 08:54:29,192 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1884 transitions. Word has length 151 [2019-11-25 08:54:29,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:29,192 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 1884 transitions. [2019-11-25 08:54:29,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:29,192 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1884 transitions. [2019-11-25 08:54:29,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-11-25 08:54:29,196 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:29,197 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 08:54:29,197 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:29,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:29,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1082991010, now seen corresponding path program 1 times [2019-11-25 08:54:29,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:29,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427311541] [2019-11-25 08:54:29,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:29,271 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-25 08:54:29,271 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427311541] [2019-11-25 08:54:29,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:29,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:54:29,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534129444] [2019-11-25 08:54:29,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:54:29,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:29,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:54:29,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:29,282 INFO L87 Difference]: Start difference. First operand 1707 states and 1884 transitions. Second operand 3 states. [2019-11-25 08:54:29,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:29,648 INFO L93 Difference]: Finished difference Result 3674 states and 4051 transitions. [2019-11-25 08:54:29,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:29,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2019-11-25 08:54:29,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:29,657 INFO L225 Difference]: With dead ends: 3674 [2019-11-25 08:54:29,657 INFO L226 Difference]: Without dead ends: 1969 [2019-11-25 08:54:29,659 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:54:29,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-25 08:54:29,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1969. [2019-11-25 08:54:29,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-25 08:54:29,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2159 transitions. [2019-11-25 08:54:29,700 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2159 transitions. Word has length 154 [2019-11-25 08:54:29,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:29,701 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2159 transitions. [2019-11-25 08:54:29,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:54:29,701 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2159 transitions. [2019-11-25 08:54:29,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-25 08:54:29,705 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:29,706 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 08:54:29,706 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:29,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:29,706 INFO L82 PathProgramCache]: Analyzing trace with hash -162013546, now seen corresponding path program 1 times [2019-11-25 08:54:29,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:29,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152111905] [2019-11-25 08:54:29,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:29,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:29,863 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-11-25 08:54:29,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152111905] [2019-11-25 08:54:29,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:29,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:54:29,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849756101] [2019-11-25 08:54:29,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:54:29,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:29,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:54:29,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:54:29,866 INFO L87 Difference]: Start difference. First operand 1969 states and 2159 transitions. Second operand 6 states. [2019-11-25 08:54:30,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:30,867 INFO L93 Difference]: Finished difference Result 3939 states and 4332 transitions. [2019-11-25 08:54:30,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:54:30,868 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2019-11-25 08:54:30,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:30,877 INFO L225 Difference]: With dead ends: 3939 [2019-11-25 08:54:30,877 INFO L226 Difference]: Without dead ends: 2103 [2019-11-25 08:54:30,880 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:54:30,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2103 states. [2019-11-25 08:54:30,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2103 to 1969. [2019-11-25 08:54:30,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-25 08:54:30,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2145 transitions. [2019-11-25 08:54:30,919 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2145 transitions. Word has length 158 [2019-11-25 08:54:30,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:30,919 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2145 transitions. [2019-11-25 08:54:30,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:54:30,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2145 transitions. [2019-11-25 08:54:30,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2019-11-25 08:54:30,924 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:30,924 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-25 08:54:30,924 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:30,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:30,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1222057446, now seen corresponding path program 1 times [2019-11-25 08:54:30,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:30,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660257236] [2019-11-25 08:54:30,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:31,093 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-11-25 08:54:31,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660257236] [2019-11-25 08:54:31,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:31,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:54:31,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994919709] [2019-11-25 08:54:31,099 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:54:31,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:31,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:54:31,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:54:31,101 INFO L87 Difference]: Start difference. First operand 1969 states and 2145 transitions. Second operand 4 states. [2019-11-25 08:54:31,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:31,808 INFO L93 Difference]: Finished difference Result 4198 states and 4572 transitions. [2019-11-25 08:54:31,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:54:31,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2019-11-25 08:54:31,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:31,817 INFO L225 Difference]: With dead ends: 4198 [2019-11-25 08:54:31,817 INFO L226 Difference]: Without dead ends: 2100 [2019-11-25 08:54:31,820 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:54:31,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-11-25 08:54:31,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1969. [2019-11-25 08:54:31,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-25 08:54:31,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2103 transitions. [2019-11-25 08:54:31,855 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2103 transitions. Word has length 191 [2019-11-25 08:54:31,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:31,856 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2103 transitions. [2019-11-25 08:54:31,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:54:31,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2103 transitions. [2019-11-25 08:54:31,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-11-25 08:54:31,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:31,861 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 08:54:31,862 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:31,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:31,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1413978792, now seen corresponding path program 1 times [2019-11-25 08:54:31,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:31,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710082705] [2019-11-25 08:54:31,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:31,974 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-11-25 08:54:31,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710082705] [2019-11-25 08:54:31,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:31,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:54:31,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12144602] [2019-11-25 08:54:31,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:54:31,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:31,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:54:31,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:54:31,976 INFO L87 Difference]: Start difference. First operand 1969 states and 2103 transitions. Second operand 4 states. [2019-11-25 08:54:32,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:32,542 INFO L93 Difference]: Finished difference Result 3936 states and 4206 transitions. [2019-11-25 08:54:32,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:54:32,543 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2019-11-25 08:54:32,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:32,552 INFO L225 Difference]: With dead ends: 3936 [2019-11-25 08:54:32,552 INFO L226 Difference]: Without dead ends: 2100 [2019-11-25 08:54:32,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:54:32,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-11-25 08:54:32,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1969. [2019-11-25 08:54:32,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-25 08:54:32,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2102 transitions. [2019-11-25 08:54:32,593 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2102 transitions. Word has length 197 [2019-11-25 08:54:32,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:32,594 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2102 transitions. [2019-11-25 08:54:32,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:54:32,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2102 transitions. [2019-11-25 08:54:32,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-11-25 08:54:32,599 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:32,599 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 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-25 08:54:32,601 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:32,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:32,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1798112851, now seen corresponding path program 1 times [2019-11-25 08:54:32,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:32,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269520005] [2019-11-25 08:54:32,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:32,791 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-25 08:54:32,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269520005] [2019-11-25 08:54:32,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:32,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-25 08:54:32,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770234567] [2019-11-25 08:54:32,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-25 08:54:32,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:32,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-25 08:54:32,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:54:32,794 INFO L87 Difference]: Start difference. First operand 1969 states and 2102 transitions. Second operand 6 states. [2019-11-25 08:54:33,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:33,437 INFO L93 Difference]: Finished difference Result 3971 states and 4248 transitions. [2019-11-25 08:54:33,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:54:33,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 218 [2019-11-25 08:54:33,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:33,448 INFO L225 Difference]: With dead ends: 3971 [2019-11-25 08:54:33,448 INFO L226 Difference]: Without dead ends: 2135 [2019-11-25 08:54:33,451 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-25 08:54:33,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2019-11-25 08:54:33,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 1969. [2019-11-25 08:54:33,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-11-25 08:54:33,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2088 transitions. [2019-11-25 08:54:33,492 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2088 transitions. Word has length 218 [2019-11-25 08:54:33,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:33,493 INFO L462 AbstractCegarLoop]: Abstraction has 1969 states and 2088 transitions. [2019-11-25 08:54:33,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-25 08:54:33,493 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2088 transitions. [2019-11-25 08:54:33,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2019-11-25 08:54:33,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:54:33,498 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 08:54:33,499 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:54:33,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:54:33,499 INFO L82 PathProgramCache]: Analyzing trace with hash -392691734, now seen corresponding path program 1 times [2019-11-25 08:54:33,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:54:33,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051934467] [2019-11-25 08:54:33,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:54:33,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:54:33,686 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2019-11-25 08:54:33,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051934467] [2019-11-25 08:54:33,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:54:33,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-25 08:54:33,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930691604] [2019-11-25 08:54:33,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:54:33,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:54:33,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:54:33,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:54:33,688 INFO L87 Difference]: Start difference. First operand 1969 states and 2088 transitions. Second operand 4 states. [2019-11-25 08:54:34,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:54:34,166 INFO L93 Difference]: Finished difference Result 3803 states and 4039 transitions. [2019-11-25 08:54:34,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:54:34,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2019-11-25 08:54:34,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:54:34,168 INFO L225 Difference]: With dead ends: 3803 [2019-11-25 08:54:34,168 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:54:34,171 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:54:34,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:54:34,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:54:34,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:54:34,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:54:34,171 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 240 [2019-11-25 08:54:34,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:54:34,171 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:54:34,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:54:34,172 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:54:34,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:54:34,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:54:34,608 WARN L192 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-11-25 08:54:34,949 WARN L192 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-11-25 08:54:34,951 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-25 08:54:34,952 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-25 08:54:34,952 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,952 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,952 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,952 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,952 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,952 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,952 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-25 08:54:34,952 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-25 08:54:34,952 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-25 08:54:34,952 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-25 08:54:34,952 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-25 08:54:34,952 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-25 08:54:34,953 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-25 08:54:34,953 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-25 08:54:34,953 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-25 08:54:34,953 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-25 08:54:34,953 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,953 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,953 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,953 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,953 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,953 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,953 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-25 08:54:34,953 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-25 08:54:34,953 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-25 08:54:34,954 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-25 08:54:34,954 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-25 08:54:34,954 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-25 08:54:34,954 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-25 08:54:34,954 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-25 08:54:34,954 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-25 08:54:34,954 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-25 08:54:34,954 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-25 08:54:34,958 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-25 08:54:34,958 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-25 08:54:34,958 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-25 08:54:34,959 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-25 08:54:34,959 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,959 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,959 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,959 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,959 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,959 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-25 08:54:34,960 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-25 08:54:34,960 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-25 08:54:34,960 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-25 08:54:34,960 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-25 08:54:34,960 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-25 08:54:34,960 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-25 08:54:34,961 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-25 08:54:34,961 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-25 08:54:34,962 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse7 (= ~a16~0 6)) (.cse8 (not (= 15 ~a8~0)))) (let ((.cse1 (<= ~a20~0 0)) (.cse9 (= ~a16~0 5)) (.cse5 (not (= 1 ~a7~0))) (.cse3 (<= ~a17~0 0)) (.cse11 (= ~a12~0 8)) (.cse6 (= ~a20~0 1)) (.cse0 (or (and (not .cse7) .cse8) (= 13 ~a8~0))) (.cse2 (= ~a16~0 4)) (.cse4 (= ~a21~0 1)) (.cse10 (= ~a17~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse1) (and .cse2 .cse5 .cse3 .cse4 .cse6) (and .cse5 .cse4 .cse7 .cse1) (and .cse8 .cse5 .cse9) (and .cse5 .cse4 .cse6 .cse9) (and .cse5 .cse10 .cse11 .cse4 .cse1) (and .cse8 .cse4 .cse9) (and .cse4 .cse1 .cse9) (and .cse0 .cse4 .cse6) (and .cse5 .cse4 .cse6 .cse7) (and .cse0 .cse2 .cse3) (and .cse0 .cse10 .cse11 .cse6) (and .cse0 .cse7) (and .cse0 .cse2 .cse4 (not .cse10))))) [2019-11-25 08:54:34,962 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,963 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,963 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,963 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,963 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,963 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-25 08:54:34,963 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-25 08:54:34,963 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-25 08:54:34,964 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-25 08:54:34,964 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-25 08:54:34,964 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-25 08:54:34,964 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-25 08:54:34,964 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-25 08:54:34,964 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-25 08:54:34,964 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-25 08:54:34,964 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-25 08:54:34,965 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-25 08:54:34,965 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-25 08:54:34,965 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-25 08:54:34,965 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,965 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,965 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,965 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,965 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,966 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-25 08:54:34,966 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-25 08:54:34,966 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-25 08:54:34,966 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-25 08:54:34,966 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-25 08:54:34,966 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-25 08:54:34,966 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-25 08:54:34,966 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-25 08:54:34,967 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-25 08:54:34,967 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,967 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,967 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,967 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,967 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-25 08:54:34,967 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,967 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-25 08:54:34,968 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-25 08:54:34,968 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-25 08:54:34,968 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-25 08:54:34,968 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-25 08:54:34,968 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-25 08:54:34,968 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-25 08:54:34,968 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:54:34,969 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-25 08:54:34,969 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-25 08:54:34,969 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-25 08:54:34,969 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-25 08:54:34,969 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-25 08:54:34,969 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-25 08:54:34,969 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,970 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse7 (= ~a16~0 6)) (.cse8 (not (= 15 ~a8~0)))) (let ((.cse1 (<= ~a20~0 0)) (.cse9 (= ~a16~0 5)) (.cse5 (not (= 1 ~a7~0))) (.cse3 (<= ~a17~0 0)) (.cse11 (= ~a12~0 8)) (.cse6 (= ~a20~0 1)) (.cse0 (or (and (not .cse7) .cse8) (= 13 ~a8~0))) (.cse2 (= ~a16~0 4)) (.cse4 (= ~a21~0 1)) (.cse10 (= ~a17~0 1))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse1) (and .cse2 .cse5 .cse3 .cse4 .cse6) (and .cse5 .cse4 .cse7 .cse1) (and .cse8 .cse5 .cse9) (and .cse5 .cse4 .cse6 .cse9) (and .cse5 .cse10 .cse11 .cse4 .cse1) (and .cse8 .cse4 .cse9) (and .cse4 .cse1 .cse9) (and .cse0 .cse4 .cse6) (and .cse5 .cse4 .cse6 .cse7) (and .cse0 .cse2 .cse3) (and .cse0 .cse10 .cse11 .cse6) (and .cse0 .cse7) (and .cse0 .cse2 .cse4 (not .cse10))))) [2019-11-25 08:54:34,970 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,970 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,970 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,970 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,970 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-25 08:54:34,970 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-25 08:54:34,971 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-25 08:54:34,971 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-25 08:54:34,971 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-25 08:54:34,971 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-25 08:54:34,971 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-25 08:54:34,971 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-25 08:54:34,971 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,971 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,972 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,972 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,972 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,972 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-25 08:54:34,972 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:54:34,972 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-25 08:54:34,972 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-25 08:54:34,972 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-25 08:54:34,973 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-25 08:54:34,973 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-25 08:54:34,973 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-25 08:54:34,973 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-25 08:54:34,973 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-25 08:54:34,973 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-25 08:54:34,973 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-25 08:54:34,973 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-25 08:54:34,974 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,974 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,974 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,974 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,974 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-25 08:54:34,974 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,974 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,974 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-25 08:54:34,975 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-25 08:54:34,975 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:54:34,975 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-25 08:54:34,975 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-25 08:54:34,975 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-25 08:54:34,975 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-25 08:54:34,975 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-25 08:54:34,975 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-25 08:54:34,976 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-25 08:54:34,976 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-25 08:54:34,976 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-25 08:54:34,976 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-25 08:54:34,976 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,976 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,976 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,976 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,977 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,977 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-25 08:54:34,977 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,977 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-25 08:54:34,977 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-25 08:54:34,977 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-25 08:54:34,977 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-25 08:54:34,977 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-25 08:54:34,978 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-25 08:54:34,978 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-25 08:54:34,978 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-25 08:54:34,978 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-25 08:54:34,978 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-25 08:54:34,978 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-25 08:54:34,978 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-25 08:54:34,979 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 470) no Hoare annotation was computed. [2019-11-25 08:54:34,979 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-25 08:54:34,979 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-25 08:54:34,979 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-25 08:54:34,979 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,979 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,979 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,979 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,980 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,980 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-25 08:54:34,980 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-25 08:54:34,980 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-25 08:54:34,980 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-25 08:54:34,980 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-25 08:54:34,980 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-25 08:54:34,981 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-25 08:54:34,981 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-25 08:54:34,981 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-25 08:54:34,981 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-25 08:54:34,981 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-25 08:54:35,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:54:35 BoogieIcfgContainer [2019-11-25 08:54:35,023 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:54:35,023 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:54:35,023 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:54:35,024 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:54:35,024 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:54:23" (3/4) ... [2019-11-25 08:54:35,027 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:54:35,062 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-25 08:54:35,064 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:54:35,269 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_321762e3-5898-4a72-a85d-3c6d2a7617af/bin/uautomizer/witness.graphml [2019-11-25 08:54:35,269 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:54:35,271 INFO L168 Benchmark]: Toolchain (without parser) took 14184.68 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 331.9 MB). Free memory was 940.7 MB in the beginning and 864.8 MB in the end (delta: 75.8 MB). Peak memory consumption was 407.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:35,271 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:54:35,272 INFO L168 Benchmark]: CACSL2BoogieTranslator took 672.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -169.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:35,272 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.82 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:35,272 INFO L168 Benchmark]: Boogie Preprocessor took 82.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:35,273 INFO L168 Benchmark]: RCFGBuilder took 1297.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 984.9 MB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:35,273 INFO L168 Benchmark]: TraceAbstraction took 11793.63 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 198.7 MB). Free memory was 984.9 MB in the beginning and 887.4 MB in the end (delta: 97.5 MB). Peak memory consumption was 296.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:35,274 INFO L168 Benchmark]: Witness Printer took 246.09 ms. Allocated memory is still 1.4 GB. Free memory was 887.4 MB in the beginning and 864.8 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2019-11-25 08:54:35,276 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 672.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -169.6 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 87.82 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: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 82.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1297.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 984.9 MB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11793.63 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 198.7 MB). Free memory was 984.9 MB in the beginning and 887.4 MB in the end (delta: 97.5 MB). Peak memory consumption was 296.2 MB. Max. memory is 11.5 GB. * Witness Printer took 246.09 ms. Allocated memory is still 1.4 GB. Free memory was 887.4 MB in the beginning and 864.8 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 470]: 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: 30]: Loop Invariant Derived loop invariant: ((((((((((((((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a20 <= 0) || (((a16 == 4 && a17 <= 0) && a21 == 1) && a20 <= 0)) || ((((a16 == 4 && !(1 == a7)) && a17 <= 0) && a21 == 1) && a20 == 1)) || (((!(1 == a7) && a21 == 1) && a16 == 6) && a20 <= 0)) || ((!(15 == a8) && !(1 == a7)) && a16 == 5)) || (((!(1 == a7) && a21 == 1) && a20 == 1) && a16 == 5)) || ((((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1) && a20 <= 0)) || ((!(15 == a8) && a21 == 1) && a16 == 5)) || ((a21 == 1 && a20 <= 0) && a16 == 5)) || ((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a21 == 1) && a20 == 1)) || (((!(1 == a7) && a21 == 1) && a20 == 1) && a16 == 6)) || ((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a16 == 4) && a17 <= 0)) || (((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a17 == 1) && a12 == 8) && a20 == 1)) || (((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a16 == 6)) || (((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a16 == 4) && a21 == 1) && !(a17 == 1)) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a20 <= 0) || (((a16 == 4 && a17 <= 0) && a21 == 1) && a20 <= 0)) || ((((a16 == 4 && !(1 == a7)) && a17 <= 0) && a21 == 1) && a20 == 1)) || (((!(1 == a7) && a21 == 1) && a16 == 6) && a20 <= 0)) || ((!(15 == a8) && !(1 == a7)) && a16 == 5)) || (((!(1 == a7) && a21 == 1) && a20 == 1) && a16 == 5)) || ((((!(1 == a7) && a17 == 1) && a12 == 8) && a21 == 1) && a20 <= 0)) || ((!(15 == a8) && a21 == 1) && a16 == 5)) || ((a21 == 1 && a20 <= 0) && a16 == 5)) || ((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a21 == 1) && a20 == 1)) || (((!(1 == a7) && a21 == 1) && a20 == 1) && a16 == 6)) || ((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a16 == 4) && a17 <= 0)) || (((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a17 == 1) && a12 == 8) && a20 == 1)) || (((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a16 == 6)) || (((((!(a16 == 6) && !(15 == a8)) || 13 == a8) && a16 == 4) && a21 == 1) && !(a17 == 1)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 11.6s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, HoareTripleCheckerStatistics: 945 SDtfs, 2556 SDslu, 142 SDs, 0 SdLazy, 6367 SolverSat, 803 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 19 SyntacticMatches, 8 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1969occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 1872 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 46 NumberOfFragments, 489 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2761 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 323 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1869 NumberOfCodeBlocks, 1869 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1857 ConstructedInterpolants, 0 QuantifiedInterpolants, 680171 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 1309/1309 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...