./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label31.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_076ec590-dd8b-4622-a651-335ed4aabd61/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_076ec590-dd8b-4622-a651-335ed4aabd61/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_076ec590-dd8b-4622-a651-335ed4aabd61/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_076ec590-dd8b-4622-a651-335ed4aabd61/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label31.c -s /tmp/vcloud-vcloud-master/worker/run_dir_076ec590-dd8b-4622-a651-335ed4aabd61/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_076ec590-dd8b-4622-a651-335ed4aabd61/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c11a77ae60398387f07c46b13bc2f8c57513c68 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 19:05:44,237 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 19:05:44,239 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 19:05:44,246 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 19:05:44,246 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 19:05:44,247 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 19:05:44,248 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 19:05:44,249 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 19:05:44,250 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 19:05:44,251 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 19:05:44,251 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 19:05:44,252 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 19:05:44,252 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 19:05:44,253 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 19:05:44,254 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 19:05:44,255 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 19:05:44,255 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 19:05:44,256 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 19:05:44,257 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 19:05:44,259 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 19:05:44,260 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 19:05:44,261 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 19:05:44,261 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 19:05:44,262 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 19:05:44,264 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 19:05:44,264 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 19:05:44,264 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 19:05:44,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 19:05:44,265 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 19:05:44,265 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 19:05:44,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 19:05:44,266 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 19:05:44,266 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 19:05:44,266 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 19:05:44,267 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 19:05:44,267 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 19:05:44,268 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 19:05:44,268 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 19:05:44,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 19:05:44,268 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 19:05:44,269 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 19:05:44,269 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_076ec590-dd8b-4622-a651-335ed4aabd61/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 19:05:44,279 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 19:05:44,280 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 19:05:44,280 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 19:05:44,280 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 19:05:44,280 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 19:05:44,281 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 19:05:44,281 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 19:05:44,281 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 19:05:44,281 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 19:05:44,281 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 19:05:44,281 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 19:05:44,281 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 19:05:44,281 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 19:05:44,282 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 19:05:44,282 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 19:05:44,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 19:05:44,282 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 19:05:44,282 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 19:05:44,283 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 19:05:44,283 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 19:05:44,283 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 19:05:44,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 19:05:44,283 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 19:05:44,283 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 19:05:44,283 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 19:05:44,283 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 19:05:44,283 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 19:05:44,284 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 19:05:44,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 19:05:44,284 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 19:05:44,284 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 19:05:44,284 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 19:05:44,284 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 19:05:44,284 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 19:05:44,284 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 19:05:44,285 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 19:05:44,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 19:05:44,285 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 19:05:44,285 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 19:05:44,285 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 19:05:44,285 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_076ec590-dd8b-4622-a651-335ed4aabd61/bin/utaipan 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 -> Taipan 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 -> 6c11a77ae60398387f07c46b13bc2f8c57513c68 [2019-12-07 19:05:44,383 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 19:05:44,391 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 19:05:44,393 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 19:05:44,394 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 19:05:44,394 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 19:05:44,395 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_076ec590-dd8b-4622-a651-335ed4aabd61/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label31.c [2019-12-07 19:05:44,432 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_076ec590-dd8b-4622-a651-335ed4aabd61/bin/utaipan/data/abc437bf0/73a9130e4a354c59962f4f86dbf6e8d4/FLAG0395b75ce [2019-12-07 19:05:44,818 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 19:05:44,818 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_076ec590-dd8b-4622-a651-335ed4aabd61/sv-benchmarks/c/eca-rers2012/Problem01_label31.c [2019-12-07 19:05:44,826 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_076ec590-dd8b-4622-a651-335ed4aabd61/bin/utaipan/data/abc437bf0/73a9130e4a354c59962f4f86dbf6e8d4/FLAG0395b75ce [2019-12-07 19:05:44,835 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_076ec590-dd8b-4622-a651-335ed4aabd61/bin/utaipan/data/abc437bf0/73a9130e4a354c59962f4f86dbf6e8d4 [2019-12-07 19:05:44,837 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 19:05:44,838 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 19:05:44,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 19:05:44,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 19:05:44,840 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 19:05:44,841 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:05:44" (1/1) ... [2019-12-07 19:05:44,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c51c803 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:05:44, skipping insertion in model container [2019-12-07 19:05:44,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 07:05:44" (1/1) ... [2019-12-07 19:05:44,847 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 19:05:44,878 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 19:05:45,115 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:05:45,118 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 19:05:45,168 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 19:05:45,179 INFO L208 MainTranslator]: Completed translation [2019-12-07 19:05:45,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:05:45 WrapperNode [2019-12-07 19:05:45,179 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 19:05:45,180 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 19:05:45,180 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 19:05:45,180 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 19:05:45,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:05:45" (1/1) ... [2019-12-07 19:05:45,198 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:05:45" (1/1) ... [2019-12-07 19:05:45,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 19:05:45,231 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 19:05:45,231 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 19:05:45,232 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 19:05:45,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:05:45" (1/1) ... [2019-12-07 19:05:45,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:05:45" (1/1) ... [2019-12-07 19:05:45,241 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:05:45" (1/1) ... [2019-12-07 19:05:45,241 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:05:45" (1/1) ... [2019-12-07 19:05:45,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:05:45" (1/1) ... [2019-12-07 19:05:45,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:05:45" (1/1) ... [2019-12-07 19:05:45,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:05:45" (1/1) ... [2019-12-07 19:05:45,270 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 19:05:45,270 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 19:05:45,270 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 19:05:45,270 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 19:05:45,271 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:05:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_076ec590-dd8b-4622-a651-335ed4aabd61/bin/utaipan/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-12-07 19:05:45,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 19:05:45,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 19:05:46,422 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 19:05:46,422 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 19:05:46,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:05:46 BoogieIcfgContainer [2019-12-07 19:05:46,424 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 19:05:46,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 19:05:46,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 19:05:46,428 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 19:05:46,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 07:05:44" (1/3) ... [2019-12-07 19:05:46,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388f69ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:05:46, skipping insertion in model container [2019-12-07 19:05:46,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 07:05:45" (2/3) ... [2019-12-07 19:05:46,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388f69ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 07:05:46, skipping insertion in model container [2019-12-07 19:05:46,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:05:46" (3/3) ... [2019-12-07 19:05:46,431 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label31.c [2019-12-07 19:05:46,440 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 19:05:46,447 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 19:05:46,458 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 19:05:46,478 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 19:05:46,478 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 19:05:46,478 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 19:05:46,478 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 19:05:46,478 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 19:05:46,478 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 19:05:46,479 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 19:05:46,479 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 19:05:46,490 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-12-07 19:05:46,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 19:05:46,496 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:05:46,497 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] [2019-12-07 19:05:46,497 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:05:46,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:05:46,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1323244575, now seen corresponding path program 1 times [2019-12-07 19:05:46,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:05:46,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051540744] [2019-12-07 19:05:46,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:05:46,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:05:46,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:05:46,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051540744] [2019-12-07 19:05:46,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:05:46,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:05:46,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868132847] [2019-12-07 19:05:46,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:05:46,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:05:46,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:05:46,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:05:46,761 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2019-12-07 19:05:47,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:05:47,036 INFO L93 Difference]: Finished difference Result 224 states and 428 transitions. [2019-12-07 19:05:47,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:05:47,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-07 19:05:47,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:05:47,046 INFO L225 Difference]: With dead ends: 224 [2019-12-07 19:05:47,046 INFO L226 Difference]: Without dead ends: 145 [2019-12-07 19:05:47,049 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-12-07 19:05:47,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-12-07 19:05:47,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-12-07 19:05:47,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-12-07 19:05:47,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 253 transitions. [2019-12-07 19:05:47,082 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 253 transitions. Word has length 71 [2019-12-07 19:05:47,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:05:47,082 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 253 transitions. [2019-12-07 19:05:47,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:05:47,082 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 253 transitions. [2019-12-07 19:05:47,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 19:05:47,085 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:05:47,085 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:05:47,085 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:05:47,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:05:47,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1129605657, now seen corresponding path program 1 times [2019-12-07 19:05:47,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:05:47,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534284242] [2019-12-07 19:05:47,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:05:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:05:47,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 19:05:47,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534284242] [2019-12-07 19:05:47,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:05:47,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:05:47,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374342593] [2019-12-07 19:05:47,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:05:47,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:05:47,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:05:47,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:05:47,151 INFO L87 Difference]: Start difference. First operand 145 states and 253 transitions. Second operand 3 states. [2019-12-07 19:05:47,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:05:47,364 INFO L93 Difference]: Finished difference Result 431 states and 756 transitions. [2019-12-07 19:05:47,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:05:47,364 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2019-12-07 19:05:47,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:05:47,367 INFO L225 Difference]: With dead ends: 431 [2019-12-07 19:05:47,367 INFO L226 Difference]: Without dead ends: 287 [2019-12-07 19:05:47,368 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:05:47,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-12-07 19:05:47,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2019-12-07 19:05:47,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-12-07 19:05:47,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 467 transitions. [2019-12-07 19:05:47,382 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 467 transitions. Word has length 75 [2019-12-07 19:05:47,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:05:47,382 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 467 transitions. [2019-12-07 19:05:47,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:05:47,382 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 467 transitions. [2019-12-07 19:05:47,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-07 19:05:47,384 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:05:47,384 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] [2019-12-07 19:05:47,385 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:05:47,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:05:47,385 INFO L82 PathProgramCache]: Analyzing trace with hash 2133652078, now seen corresponding path program 1 times [2019-12-07 19:05:47,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:05:47,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775666038] [2019-12-07 19:05:47,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:05:47,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:05:47,432 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 19:05:47,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775666038] [2019-12-07 19:05:47,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:05:47,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:05:47,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946204409] [2019-12-07 19:05:47,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:05:47,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:05:47,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:05:47,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:05:47,434 INFO L87 Difference]: Start difference. First operand 287 states and 467 transitions. Second operand 3 states. [2019-12-07 19:05:47,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:05:47,654 INFO L93 Difference]: Finished difference Result 715 states and 1184 transitions. [2019-12-07 19:05:47,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:05:47,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-12-07 19:05:47,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:05:47,657 INFO L225 Difference]: With dead ends: 715 [2019-12-07 19:05:47,657 INFO L226 Difference]: Without dead ends: 429 [2019-12-07 19:05:47,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-12-07 19:05:47,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-12-07 19:05:47,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 358. [2019-12-07 19:05:47,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-12-07 19:05:47,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 587 transitions. [2019-12-07 19:05:47,678 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 587 transitions. Word has length 94 [2019-12-07 19:05:47,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:05:47,679 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 587 transitions. [2019-12-07 19:05:47,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:05:47,679 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 587 transitions. [2019-12-07 19:05:47,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-07 19:05:47,682 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:05:47,682 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 19:05:47,683 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:05:47,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:05:47,683 INFO L82 PathProgramCache]: Analyzing trace with hash 233183716, now seen corresponding path program 1 times [2019-12-07 19:05:47,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:05:47,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262110119] [2019-12-07 19:05:47,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:05:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:05:47,809 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 19:05:47,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262110119] [2019-12-07 19:05:47,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:05:47,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:05:47,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28392469] [2019-12-07 19:05:47,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 19:05:47,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:05:47,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 19:05:47,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 19:05:47,812 INFO L87 Difference]: Start difference. First operand 358 states and 587 transitions. Second operand 5 states. [2019-12-07 19:05:48,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:05:48,147 INFO L93 Difference]: Finished difference Result 788 states and 1270 transitions. [2019-12-07 19:05:48,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:05:48,147 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-12-07 19:05:48,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:05:48,150 INFO L225 Difference]: With dead ends: 788 [2019-12-07 19:05:48,150 INFO L226 Difference]: Without dead ends: 431 [2019-12-07 19:05:48,151 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-12-07 19:05:48,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-12-07 19:05:48,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 429. [2019-12-07 19:05:48,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-12-07 19:05:48,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 664 transitions. [2019-12-07 19:05:48,165 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 664 transitions. Word has length 98 [2019-12-07 19:05:48,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:05:48,165 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 664 transitions. [2019-12-07 19:05:48,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 19:05:48,166 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 664 transitions. [2019-12-07 19:05:48,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-12-07 19:05:48,167 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:05:48,168 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12-07 19:05:48,168 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:05:48,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:05:48,168 INFO L82 PathProgramCache]: Analyzing trace with hash -882347860, now seen corresponding path program 1 times [2019-12-07 19:05:48,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:05:48,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536111523] [2019-12-07 19:05:48,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:05:48,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:05:48,213 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-12-07 19:05:48,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536111523] [2019-12-07 19:05:48,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:05:48,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 19:05:48,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015822207] [2019-12-07 19:05:48,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:05:48,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:05:48,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:05:48,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:05:48,215 INFO L87 Difference]: Start difference. First operand 429 states and 664 transitions. Second operand 4 states. [2019-12-07 19:05:48,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:05:48,516 INFO L93 Difference]: Finished difference Result 1070 states and 1672 transitions. [2019-12-07 19:05:48,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:05:48,517 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-12-07 19:05:48,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:05:48,521 INFO L225 Difference]: With dead ends: 1070 [2019-12-07 19:05:48,521 INFO L226 Difference]: Without dead ends: 713 [2019-12-07 19:05:48,522 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-12-07 19:05:48,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-12-07 19:05:48,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 713. [2019-12-07 19:05:48,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-12-07 19:05:48,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1020 transitions. [2019-12-07 19:05:48,541 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1020 transitions. Word has length 102 [2019-12-07 19:05:48,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:05:48,541 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 1020 transitions. [2019-12-07 19:05:48,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:05:48,541 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1020 transitions. [2019-12-07 19:05:48,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-12-07 19:05:48,543 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:05:48,543 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] [2019-12-07 19:05:48,544 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:05:48,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:05:48,544 INFO L82 PathProgramCache]: Analyzing trace with hash 501971409, now seen corresponding path program 1 times [2019-12-07 19:05:48,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:05:48,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025757087] [2019-12-07 19:05:48,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:05:48,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:05:48,579 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-12-07 19:05:48,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025757087] [2019-12-07 19:05:48,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:05:48,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 19:05:48,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481089401] [2019-12-07 19:05:48,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 19:05:48,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:05:48,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 19:05:48,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 19:05:48,580 INFO L87 Difference]: Start difference. First operand 713 states and 1020 transitions. Second operand 3 states. [2019-12-07 19:05:48,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:05:48,788 INFO L93 Difference]: Finished difference Result 1354 states and 1962 transitions. [2019-12-07 19:05:48,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 19:05:48,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-12-07 19:05:48,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:05:48,792 INFO L225 Difference]: With dead ends: 1354 [2019-12-07 19:05:48,792 INFO L226 Difference]: Without dead ends: 713 [2019-12-07 19:05:48,793 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-12-07 19:05:48,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2019-12-07 19:05:48,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 642. [2019-12-07 19:05:48,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-12-07 19:05:48,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 925 transitions. [2019-12-07 19:05:48,809 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 925 transitions. Word has length 105 [2019-12-07 19:05:48,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:05:48,809 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 925 transitions. [2019-12-07 19:05:48,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 19:05:48,809 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 925 transitions. [2019-12-07 19:05:48,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-12-07 19:05:48,811 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 19:05:48,812 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 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] [2019-12-07 19:05:48,812 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 19:05:48,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 19:05:48,812 INFO L82 PathProgramCache]: Analyzing trace with hash 37906286, now seen corresponding path program 1 times [2019-12-07 19:05:48,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 19:05:48,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441036683] [2019-12-07 19:05:48,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 19:05:48,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 19:05:48,865 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-12-07 19:05:48,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441036683] [2019-12-07 19:05:48,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 19:05:48,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 19:05:48,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361055176] [2019-12-07 19:05:48,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 19:05:48,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 19:05:48,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 19:05:48,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 19:05:48,867 INFO L87 Difference]: Start difference. First operand 642 states and 925 transitions. Second operand 4 states. [2019-12-07 19:05:49,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 19:05:49,260 INFO L93 Difference]: Finished difference Result 1920 states and 2800 transitions. [2019-12-07 19:05:49,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 19:05:49,261 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-12-07 19:05:49,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 19:05:49,261 INFO L225 Difference]: With dead ends: 1920 [2019-12-07 19:05:49,261 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 19:05:49,262 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-12-07 19:05:49,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 19:05:49,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 19:05:49,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 19:05:49,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 19:05:49,263 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 111 [2019-12-07 19:05:49,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 19:05:49,263 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 19:05:49,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 19:05:49,263 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 19:05:49,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 19:05:49,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 19:05:49,332 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-12-07 19:05:49,332 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-12-07 19:05:49,332 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-12-07 19:05:49,332 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-12-07 19:05:49,332 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-12-07 19:05:49,332 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-12-07 19:05:49,332 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-12-07 19:05:49,332 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-12-07 19:05:49,332 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-12-07 19:05:49,333 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-12-07 19:05:49,333 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-12-07 19:05:49,333 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-12-07 19:05:49,333 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-12-07 19:05:49,333 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-12-07 19:05:49,333 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-12-07 19:05:49,333 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-12-07 19:05:49,333 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-12-07 19:05:49,334 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (not (= ~a16~0 6))) (.cse1 (= ~a21~0 1))) (or (and .cse0 .cse1) (and .cse0 (= ~a17~0 1)) (= ~a20~0 1) (and (not (= 1 ~a7~0)) .cse1))) [2019-12-07 19:05:49,334 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-12-07 19:05:49,334 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-12-07 19:05:49,334 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-12-07 19:05:49,334 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-12-07 19:05:49,334 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-12-07 19:05:49,334 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-12-07 19:05:49,334 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-12-07 19:05:49,334 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-12-07 19:05:49,334 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-12-07 19:05:49,334 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-12-07 19:05:49,335 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-12-07 19:05:49,335 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-12-07 19:05:49,335 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-12-07 19:05:49,335 INFO L246 CegarLoopResult]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 19:05:49,335 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-12-07 19:05:49,335 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-12-07 19:05:49,335 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-12-07 19:05:49,335 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 19:05:49,335 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-12-07 19:05:49,335 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-12-07 19:05:49,335 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-12-07 19:05:49,336 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-12-07 19:05:49,336 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-12-07 19:05:49,336 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-12-07 19:05:49,336 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (not (= ~a16~0 6))) (.cse1 (= ~a21~0 1))) (or (and .cse0 .cse1) (and .cse0 (= ~a17~0 1)) (= ~a20~0 1) (and (not (= 1 ~a7~0)) .cse1))) [2019-12-07 19:05:49,336 INFO L246 CegarLoopResult]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 19:05:49,336 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-12-07 19:05:49,336 INFO L246 CegarLoopResult]: For program point L452(line 452) no Hoare annotation was computed. [2019-12-07 19:05:49,336 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-12-07 19:05:49,336 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-12-07 19:05:49,336 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-12-07 19:05:49,336 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 19:05:49,337 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-12-07 19:05:49,337 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-12-07 19:05:49,337 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-12-07 19:05:49,337 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-12-07 19:05:49,337 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-12-07 19:05:49,337 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-12-07 19:05:49,337 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-12-07 19:05:49,337 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-12-07 19:05:49,337 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-12-07 19:05:49,337 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-12-07 19:05:49,337 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-12-07 19:05:49,338 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-12-07 19:05:49,338 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-12-07 19:05:49,338 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-12-07 19:05:49,338 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-12-07 19:05:49,338 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-12-07 19:05:49,338 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-12-07 19:05:49,338 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-12-07 19:05:49,338 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 452) no Hoare annotation was computed. [2019-12-07 19:05:49,338 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-12-07 19:05:49,338 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-12-07 19:05:49,338 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-12-07 19:05:49,339 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-12-07 19:05:49,339 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-12-07 19:05:49,339 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-12-07 19:05:49,339 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-12-07 19:05:49,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 07:05:49 BoogieIcfgContainer [2019-12-07 19:05:49,355 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 19:05:49,356 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 19:05:49,356 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 19:05:49,356 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 19:05:49,356 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 07:05:46" (3/4) ... [2019-12-07 19:05:49,359 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 19:05:49,376 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 100 nodes and edges [2019-12-07 19:05:49,378 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-12-07 19:05:49,379 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-12-07 19:05:49,490 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_076ec590-dd8b-4622-a651-335ed4aabd61/bin/utaipan/witness.graphml [2019-12-07 19:05:49,490 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 19:05:49,492 INFO L168 Benchmark]: Toolchain (without parser) took 4653.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 942.4 MB in the beginning and 1.0 GB in the end (delta: -95.0 MB). Peak memory consumption was 69.1 MB. Max. memory is 11.5 GB. [2019-12-07 19:05:49,492 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:05:49,492 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -134.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 19:05:49,492 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.48 ms. Allocated memory is still 1.1 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-12-07 19:05:49,493 INFO L168 Benchmark]: Boogie Preprocessor took 38.58 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:05:49,493 INFO L168 Benchmark]: RCFGBuilder took 1153.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 857.4 MB in the end (delta: 208.3 MB). Peak memory consumption was 208.3 MB. Max. memory is 11.5 GB. [2019-12-07 19:05:49,493 INFO L168 Benchmark]: TraceAbstraction took 2930.38 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 857.4 MB in the beginning and 1.1 GB in the end (delta: -202.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 19:05:49,493 INFO L168 Benchmark]: Witness Printer took 134.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2019-12-07 19:05:49,495 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 341.39 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 942.4 MB in the beginning and 1.1 GB in the end (delta: -134.0 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.58 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1153.75 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 857.4 MB in the end (delta: 208.3 MB). Peak memory consumption was 208.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2930.38 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 63.4 MB). Free memory was 857.4 MB in the beginning and 1.1 GB in the end (delta: -202.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 134.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 452]: 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) && a21 == 1) || (!(a16 == 6) && a17 == 1)) || a20 == 1) || (!(1 == a7) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((!(a16 == 6) && a21 == 1) || (!(a16 == 6) && a17 == 1)) || a20 == 1) || (!(1 == a7) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 2.7s, OverallIterations: 7, TraceHistogramMax: 5, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 256 SDtfs, 705 SDslu, 40 SDs, 0 SdLazy, 1943 SolverSat, 542 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=713occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 144 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 43 NumberOfFragments, 57 HoareAnnotationTreeSize, 3 FomulaSimplifications, 767 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 14 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 656 NumberOfCodeBlocks, 656 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 649 ConstructedInterpolants, 0 QuantifiedInterpolants, 133471 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 247/247 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...