./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label00.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_a7b123ae-9376-4609-8fb4-e50d06adcc57/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a7b123ae-9376-4609-8fb4-e50d06adcc57/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a7b123ae-9376-4609-8fb4-e50d06adcc57/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a7b123ae-9376-4609-8fb4-e50d06adcc57/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label00.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a7b123ae-9376-4609-8fb4-e50d06adcc57/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a7b123ae-9376-4609-8fb4-e50d06adcc57/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 785a7f7444547118219ac2dc565afc7f15fbca51 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 20:22:13,372 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 20:22:13,373 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 20:22:13,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 20:22:13,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 20:22:13,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 20:22:13,382 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 20:22:13,384 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 20:22:13,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 20:22:13,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 20:22:13,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 20:22:13,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 20:22:13,387 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 20:22:13,388 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 20:22:13,389 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 20:22:13,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 20:22:13,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 20:22:13,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 20:22:13,392 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 20:22:13,394 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 20:22:13,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 20:22:13,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 20:22:13,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 20:22:13,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 20:22:13,398 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 20:22:13,398 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 20:22:13,399 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 20:22:13,399 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 20:22:13,399 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 20:22:13,400 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 20:22:13,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 20:22:13,400 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 20:22:13,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 20:22:13,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 20:22:13,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 20:22:13,402 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 20:22:13,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 20:22:13,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 20:22:13,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 20:22:13,403 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 20:22:13,404 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 20:22:13,404 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a7b123ae-9376-4609-8fb4-e50d06adcc57/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 20:22:13,414 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 20:22:13,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 20:22:13,415 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 20:22:13,415 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 20:22:13,415 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 20:22:13,415 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 20:22:13,416 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 20:22:13,416 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 20:22:13,416 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 20:22:13,416 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 20:22:13,416 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 20:22:13,416 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 20:22:13,416 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 20:22:13,417 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 20:22:13,417 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 20:22:13,417 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 20:22:13,417 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 20:22:13,417 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 20:22:13,418 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 20:22:13,418 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 20:22:13,418 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 20:22:13,418 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 20:22:13,418 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 20:22:13,418 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 20:22:13,418 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 20:22:13,419 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 20:22:13,419 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 20:22:13,419 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 20:22:13,419 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 20:22:13,419 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 20:22:13,419 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 20:22:13,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 20:22:13,419 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 20:22:13,420 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 20:22:13,420 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 20:22:13,420 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 20:22:13,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 20:22:13,420 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 20:22:13,420 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 20:22:13,420 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 20:22:13,420 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_a7b123ae-9376-4609-8fb4-e50d06adcc57/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 -> 785a7f7444547118219ac2dc565afc7f15fbca51 [2019-12-07 20:22:13,518 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 20:22:13,526 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 20:22:13,529 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 20:22:13,529 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 20:22:13,530 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 20:22:13,530 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a7b123ae-9376-4609-8fb4-e50d06adcc57/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label00.c [2019-12-07 20:22:13,568 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a7b123ae-9376-4609-8fb4-e50d06adcc57/bin/utaipan/data/6c3abdf74/cad2803bd059409c833657275b849002/FLAG4805b97cb [2019-12-07 20:22:14,040 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 20:22:14,040 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a7b123ae-9376-4609-8fb4-e50d06adcc57/sv-benchmarks/c/eca-rers2012/Problem01_label00.c [2019-12-07 20:22:14,048 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a7b123ae-9376-4609-8fb4-e50d06adcc57/bin/utaipan/data/6c3abdf74/cad2803bd059409c833657275b849002/FLAG4805b97cb [2019-12-07 20:22:14,057 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a7b123ae-9376-4609-8fb4-e50d06adcc57/bin/utaipan/data/6c3abdf74/cad2803bd059409c833657275b849002 [2019-12-07 20:22:14,059 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 20:22:14,060 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 20:22:14,061 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 20:22:14,061 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 20:22:14,063 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 20:22:14,063 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:22:14" (1/1) ... [2019-12-07 20:22:14,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20cc73ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:22:14, skipping insertion in model container [2019-12-07 20:22:14,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 08:22:14" (1/1) ... [2019-12-07 20:22:14,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 20:22:14,100 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 20:22:14,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:22:14,338 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 20:22:14,406 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 20:22:14,416 INFO L208 MainTranslator]: Completed translation [2019-12-07 20:22:14,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:22:14 WrapperNode [2019-12-07 20:22:14,416 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 20:22:14,417 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 20:22:14,417 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 20:22:14,417 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 20:22:14,423 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:22:14" (1/1) ... [2019-12-07 20:22:14,435 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:22:14" (1/1) ... [2019-12-07 20:22:14,468 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 20:22:14,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 20:22:14,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 20:22:14,469 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 20:22:14,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:22:14" (1/1) ... [2019-12-07 20:22:14,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:22:14" (1/1) ... [2019-12-07 20:22:14,478 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:22:14" (1/1) ... [2019-12-07 20:22:14,479 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:22:14" (1/1) ... [2019-12-07 20:22:14,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:22:14" (1/1) ... [2019-12-07 20:22:14,499 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:22:14" (1/1) ... [2019-12-07 20:22:14,504 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:22:14" (1/1) ... [2019-12-07 20:22:14,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 20:22:14,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 20:22:14,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 20:22:14,510 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 20:22:14,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:22:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7b123ae-9376-4609-8fb4-e50d06adcc57/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 20:22:14,553 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 20:22:14,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 20:22:15,573 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 20:22:15,573 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 20:22:15,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:22:15 BoogieIcfgContainer [2019-12-07 20:22:15,574 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 20:22:15,575 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 20:22:15,575 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 20:22:15,577 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 20:22:15,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 08:22:14" (1/3) ... [2019-12-07 20:22:15,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f2d43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:22:15, skipping insertion in model container [2019-12-07 20:22:15,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 08:22:14" (2/3) ... [2019-12-07 20:22:15,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71f2d43d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 08:22:15, skipping insertion in model container [2019-12-07 20:22:15,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:22:15" (3/3) ... [2019-12-07 20:22:15,579 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label00.c [2019-12-07 20:22:15,586 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 20:22:15,591 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 20:22:15,598 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 20:22:15,614 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 20:22:15,614 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 20:22:15,614 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 20:22:15,614 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 20:22:15,615 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 20:22:15,615 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 20:22:15,615 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 20:22:15,615 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 20:22:15,625 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-12-07 20:22:15,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 20:22:15,631 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:22:15,631 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 20:22:15,632 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:22:15,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:22:15,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1323237596, now seen corresponding path program 1 times [2019-12-07 20:22:15,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:22:15,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157150483] [2019-12-07 20:22:15,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:22:15,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:22:15,876 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 20:22:15,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157150483] [2019-12-07 20:22:15,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:22:15,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:22:15,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528924625] [2019-12-07 20:22:15,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:22:15,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:22:15,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:22:15,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:22:15,893 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-12-07 20:22:16,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:22:16,254 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-12-07 20:22:16,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:22:16,255 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-12-07 20:22:16,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:22:16,264 INFO L225 Difference]: With dead ends: 297 [2019-12-07 20:22:16,265 INFO L226 Difference]: Without dead ends: 216 [2019-12-07 20:22:16,267 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 20:22:16,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-12-07 20:22:16,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 145. [2019-12-07 20:22:16,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-12-07 20:22:16,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 259 transitions. [2019-12-07 20:22:16,300 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 259 transitions. Word has length 71 [2019-12-07 20:22:16,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:22:16,301 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 259 transitions. [2019-12-07 20:22:16,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:22:16,301 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 259 transitions. [2019-12-07 20:22:16,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-07 20:22:16,304 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:22:16,304 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] [2019-12-07 20:22:16,304 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:22:16,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:22:16,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1048390217, now seen corresponding path program 1 times [2019-12-07 20:22:16,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:22:16,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87798470] [2019-12-07 20:22:16,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:22:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:22:16,350 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:22:16,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87798470] [2019-12-07 20:22:16,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:22:16,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:22:16,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761129232] [2019-12-07 20:22:16,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:22:16,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:22:16,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:22:16,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:22:16,353 INFO L87 Difference]: Start difference. First operand 145 states and 259 transitions. Second operand 4 states. [2019-12-07 20:22:16,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:22:16,694 INFO L93 Difference]: Finished difference Result 573 states and 1031 transitions. [2019-12-07 20:22:16,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:22:16,695 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-12-07 20:22:16,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:22:16,698 INFO L225 Difference]: With dead ends: 573 [2019-12-07 20:22:16,698 INFO L226 Difference]: Without dead ends: 429 [2019-12-07 20:22:16,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:22:16,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-12-07 20:22:16,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-12-07 20:22:16,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-12-07 20:22:16,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 707 transitions. [2019-12-07 20:22:16,722 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 707 transitions. Word has length 77 [2019-12-07 20:22:16,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:22:16,722 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 707 transitions. [2019-12-07 20:22:16,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:22:16,722 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 707 transitions. [2019-12-07 20:22:16,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 20:22:16,725 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:22:16,725 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] [2019-12-07 20:22:16,725 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:22:16,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:22:16,726 INFO L82 PathProgramCache]: Analyzing trace with hash -2123294889, now seen corresponding path program 1 times [2019-12-07 20:22:16,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:22:16,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249357790] [2019-12-07 20:22:16,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:22:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:22:16,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 20:22:16,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249357790] [2019-12-07 20:22:16,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:22:16,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:22:16,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827457102] [2019-12-07 20:22:16,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:22:16,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:22:16,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:22:16,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:22:16,791 INFO L87 Difference]: Start difference. First operand 429 states and 707 transitions. Second operand 4 states. [2019-12-07 20:22:17,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:22:17,106 INFO L93 Difference]: Finished difference Result 857 states and 1413 transitions. [2019-12-07 20:22:17,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:22:17,106 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-12-07 20:22:17,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:22:17,109 INFO L225 Difference]: With dead ends: 857 [2019-12-07 20:22:17,109 INFO L226 Difference]: Without dead ends: 429 [2019-12-07 20:22:17,111 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 20:22:17,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-12-07 20:22:17,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-12-07 20:22:17,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-12-07 20:22:17,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 633 transitions. [2019-12-07 20:22:17,126 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 633 transitions. Word has length 78 [2019-12-07 20:22:17,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:22:17,127 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 633 transitions. [2019-12-07 20:22:17,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:22:17,127 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 633 transitions. [2019-12-07 20:22:17,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 20:22:17,128 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:22:17,128 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-12-07 20:22:17,129 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:22:17,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:22:17,129 INFO L82 PathProgramCache]: Analyzing trace with hash 293127354, now seen corresponding path program 1 times [2019-12-07 20:22:17,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:22:17,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628818548] [2019-12-07 20:22:17,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:22:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:22:17,174 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 20:22:17,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628818548] [2019-12-07 20:22:17,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:22:17,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 20:22:17,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246230327] [2019-12-07 20:22:17,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:22:17,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:22:17,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:22:17,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 20:22:17,176 INFO L87 Difference]: Start difference. First operand 429 states and 633 transitions. Second operand 3 states. [2019-12-07 20:22:17,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:22:17,386 INFO L93 Difference]: Finished difference Result 1212 states and 1788 transitions. [2019-12-07 20:22:17,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:22:17,386 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-12-07 20:22:17,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:22:17,389 INFO L225 Difference]: With dead ends: 1212 [2019-12-07 20:22:17,389 INFO L226 Difference]: Without dead ends: 784 [2019-12-07 20:22:17,390 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 20:22:17,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-12-07 20:22:17,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 642. [2019-12-07 20:22:17,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-12-07 20:22:17,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 888 transitions. [2019-12-07 20:22:17,402 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 888 transitions. Word has length 89 [2019-12-07 20:22:17,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:22:17,402 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 888 transitions. [2019-12-07 20:22:17,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:22:17,402 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 888 transitions. [2019-12-07 20:22:17,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-07 20:22:17,403 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:22:17,403 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:22:17,404 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:22:17,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:22:17,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1374584242, now seen corresponding path program 1 times [2019-12-07 20:22:17,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:22:17,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717488522] [2019-12-07 20:22:17,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:22:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:22:17,456 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 20:22:17,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717488522] [2019-12-07 20:22:17,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:22:17,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:22:17,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957866625] [2019-12-07 20:22:17,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:22:17,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:22:17,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:22:17,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:22:17,458 INFO L87 Difference]: Start difference. First operand 642 states and 888 transitions. Second operand 4 states. [2019-12-07 20:22:17,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:22:17,715 INFO L93 Difference]: Finished difference Result 1374 states and 1884 transitions. [2019-12-07 20:22:17,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 20:22:17,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-07 20:22:17,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:22:17,718 INFO L225 Difference]: With dead ends: 1374 [2019-12-07 20:22:17,718 INFO L226 Difference]: Without dead ends: 733 [2019-12-07 20:22:17,719 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 20:22:17,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-12-07 20:22:17,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 713. [2019-12-07 20:22:17,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-12-07 20:22:17,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 965 transitions. [2019-12-07 20:22:17,731 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 965 transitions. Word has length 97 [2019-12-07 20:22:17,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:22:17,732 INFO L462 AbstractCegarLoop]: Abstraction has 713 states and 965 transitions. [2019-12-07 20:22:17,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:22:17,732 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 965 transitions. [2019-12-07 20:22:17,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-12-07 20:22:17,733 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:22:17,733 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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 20:22:17,733 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:22:17,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:22:17,733 INFO L82 PathProgramCache]: Analyzing trace with hash 251998854, now seen corresponding path program 1 times [2019-12-07 20:22:17,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:22:17,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333066209] [2019-12-07 20:22:17,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:22:17,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:22:17,774 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-07 20:22:17,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333066209] [2019-12-07 20:22:17,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:22:17,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 20:22:17,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824456744] [2019-12-07 20:22:17,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:22:17,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:22:17,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:22:17,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:22:17,776 INFO L87 Difference]: Start difference. First operand 713 states and 965 transitions. Second operand 4 states. [2019-12-07 20:22:18,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:22:18,163 INFO L93 Difference]: Finished difference Result 1851 states and 2529 transitions. [2019-12-07 20:22:18,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:22:18,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 101 [2019-12-07 20:22:18,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:22:18,170 INFO L225 Difference]: With dead ends: 1851 [2019-12-07 20:22:18,170 INFO L226 Difference]: Without dead ends: 1210 [2019-12-07 20:22:18,171 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 20:22:18,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2019-12-07 20:22:18,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 926. [2019-12-07 20:22:18,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-12-07 20:22:18,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1220 transitions. [2019-12-07 20:22:18,194 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1220 transitions. Word has length 101 [2019-12-07 20:22:18,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:22:18,194 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1220 transitions. [2019-12-07 20:22:18,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:22:18,194 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1220 transitions. [2019-12-07 20:22:18,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-12-07 20:22:18,196 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:22:18,196 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 20:22:18,196 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:22:18,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:22:18,196 INFO L82 PathProgramCache]: Analyzing trace with hash 526056009, now seen corresponding path program 1 times [2019-12-07 20:22:18,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:22:18,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272431765] [2019-12-07 20:22:18,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:22:18,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:22:18,305 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 20:22:18,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272431765] [2019-12-07 20:22:18,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:22:18,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 20:22:18,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490787571] [2019-12-07 20:22:18,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 20:22:18,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:22:18,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 20:22:18,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:22:18,307 INFO L87 Difference]: Start difference. First operand 926 states and 1220 transitions. Second operand 8 states. [2019-12-07 20:22:18,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:22:18,749 INFO L93 Difference]: Finished difference Result 1958 states and 2588 transitions. [2019-12-07 20:22:18,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 20:22:18,749 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 115 [2019-12-07 20:22:18,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:22:18,753 INFO L225 Difference]: With dead ends: 1958 [2019-12-07 20:22:18,753 INFO L226 Difference]: Without dead ends: 1104 [2019-12-07 20:22:18,754 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 20:22:18,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1104 states. [2019-12-07 20:22:18,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1104 to 997. [2019-12-07 20:22:18,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-12-07 20:22:18,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1291 transitions. [2019-12-07 20:22:18,771 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1291 transitions. Word has length 115 [2019-12-07 20:22:18,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:22:18,771 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1291 transitions. [2019-12-07 20:22:18,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 20:22:18,771 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1291 transitions. [2019-12-07 20:22:18,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-12-07 20:22:18,773 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:22:18,773 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:22:18,773 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:22:18,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:22:18,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1428376252, now seen corresponding path program 1 times [2019-12-07 20:22:18,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:22:18,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202041463] [2019-12-07 20:22:18,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:22:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:22:18,819 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-07 20:22:18,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202041463] [2019-12-07 20:22:18,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 20:22:18,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 20:22:18,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042224803] [2019-12-07 20:22:18,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 20:22:18,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:22:18,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 20:22:18,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 20:22:18,820 INFO L87 Difference]: Start difference. First operand 997 states and 1291 transitions. Second operand 4 states. [2019-12-07 20:22:19,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:22:19,159 INFO L93 Difference]: Finished difference Result 2561 states and 3275 transitions. [2019-12-07 20:22:19,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 20:22:19,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-12-07 20:22:19,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:22:19,165 INFO L225 Difference]: With dead ends: 2561 [2019-12-07 20:22:19,165 INFO L226 Difference]: Without dead ends: 1139 [2019-12-07 20:22:19,166 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-12-07 20:22:19,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2019-12-07 20:22:19,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 926. [2019-12-07 20:22:19,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-12-07 20:22:19,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1025 transitions. [2019-12-07 20:22:19,195 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1025 transitions. Word has length 118 [2019-12-07 20:22:19,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:22:19,195 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1025 transitions. [2019-12-07 20:22:19,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 20:22:19,195 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1025 transitions. [2019-12-07 20:22:19,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-12-07 20:22:19,197 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 20:22:19,198 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-12-07 20:22:19,198 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 20:22:19,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 20:22:19,198 INFO L82 PathProgramCache]: Analyzing trace with hash 863644729, now seen corresponding path program 1 times [2019-12-07 20:22:19,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 20:22:19,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598752637] [2019-12-07 20:22:19,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 20:22:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:22:19,295 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 97 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-12-07 20:22:19,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598752637] [2019-12-07 20:22:19,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196643066] [2019-12-07 20:22:19,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a7b123ae-9376-4609-8fb4-e50d06adcc57/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:22:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 20:22:19,371 INFO L264 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 20:22:19,380 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 20:22:19,417 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 20:22:19,417 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 20:22:19,439 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-12-07 20:22:19,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 20:22:19,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2019-12-07 20:22:19,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093820463] [2019-12-07 20:22:19,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 20:22:19,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 20:22:19,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 20:22:19,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:22:19,441 INFO L87 Difference]: Start difference. First operand 926 states and 1025 transitions. Second operand 3 states. [2019-12-07 20:22:19,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 20:22:19,614 INFO L93 Difference]: Finished difference Result 926 states and 1025 transitions. [2019-12-07 20:22:19,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 20:22:19,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-12-07 20:22:19,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 20:22:19,615 INFO L225 Difference]: With dead ends: 926 [2019-12-07 20:22:19,615 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 20:22:19,616 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 294 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-07 20:22:19,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 20:22:19,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 20:22:19,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 20:22:19,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 20:22:19,616 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 148 [2019-12-07 20:22:19,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 20:22:19,617 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 20:22:19,617 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 20:22:19,617 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 20:22:19,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 20:22:19,817 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 20:22:19,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 20:22:20,103 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 24 [2019-12-07 20:22:20,274 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 24 [2019-12-07 20:22:20,276 INFO L246 CegarLoopResult]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-12-07 20:22:20,276 INFO L246 CegarLoopResult]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-12-07 20:22:20,276 INFO L246 CegarLoopResult]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 20:22:20,276 INFO L246 CegarLoopResult]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-12-07 20:22:20,276 INFO L246 CegarLoopResult]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-12-07 20:22:20,276 INFO L246 CegarLoopResult]: For program point L500(line 500) no Hoare annotation was computed. [2019-12-07 20:22:20,276 INFO L246 CegarLoopResult]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-12-07 20:22:20,276 INFO L246 CegarLoopResult]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-12-07 20:22:20,276 INFO L246 CegarLoopResult]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-12-07 20:22:20,276 INFO L246 CegarLoopResult]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-12-07 20:22:20,277 INFO L246 CegarLoopResult]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-12-07 20:22:20,277 INFO L246 CegarLoopResult]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-12-07 20:22:20,277 INFO L246 CegarLoopResult]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-12-07 20:22:20,277 INFO L246 CegarLoopResult]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-12-07 20:22:20,277 INFO L246 CegarLoopResult]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-12-07 20:22:20,277 INFO L246 CegarLoopResult]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-12-07 20:22:20,277 INFO L246 CegarLoopResult]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-12-07 20:22:20,277 INFO L246 CegarLoopResult]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-12-07 20:22:20,277 INFO L246 CegarLoopResult]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-12-07 20:22:20,277 INFO L242 CegarLoopResult]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse2 (<= ~a21~0 0)) (.cse1 (= 13 ~a8~0)) (.cse4 (= ~a17~0 1)) (.cse3 (not (= ~a16~0 5))) (.cse0 (= ~a21~0 1))) (or (and .cse0 (not .cse1)) (and .cse2 .cse1 .cse3) (and .cse2 .cse1 .cse4) (and .cse4 .cse3 .cse0) (and (= ~a16~0 4) .cse0))) [2019-12-07 20:22:20,277 INFO L246 CegarLoopResult]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-12-07 20:22:20,277 INFO L246 CegarLoopResult]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-12-07 20:22:20,277 INFO L246 CegarLoopResult]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-12-07 20:22:20,277 INFO L246 CegarLoopResult]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-12-07 20:22:20,277 INFO L246 CegarLoopResult]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-12-07 20:22:20,278 INFO L246 CegarLoopResult]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-12-07 20:22:20,278 INFO L246 CegarLoopResult]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-12-07 20:22:20,278 INFO L246 CegarLoopResult]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-12-07 20:22:20,278 INFO L249 CegarLoopResult]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-12-07 20:22:20,278 INFO L246 CegarLoopResult]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-12-07 20:22:20,278 INFO L246 CegarLoopResult]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-12-07 20:22:20,278 INFO L246 CegarLoopResult]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-12-07 20:22:20,278 INFO L246 CegarLoopResult]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-12-07 20:22:20,278 INFO L246 CegarLoopResult]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-12-07 20:22:20,278 INFO L246 CegarLoopResult]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-12-07 20:22:20,278 INFO L246 CegarLoopResult]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-12-07 20:22:20,278 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 20:22:20,278 INFO L246 CegarLoopResult]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-12-07 20:22:20,278 INFO L246 CegarLoopResult]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-12-07 20:22:20,278 INFO L246 CegarLoopResult]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-12-07 20:22:20,278 INFO L246 CegarLoopResult]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-12-07 20:22:20,278 INFO L246 CegarLoopResult]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-12-07 20:22:20,278 INFO L246 CegarLoopResult]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-12-07 20:22:20,279 INFO L242 CegarLoopResult]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse2 (<= ~a21~0 0)) (.cse1 (= 13 ~a8~0)) (.cse4 (= ~a17~0 1)) (.cse3 (not (= ~a16~0 5))) (.cse0 (= ~a21~0 1))) (or (and .cse0 (not .cse1)) (and .cse2 .cse1 .cse3) (and .cse2 .cse1 .cse4) (and .cse4 .cse3 .cse0) (and (= ~a16~0 4) .cse0))) [2019-12-07 20:22:20,279 INFO L246 CegarLoopResult]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-12-07 20:22:20,279 INFO L246 CegarLoopResult]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-12-07 20:22:20,279 INFO L246 CegarLoopResult]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-12-07 20:22:20,279 INFO L246 CegarLoopResult]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-12-07 20:22:20,279 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 20:22:20,279 INFO L246 CegarLoopResult]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-12-07 20:22:20,279 INFO L246 CegarLoopResult]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-12-07 20:22:20,279 INFO L246 CegarLoopResult]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-12-07 20:22:20,279 INFO L246 CegarLoopResult]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-12-07 20:22:20,279 INFO L246 CegarLoopResult]: For program point L588(line 588) no Hoare annotation was computed. [2019-12-07 20:22:20,279 INFO L246 CegarLoopResult]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-12-07 20:22:20,279 INFO L246 CegarLoopResult]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-12-07 20:22:20,279 INFO L246 CegarLoopResult]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-12-07 20:22:20,279 INFO L246 CegarLoopResult]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-12-07 20:22:20,279 INFO L246 CegarLoopResult]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-12-07 20:22:20,279 INFO L246 CegarLoopResult]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-12-07 20:22:20,280 INFO L246 CegarLoopResult]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-12-07 20:22:20,280 INFO L246 CegarLoopResult]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-12-07 20:22:20,280 INFO L246 CegarLoopResult]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-12-07 20:22:20,280 INFO L246 CegarLoopResult]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-12-07 20:22:20,280 INFO L246 CegarLoopResult]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-12-07 20:22:20,280 INFO L246 CegarLoopResult]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-12-07 20:22:20,280 INFO L246 CegarLoopResult]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-12-07 20:22:20,280 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 500) no Hoare annotation was computed. [2019-12-07 20:22:20,280 INFO L246 CegarLoopResult]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-12-07 20:22:20,280 INFO L246 CegarLoopResult]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-12-07 20:22:20,280 INFO L246 CegarLoopResult]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-12-07 20:22:20,280 INFO L246 CegarLoopResult]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-12-07 20:22:20,280 INFO L246 CegarLoopResult]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-12-07 20:22:20,280 INFO L246 CegarLoopResult]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-12-07 20:22:20,280 INFO L246 CegarLoopResult]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-12-07 20:22:20,280 INFO L246 CegarLoopResult]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-12-07 20:22:20,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 08:22:20 BoogieIcfgContainer [2019-12-07 20:22:20,292 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 20:22:20,292 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 20:22:20,292 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 20:22:20,293 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 20:22:20,293 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 08:22:15" (3/4) ... [2019-12-07 20:22:20,295 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 20:22:20,309 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 99 nodes and edges [2019-12-07 20:22:20,310 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-12-07 20:22:20,311 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-12-07 20:22:20,312 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 20:22:20,405 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a7b123ae-9376-4609-8fb4-e50d06adcc57/bin/utaipan/witness.graphml [2019-12-07 20:22:20,405 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 20:22:20,406 INFO L168 Benchmark]: Toolchain (without parser) took 6345.97 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 263.2 MB). Free memory was 933.3 MB in the beginning and 890.8 MB in the end (delta: 42.5 MB). Peak memory consumption was 305.7 MB. Max. memory is 11.5 GB. [2019-12-07 20:22:20,406 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 20:22:20,407 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 933.3 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2019-12-07 20:22:20,407 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.79 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-12-07 20:22:20,407 INFO L168 Benchmark]: Boogie Preprocessor took 40.79 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-12-07 20:22:20,407 INFO L168 Benchmark]: RCFGBuilder took 1064.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 891.7 MB in the end (delta: 208.3 MB). Peak memory consumption was 208.3 MB. Max. memory is 11.5 GB. [2019-12-07 20:22:20,408 INFO L168 Benchmark]: TraceAbstraction took 4717.47 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 125.3 MB). Free memory was 891.7 MB in the beginning and 910.2 MB in the end (delta: -18.4 MB). Peak memory consumption was 106.9 MB. Max. memory is 11.5 GB. [2019-12-07 20:22:20,408 INFO L168 Benchmark]: Witness Printer took 112.65 ms. Allocated memory is still 1.3 GB. Free memory was 910.2 MB in the beginning and 890.8 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. [2019-12-07 20:22:20,409 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 355.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 933.3 MB in the beginning and 1.1 GB in the end (delta: -177.4 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.79 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 1064.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 891.7 MB in the end (delta: 208.3 MB). Peak memory consumption was 208.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4717.47 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 125.3 MB). Free memory was 891.7 MB in the beginning and 910.2 MB in the end (delta: -18.4 MB). Peak memory consumption was 106.9 MB. Max. memory is 11.5 GB. * Witness Printer took 112.65 ms. Allocated memory is still 1.3 GB. Free memory was 910.2 MB in the beginning and 890.8 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 500]: 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: ((((a21 == 1 && !(13 == a8)) || ((a21 <= 0 && 13 == a8) && !(a16 == 5))) || ((a21 <= 0 && 13 == a8) && a17 == 1)) || ((a17 == 1 && !(a16 == 5)) && a21 == 1)) || (a16 == 4 && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((a21 == 1 && !(13 == a8)) || ((a21 <= 0 && 13 == a8) && !(a16 == 5))) || ((a21 <= 0 && 13 == a8) && a17 == 1)) || ((a17 == 1 && !(a16 == 5)) && a21 == 1)) || (a16 == 4 && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 4.2s, OverallIterations: 9, TraceHistogramMax: 4, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, HoareTripleCheckerStatistics: 564 SDtfs, 1413 SDslu, 77 SDs, 0 SdLazy, 2916 SolverSat, 954 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 333 GetRequests, 304 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=997occurred 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.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 837 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 46 NumberOfFragments, 97 HoareAnnotationTreeSize, 3 FomulaSimplifications, 7026 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 2550 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1042 NumberOfCodeBlocks, 1042 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1179 ConstructedInterpolants, 0 QuantifiedInterpolants, 337062 SizeOfPredicates, 1 NumberOfNonLiveVariables, 329 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 11 InterpolantComputations, 10 PerfectInterpolantSequences, 592/619 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...