./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/psyco/psyco_security.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_544e0a7c-baf0-4684-a73a-1eb2c8a16ce5/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_544e0a7c-baf0-4684-a73a-1eb2c8a16ce5/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_544e0a7c-baf0-4684-a73a-1eb2c8a16ce5/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_544e0a7c-baf0-4684-a73a-1eb2c8a16ce5/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/psyco/psyco_security.c -s /tmp/vcloud-vcloud-master/worker/run_dir_544e0a7c-baf0-4684-a73a-1eb2c8a16ce5/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_544e0a7c-baf0-4684-a73a-1eb2c8a16ce5/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 8cc1f38a976dda42d71f86348e088e61d77f90eb ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 03:02:03,618 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 03:02:03,620 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 03:02:03,634 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 03:02:03,634 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 03:02:03,635 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 03:02:03,637 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 03:02:03,648 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 03:02:03,650 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 03:02:03,651 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 03:02:03,652 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 03:02:03,653 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 03:02:03,653 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 03:02:03,654 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 03:02:03,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 03:02:03,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 03:02:03,657 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 03:02:03,657 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 03:02:03,659 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 03:02:03,663 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 03:02:03,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 03:02:03,672 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 03:02:03,673 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 03:02:03,673 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 03:02:03,676 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 03:02:03,676 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 03:02:03,676 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 03:02:03,677 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 03:02:03,677 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 03:02:03,678 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 03:02:03,678 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 03:02:03,679 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 03:02:03,679 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 03:02:03,680 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 03:02:03,681 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 03:02:03,681 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 03:02:03,681 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 03:02:03,682 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 03:02:03,682 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 03:02:03,682 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 03:02:03,683 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 03:02:03,684 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_544e0a7c-baf0-4684-a73a-1eb2c8a16ce5/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 03:02:03,696 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 03:02:03,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 03:02:03,697 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 03:02:03,697 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 03:02:03,697 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 03:02:03,697 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 03:02:03,697 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 03:02:03,698 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 03:02:03,698 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 03:02:03,698 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 03:02:03,698 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 03:02:03,698 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 03:02:03,699 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 03:02:03,699 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 03:02:03,699 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 03:02:03,699 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 03:02:03,700 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 03:02:03,700 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 03:02:03,700 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 03:02:03,700 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 03:02:03,700 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 03:02:03,701 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 03:02:03,701 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 03:02:03,701 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 03:02:03,701 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 03:02:03,701 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 03:02:03,701 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 03:02:03,702 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 03:02:03,702 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 03:02:03,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 03:02:03,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 03:02:03,702 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 03:02:03,703 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 03:02:03,703 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 03:02:03,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 03:02:03,703 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 03:02:03,703 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 03:02:03,704 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_544e0a7c-baf0-4684-a73a-1eb2c8a16ce5/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 -> 8cc1f38a976dda42d71f86348e088e61d77f90eb [2019-11-26 03:02:03,829 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 03:02:03,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 03:02:03,845 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 03:02:03,846 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 03:02:03,846 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 03:02:03,847 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_544e0a7c-baf0-4684-a73a-1eb2c8a16ce5/bin/utaipan/../../sv-benchmarks/c/psyco/psyco_security.c [2019-11-26 03:02:03,898 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_544e0a7c-baf0-4684-a73a-1eb2c8a16ce5/bin/utaipan/data/03e339257/8dc77b3be7c04e98a6e8a93ccbc3e1d9/FLAGbd324260e [2019-11-26 03:02:04,291 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 03:02:04,294 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_544e0a7c-baf0-4684-a73a-1eb2c8a16ce5/sv-benchmarks/c/psyco/psyco_security.c [2019-11-26 03:02:04,307 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_544e0a7c-baf0-4684-a73a-1eb2c8a16ce5/bin/utaipan/data/03e339257/8dc77b3be7c04e98a6e8a93ccbc3e1d9/FLAGbd324260e [2019-11-26 03:02:04,321 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_544e0a7c-baf0-4684-a73a-1eb2c8a16ce5/bin/utaipan/data/03e339257/8dc77b3be7c04e98a6e8a93ccbc3e1d9 [2019-11-26 03:02:04,324 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 03:02:04,327 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 03:02:04,330 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 03:02:04,331 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 03:02:04,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 03:02:04,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 03:02:04" (1/1) ... [2019-11-26 03:02:04,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2632a810 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:02:04, skipping insertion in model container [2019-11-26 03:02:04,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 03:02:04" (1/1) ... [2019-11-26 03:02:04,346 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 03:02:04,380 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 03:02:04,604 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 03:02:04,608 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 03:02:04,642 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 03:02:04,653 INFO L205 MainTranslator]: Completed translation [2019-11-26 03:02:04,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:02:04 WrapperNode [2019-11-26 03:02:04,653 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 03:02:04,654 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 03:02:04,654 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 03:02:04,654 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 03:02:04,662 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:02:04" (1/1) ... [2019-11-26 03:02:04,668 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:02:04" (1/1) ... [2019-11-26 03:02:04,694 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 03:02:04,695 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 03:02:04,695 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 03:02:04,695 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 03:02:04,704 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:02:04" (1/1) ... [2019-11-26 03:02:04,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:02:04" (1/1) ... [2019-11-26 03:02:04,707 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:02:04" (1/1) ... [2019-11-26 03:02:04,707 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:02:04" (1/1) ... [2019-11-26 03:02:04,712 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:02:04" (1/1) ... [2019-11-26 03:02:04,720 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:02:04" (1/1) ... [2019-11-26 03:02:04,722 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:02:04" (1/1) ... [2019-11-26 03:02:04,724 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 03:02:04,725 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 03:02:04,725 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 03:02:04,725 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 03:02:04,726 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:02:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_544e0a7c-baf0-4684-a73a-1eb2c8a16ce5/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-11-26 03:02:04,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 03:02:04,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 03:02:05,314 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 03:02:05,314 INFO L284 CfgBuilder]: Removed 22 assume(true) statements. [2019-11-26 03:02:05,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 03:02:05 BoogieIcfgContainer [2019-11-26 03:02:05,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 03:02:05,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 03:02:05,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 03:02:05,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 03:02:05,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 03:02:04" (1/3) ... [2019-11-26 03:02:05,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280ac879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 03:02:05, skipping insertion in model container [2019-11-26 03:02:05,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 03:02:04" (2/3) ... [2019-11-26 03:02:05,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280ac879 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 03:02:05, skipping insertion in model container [2019-11-26 03:02:05,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 03:02:05" (3/3) ... [2019-11-26 03:02:05,322 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_security.c [2019-11-26 03:02:05,332 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 03:02:05,337 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 03:02:05,343 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 03:02:05,362 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 03:02:05,362 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 03:02:05,362 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 03:02:05,362 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 03:02:05,363 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 03:02:05,363 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 03:02:05,363 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 03:02:05,363 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 03:02:05,377 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-26 03:02:05,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-26 03:02:05,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:02:05,383 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:02:05,383 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:02:05,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:02:05,388 INFO L82 PathProgramCache]: Analyzing trace with hash 269823665, now seen corresponding path program 1 times [2019-11-26 03:02:05,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:02:05,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867362329] [2019-11-26 03:02:05,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:02:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:02:05,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:02:05,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867362329] [2019-11-26 03:02:05,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:02:05,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 03:02:05,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552280134] [2019-11-26 03:02:05,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-26 03:02:05,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:02:05,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-26 03:02:05,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-26 03:02:05,503 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 2 states. [2019-11-26 03:02:05,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:02:05,524 INFO L93 Difference]: Finished difference Result 151 states and 289 transitions. [2019-11-26 03:02:05,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-26 03:02:05,525 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-26 03:02:05,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:02:05,535 INFO L225 Difference]: With dead ends: 151 [2019-11-26 03:02:05,536 INFO L226 Difference]: Without dead ends: 73 [2019-11-26 03:02:05,539 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-26 03:02:05,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-26 03:02:05,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2019-11-26 03:02:05,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2019-11-26 03:02:05,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 108 transitions. [2019-11-26 03:02:05,570 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 108 transitions. Word has length 8 [2019-11-26 03:02:05,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:02:05,571 INFO L462 AbstractCegarLoop]: Abstraction has 73 states and 108 transitions. [2019-11-26 03:02:05,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-26 03:02:05,571 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 108 transitions. [2019-11-26 03:02:05,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 03:02:05,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:02:05,572 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:02:05,572 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:02:05,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:02:05,573 INFO L82 PathProgramCache]: Analyzing trace with hash 307090919, now seen corresponding path program 1 times [2019-11-26 03:02:05,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:02:05,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652169978] [2019-11-26 03:02:05,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:02:05,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:02:05,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:02:05,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652169978] [2019-11-26 03:02:05,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:02:05,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 03:02:05,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891394987] [2019-11-26 03:02:05,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 03:02:05,605 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:02:05,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 03:02:05,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:02:05,606 INFO L87 Difference]: Start difference. First operand 73 states and 108 transitions. Second operand 3 states. [2019-11-26 03:02:05,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:02:05,721 INFO L93 Difference]: Finished difference Result 148 states and 219 transitions. [2019-11-26 03:02:05,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 03:02:05,722 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-26 03:02:05,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:02:05,723 INFO L225 Difference]: With dead ends: 148 [2019-11-26 03:02:05,723 INFO L226 Difference]: Without dead ends: 76 [2019-11-26 03:02:05,724 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:02:05,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-26 03:02:05,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-11-26 03:02:05,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-26 03:02:05,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 111 transitions. [2019-11-26 03:02:05,733 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 111 transitions. Word has length 9 [2019-11-26 03:02:05,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:02:05,733 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 111 transitions. [2019-11-26 03:02:05,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 03:02:05,734 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 111 transitions. [2019-11-26 03:02:05,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-26 03:02:05,735 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:02:05,735 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:02:05,735 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:02:05,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:02:05,735 INFO L82 PathProgramCache]: Analyzing trace with hash -1213654828, now seen corresponding path program 1 times [2019-11-26 03:02:05,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:02:05,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308842775] [2019-11-26 03:02:05,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:02:05,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:02:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:02:05,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308842775] [2019-11-26 03:02:05,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:02:05,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 03:02:05,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177690816] [2019-11-26 03:02:05,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 03:02:05,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:02:05,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 03:02:05,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:02:05,782 INFO L87 Difference]: Start difference. First operand 76 states and 111 transitions. Second operand 3 states. [2019-11-26 03:02:05,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:02:05,850 INFO L93 Difference]: Finished difference Result 141 states and 208 transitions. [2019-11-26 03:02:05,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 03:02:05,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-26 03:02:05,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:02:05,854 INFO L225 Difference]: With dead ends: 141 [2019-11-26 03:02:05,854 INFO L226 Difference]: Without dead ends: 67 [2019-11-26 03:02:05,855 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-11-26 03:02:05,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-26 03:02:05,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-11-26 03:02:05,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-26 03:02:05,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 97 transitions. [2019-11-26 03:02:05,867 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 97 transitions. Word has length 14 [2019-11-26 03:02:05,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:02:05,868 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 97 transitions. [2019-11-26 03:02:05,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 03:02:05,868 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 97 transitions. [2019-11-26 03:02:05,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 03:02:05,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:02:05,869 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:02:05,870 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:02:05,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:02:05,870 INFO L82 PathProgramCache]: Analyzing trace with hash -107735230, now seen corresponding path program 1 times [2019-11-26 03:02:05,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:02:05,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579544781] [2019-11-26 03:02:05,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:02:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:02:05,927 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:02:05,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579544781] [2019-11-26 03:02:05,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:02:05,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 03:02:05,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249790604] [2019-11-26 03:02:05,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 03:02:05,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:02:05,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 03:02:05,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:02:05,929 INFO L87 Difference]: Start difference. First operand 67 states and 97 transitions. Second operand 3 states. [2019-11-26 03:02:06,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:02:06,045 INFO L93 Difference]: Finished difference Result 187 states and 275 transitions. [2019-11-26 03:02:06,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 03:02:06,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-26 03:02:06,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:02:06,048 INFO L225 Difference]: With dead ends: 187 [2019-11-26 03:02:06,048 INFO L226 Difference]: Without dead ends: 117 [2019-11-26 03:02:06,048 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-11-26 03:02:06,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-26 03:02:06,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 103. [2019-11-26 03:02:06,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-26 03:02:06,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 148 transitions. [2019-11-26 03:02:06,058 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 148 transitions. Word has length 17 [2019-11-26 03:02:06,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:02:06,058 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 148 transitions. [2019-11-26 03:02:06,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 03:02:06,059 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 148 transitions. [2019-11-26 03:02:06,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-26 03:02:06,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:02:06,060 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:02:06,060 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:02:06,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:02:06,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1608845842, now seen corresponding path program 1 times [2019-11-26 03:02:06,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:02:06,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350666360] [2019-11-26 03:02:06,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:02:06,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:02:06,081 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 03:02:06,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350666360] [2019-11-26 03:02:06,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:02:06,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 03:02:06,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193426703] [2019-11-26 03:02:06,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 03:02:06,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:02:06,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 03:02:06,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:02:06,083 INFO L87 Difference]: Start difference. First operand 103 states and 148 transitions. Second operand 3 states. [2019-11-26 03:02:06,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:02:06,124 INFO L93 Difference]: Finished difference Result 178 states and 255 transitions. [2019-11-26 03:02:06,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 03:02:06,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-26 03:02:06,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:02:06,125 INFO L225 Difference]: With dead ends: 178 [2019-11-26 03:02:06,126 INFO L226 Difference]: Without dead ends: 82 [2019-11-26 03:02:06,126 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-11-26 03:02:06,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2019-11-26 03:02:06,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2019-11-26 03:02:06,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-26 03:02:06,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 112 transitions. [2019-11-26 03:02:06,133 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 112 transitions. Word has length 18 [2019-11-26 03:02:06,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:02:06,134 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 112 transitions. [2019-11-26 03:02:06,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 03:02:06,134 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 112 transitions. [2019-11-26 03:02:06,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-26 03:02:06,135 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:02:06,135 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:02:06,135 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:02:06,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:02:06,136 INFO L82 PathProgramCache]: Analyzing trace with hash 364792225, now seen corresponding path program 1 times [2019-11-26 03:02:06,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:02:06,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638849848] [2019-11-26 03:02:06,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:02:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:02:06,180 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 03:02:06,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638849848] [2019-11-26 03:02:06,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:02:06,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 03:02:06,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879365889] [2019-11-26 03:02:06,181 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 03:02:06,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:02:06,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 03:02:06,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:02:06,182 INFO L87 Difference]: Start difference. First operand 80 states and 112 transitions. Second operand 3 states. [2019-11-26 03:02:06,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:02:06,223 INFO L93 Difference]: Finished difference Result 129 states and 185 transitions. [2019-11-26 03:02:06,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 03:02:06,224 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-26 03:02:06,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:02:06,224 INFO L225 Difference]: With dead ends: 129 [2019-11-26 03:02:06,225 INFO L226 Difference]: Without dead ends: 65 [2019-11-26 03:02:06,225 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-11-26 03:02:06,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-26 03:02:06,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-11-26 03:02:06,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-26 03:02:06,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 91 transitions. [2019-11-26 03:02:06,231 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 91 transitions. Word has length 24 [2019-11-26 03:02:06,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:02:06,231 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 91 transitions. [2019-11-26 03:02:06,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 03:02:06,231 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 91 transitions. [2019-11-26 03:02:06,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-26 03:02:06,232 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:02:06,233 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:02:06,233 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:02:06,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:02:06,233 INFO L82 PathProgramCache]: Analyzing trace with hash -922672237, now seen corresponding path program 1 times [2019-11-26 03:02:06,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:02:06,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475606616] [2019-11-26 03:02:06,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:02:06,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:02:06,260 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 03:02:06,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475606616] [2019-11-26 03:02:06,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:02:06,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 03:02:06,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543294455] [2019-11-26 03:02:06,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 03:02:06,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:02:06,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 03:02:06,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:02:06,262 INFO L87 Difference]: Start difference. First operand 65 states and 91 transitions. Second operand 3 states. [2019-11-26 03:02:06,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:02:06,331 INFO L93 Difference]: Finished difference Result 153 states and 223 transitions. [2019-11-26 03:02:06,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 03:02:06,331 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-26 03:02:06,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:02:06,332 INFO L225 Difference]: With dead ends: 153 [2019-11-26 03:02:06,333 INFO L226 Difference]: Without dead ends: 106 [2019-11-26 03:02:06,333 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-11-26 03:02:06,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-26 03:02:06,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2019-11-26 03:02:06,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-26 03:02:06,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 133 transitions. [2019-11-26 03:02:06,341 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 133 transitions. Word has length 25 [2019-11-26 03:02:06,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:02:06,341 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 133 transitions. [2019-11-26 03:02:06,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 03:02:06,341 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 133 transitions. [2019-11-26 03:02:06,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-26 03:02:06,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:02:06,342 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:02:06,343 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:02:06,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:02:06,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1682202286, now seen corresponding path program 1 times [2019-11-26 03:02:06,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:02:06,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065545912] [2019-11-26 03:02:06,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:02:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:02:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 03:02:06,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065545912] [2019-11-26 03:02:06,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:02:06,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 03:02:06,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160216473] [2019-11-26 03:02:06,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 03:02:06,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:02:06,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 03:02:06,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:02:06,368 INFO L87 Difference]: Start difference. First operand 94 states and 133 transitions. Second operand 3 states. [2019-11-26 03:02:06,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:02:06,416 INFO L93 Difference]: Finished difference Result 161 states and 227 transitions. [2019-11-26 03:02:06,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 03:02:06,417 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-26 03:02:06,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:02:06,418 INFO L225 Difference]: With dead ends: 161 [2019-11-26 03:02:06,418 INFO L226 Difference]: Without dead ends: 87 [2019-11-26 03:02:06,419 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-11-26 03:02:06,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2019-11-26 03:02:06,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2019-11-26 03:02:06,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2019-11-26 03:02:06,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 115 transitions. [2019-11-26 03:02:06,425 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 115 transitions. Word has length 26 [2019-11-26 03:02:06,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:02:06,430 INFO L462 AbstractCegarLoop]: Abstraction has 87 states and 115 transitions. [2019-11-26 03:02:06,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 03:02:06,430 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 115 transitions. [2019-11-26 03:02:06,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-26 03:02:06,433 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:02:06,433 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:02:06,433 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:02:06,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:02:06,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1545848131, now seen corresponding path program 1 times [2019-11-26 03:02:06,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:02:06,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429604372] [2019-11-26 03:02:06,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:02:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:02:06,474 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 03:02:06,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429604372] [2019-11-26 03:02:06,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:02:06,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 03:02:06,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011504829] [2019-11-26 03:02:06,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 03:02:06,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:02:06,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 03:02:06,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:02:06,476 INFO L87 Difference]: Start difference. First operand 87 states and 115 transitions. Second operand 3 states. [2019-11-26 03:02:06,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:02:06,516 INFO L93 Difference]: Finished difference Result 134 states and 179 transitions. [2019-11-26 03:02:06,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 03:02:06,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-26 03:02:06,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:02:06,518 INFO L225 Difference]: With dead ends: 134 [2019-11-26 03:02:06,518 INFO L226 Difference]: Without dead ends: 67 [2019-11-26 03:02:06,519 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-11-26 03:02:06,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-26 03:02:06,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2019-11-26 03:02:06,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-26 03:02:06,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 86 transitions. [2019-11-26 03:02:06,523 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 86 transitions. Word has length 26 [2019-11-26 03:02:06,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:02:06,524 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 86 transitions. [2019-11-26 03:02:06,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 03:02:06,524 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 86 transitions. [2019-11-26 03:02:06,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-26 03:02:06,525 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:02:06,525 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:02:06,525 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:02:06,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:02:06,526 INFO L82 PathProgramCache]: Analyzing trace with hash 678524126, now seen corresponding path program 1 times [2019-11-26 03:02:06,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:02:06,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190342907] [2019-11-26 03:02:06,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:02:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:02:06,588 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 03:02:06,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190342907] [2019-11-26 03:02:06,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:02:06,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 03:02:06,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29965808] [2019-11-26 03:02:06,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 03:02:06,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:02:06,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 03:02:06,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:02:06,590 INFO L87 Difference]: Start difference. First operand 67 states and 86 transitions. Second operand 3 states. [2019-11-26 03:02:06,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:02:06,633 INFO L93 Difference]: Finished difference Result 69 states and 87 transitions. [2019-11-26 03:02:06,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 03:02:06,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-26 03:02:06,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:02:06,634 INFO L225 Difference]: With dead ends: 69 [2019-11-26 03:02:06,635 INFO L226 Difference]: Without dead ends: 65 [2019-11-26 03:02:06,635 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-11-26 03:02:06,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-26 03:02:06,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2019-11-26 03:02:06,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-26 03:02:06,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2019-11-26 03:02:06,639 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 27 [2019-11-26 03:02:06,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:02:06,639 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2019-11-26 03:02:06,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 03:02:06,640 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2019-11-26 03:02:06,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-26 03:02:06,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 03:02:06,640 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 03:02:06,641 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 03:02:06,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 03:02:06,641 INFO L82 PathProgramCache]: Analyzing trace with hash -429138385, now seen corresponding path program 1 times [2019-11-26 03:02:06,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 03:02:06,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282651090] [2019-11-26 03:02:06,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 03:02:06,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 03:02:06,681 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 03:02:06,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282651090] [2019-11-26 03:02:06,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 03:02:06,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 03:02:06,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824905899] [2019-11-26 03:02:06,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 03:02:06,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 03:02:06,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 03:02:06,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 03:02:06,683 INFO L87 Difference]: Start difference. First operand 65 states and 83 transitions. Second operand 3 states. [2019-11-26 03:02:06,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 03:02:06,711 INFO L93 Difference]: Finished difference Result 106 states and 138 transitions. [2019-11-26 03:02:06,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 03:02:06,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-26 03:02:06,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 03:02:06,712 INFO L225 Difference]: With dead ends: 106 [2019-11-26 03:02:06,712 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 03:02:06,713 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-11-26 03:02:06,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 03:02:06,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 03:02:06,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 03:02:06,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 03:02:06,714 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2019-11-26 03:02:06,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 03:02:06,714 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 03:02:06,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 03:02:06,714 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 03:02:06,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 03:02:06,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 03:02:06,831 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 331) no Hoare annotation was computed. [2019-11-26 03:02:06,831 INFO L444 ceAbstractionStarter]: For program point L283(lines 283 382) no Hoare annotation was computed. [2019-11-26 03:02:06,831 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 261) no Hoare annotation was computed. [2019-11-26 03:02:06,831 INFO L444 ceAbstractionStarter]: For program point L184(lines 184 199) no Hoare annotation was computed. [2019-11-26 03:02:06,831 INFO L444 ceAbstractionStarter]: For program point L118(lines 118 129) no Hoare annotation was computed. [2019-11-26 03:02:06,831 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 377) no Hoare annotation was computed. [2019-11-26 03:02:06,831 INFO L444 ceAbstractionStarter]: For program point L300(lines 300 315) no Hoare annotation was computed. [2019-11-26 03:02:06,832 INFO L444 ceAbstractionStarter]: For program point L234(lines 234 245) no Hoare annotation was computed. [2019-11-26 03:02:06,832 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 113) no Hoare annotation was computed. [2019-11-26 03:02:06,832 INFO L444 ceAbstractionStarter]: For program point L350(lines 350 361) no Hoare annotation was computed. [2019-11-26 03:02:06,832 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 03:02:06,832 INFO L444 ceAbstractionStarter]: For program point L284(lines 284 299) no Hoare annotation was computed. [2019-11-26 03:02:06,832 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 229) no Hoare annotation was computed. [2019-11-26 03:02:06,832 INFO L444 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2019-11-26 03:02:06,832 INFO L444 ceAbstractionStarter]: For program point L334(lines 334 345) no Hoare annotation was computed. [2019-11-26 03:02:06,832 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 213) no Hoare annotation was computed. [2019-11-26 03:02:06,833 INFO L444 ceAbstractionStarter]: For program point L70(lines 70 72) no Hoare annotation was computed. [2019-11-26 03:02:06,833 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 329) no Hoare annotation was computed. [2019-11-26 03:02:06,833 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 197) no Hoare annotation was computed. [2019-11-26 03:02:06,833 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 56) no Hoare annotation was computed. [2019-11-26 03:02:06,833 INFO L444 ceAbstractionStarter]: For program point L302(lines 302 313) no Hoare annotation was computed. [2019-11-26 03:02:06,833 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 172) no Hoare annotation was computed. [2019-11-26 03:02:06,833 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 297) no Hoare annotation was computed. [2019-11-26 03:02:06,833 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 156) no Hoare annotation was computed. [2019-11-26 03:02:06,834 INFO L440 ceAbstractionStarter]: At program point L22-2(lines 22 385) the Hoare annotation is: (or (and (<= 4 ULTIMATE.start_main_~q~0) (= 3 ULTIMATE.start_main_~this_state~0)) (and (<= ULTIMATE.start_main_~this_state~0 0) (= ULTIMATE.start_main_~q~0 0))) [2019-11-26 03:02:06,834 INFO L444 ceAbstractionStarter]: For program point L22-3(lines 22 385) no Hoare annotation was computed. [2019-11-26 03:02:06,834 INFO L444 ceAbstractionStarter]: For program point L270(lines 270 272) no Hoare annotation was computed. [2019-11-26 03:02:06,834 INFO L444 ceAbstractionStarter]: For program point L138(lines 138 140) no Hoare annotation was computed. [2019-11-26 03:02:06,834 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 256) no Hoare annotation was computed. [2019-11-26 03:02:06,834 INFO L444 ceAbstractionStarter]: For program point L122(lines 122 124) no Hoare annotation was computed. [2019-11-26 03:02:06,834 INFO L444 ceAbstractionStarter]: For program point L370(lines 370 372) no Hoare annotation was computed. [2019-11-26 03:02:06,834 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 240) no Hoare annotation was computed. [2019-11-26 03:02:06,834 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 108) no Hoare annotation was computed. [2019-11-26 03:02:06,835 INFO L444 ceAbstractionStarter]: For program point L354(lines 354 356) no Hoare annotation was computed. [2019-11-26 03:02:06,835 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 224) no Hoare annotation was computed. [2019-11-26 03:02:06,835 INFO L440 ceAbstractionStarter]: At program point L371(lines 13 390) the Hoare annotation is: false [2019-11-26 03:02:06,835 INFO L444 ceAbstractionStarter]: For program point L338(lines 338 340) no Hoare annotation was computed. [2019-11-26 03:02:06,835 INFO L444 ceAbstractionStarter]: For program point L206(lines 206 208) no Hoare annotation was computed. [2019-11-26 03:02:06,835 INFO L444 ceAbstractionStarter]: For program point L322(lines 322 324) no Hoare annotation was computed. [2019-11-26 03:02:06,835 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 03:02:06,835 INFO L444 ceAbstractionStarter]: For program point L190(lines 190 192) no Hoare annotation was computed. [2019-11-26 03:02:06,835 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 308) no Hoare annotation was computed. [2019-11-26 03:02:06,835 INFO L444 ceAbstractionStarter]: For program point L290(lines 290 292) no Hoare annotation was computed. [2019-11-26 03:02:06,835 INFO L444 ceAbstractionStarter]: For program point L27(lines 27 46) no Hoare annotation was computed. [2019-11-26 03:02:06,835 INFO L444 ceAbstractionStarter]: For program point L28(lines 28 43) no Hoare annotation was computed. [2019-11-26 03:02:06,836 INFO L447 ceAbstractionStarter]: At program point L13(lines 13 390) the Hoare annotation is: true [2019-11-26 03:02:06,836 INFO L444 ceAbstractionStarter]: For program point L30(lines 30 41) no Hoare annotation was computed. [2019-11-26 03:02:06,836 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 95) no Hoare annotation was computed. [2019-11-26 03:02:06,836 INFO L444 ceAbstractionStarter]: For program point L47(lines 47 98) no Hoare annotation was computed. [2019-11-26 03:02:06,836 INFO L444 ceAbstractionStarter]: For program point L64(lines 64 79) no Hoare annotation was computed. [2019-11-26 03:02:06,836 INFO L444 ceAbstractionStarter]: For program point L48(lines 48 63) no Hoare annotation was computed. [2019-11-26 03:02:06,836 INFO L444 ceAbstractionStarter]: For program point L164(lines 164 179) no Hoare annotation was computed. [2019-11-26 03:02:06,836 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 389) no Hoare annotation was computed. [2019-11-26 03:02:06,836 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 163) no Hoare annotation was computed. [2019-11-26 03:02:06,837 INFO L444 ceAbstractionStarter]: For program point L82(lines 82 93) no Hoare annotation was computed. [2019-11-26 03:02:06,837 INFO L444 ceAbstractionStarter]: For program point L264(lines 264 279) no Hoare annotation was computed. [2019-11-26 03:02:06,837 INFO L444 ceAbstractionStarter]: For program point L132(lines 132 147) no Hoare annotation was computed. [2019-11-26 03:02:06,837 INFO L444 ceAbstractionStarter]: For program point L99(lines 99 182) no Hoare annotation was computed. [2019-11-26 03:02:06,837 INFO L444 ceAbstractionStarter]: For program point L66(lines 66 77) no Hoare annotation was computed. [2019-11-26 03:02:06,837 INFO L444 ceAbstractionStarter]: For program point L248(lines 248 263) no Hoare annotation was computed. [2019-11-26 03:02:06,837 INFO L444 ceAbstractionStarter]: For program point L116(lines 116 131) no Hoare annotation was computed. [2019-11-26 03:02:06,837 INFO L444 ceAbstractionStarter]: For program point L50(lines 50 61) no Hoare annotation was computed. [2019-11-26 03:02:06,838 INFO L444 ceAbstractionStarter]: For program point L364(lines 364 379) no Hoare annotation was computed. [2019-11-26 03:02:06,838 INFO L444 ceAbstractionStarter]: For program point L232(lines 232 247) no Hoare annotation was computed. [2019-11-26 03:02:06,838 INFO L444 ceAbstractionStarter]: For program point L166(lines 166 177) no Hoare annotation was computed. [2019-11-26 03:02:06,838 INFO L444 ceAbstractionStarter]: For program point L100(lines 100 115) no Hoare annotation was computed. [2019-11-26 03:02:06,838 INFO L444 ceAbstractionStarter]: For program point L34(lines 34 36) no Hoare annotation was computed. [2019-11-26 03:02:06,838 INFO L440 ceAbstractionStarter]: At program point L381(lines 22 385) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_main_~this_state~0 0))) (or (and (= ULTIMATE.start_main_~q~0 3) (= 2 ULTIMATE.start_main_~this_state~0)) (and (<= 4 ULTIMATE.start_main_~q~0) (= 3 ULTIMATE.start_main_~this_state~0)) (and .cse0 (= ULTIMATE.start_main_~q~0 2)) (and .cse0 (= ULTIMATE.start_main_~q~0 0)))) [2019-11-26 03:02:06,838 INFO L444 ceAbstractionStarter]: For program point L348(lines 348 363) no Hoare annotation was computed. [2019-11-26 03:02:06,839 INFO L444 ceAbstractionStarter]: For program point L216(lines 216 231) no Hoare annotation was computed. [2019-11-26 03:02:06,839 INFO L444 ceAbstractionStarter]: For program point L183(lines 183 282) no Hoare annotation was computed. [2019-11-26 03:02:06,839 INFO L444 ceAbstractionStarter]: For program point L150(lines 150 161) no Hoare annotation was computed. [2019-11-26 03:02:06,839 INFO L444 ceAbstractionStarter]: For program point L332(lines 332 347) no Hoare annotation was computed. [2019-11-26 03:02:06,839 INFO L444 ceAbstractionStarter]: For program point L266(lines 266 277) no Hoare annotation was computed. [2019-11-26 03:02:06,839 INFO L444 ceAbstractionStarter]: For program point L200(lines 200 215) no Hoare annotation was computed. [2019-11-26 03:02:06,839 INFO L444 ceAbstractionStarter]: For program point L134(lines 134 145) no Hoare annotation was computed. [2019-11-26 03:02:06,859 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 03:02:06 BoogieIcfgContainer [2019-11-26 03:02:06,862 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 03:02:06,864 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 03:02:06,864 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 03:02:06,864 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 03:02:06,865 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 03:02:05" (3/4) ... [2019-11-26 03:02:06,868 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 03:02:06,891 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-26 03:02:06,892 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-26 03:02:06,946 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_544e0a7c-baf0-4684-a73a-1eb2c8a16ce5/bin/utaipan/witness.graphml [2019-11-26 03:02:06,947 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 03:02:06,949 INFO L168 Benchmark]: Toolchain (without parser) took 2621.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 944.7 MB in the beginning and 944.7 MB in the end (delta: 19.6 kB). Peak memory consumption was 144.7 MB. Max. memory is 11.5 GB. [2019-11-26 03:02:06,949 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 03:02:06,949 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-26 03:02:06,950 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 03:02:06,950 INFO L168 Benchmark]: Boogie Preprocessor took 29.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-26 03:02:06,951 INFO L168 Benchmark]: RCFGBuilder took 590.43 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: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. [2019-11-26 03:02:06,951 INFO L168 Benchmark]: TraceAbstraction took 1546.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 944.7 MB in the end (delta: 146.6 MB). Peak memory consumption was 146.6 MB. Max. memory is 11.5 GB. [2019-11-26 03:02:06,951 INFO L168 Benchmark]: Witness Printer took 83.07 ms. Allocated memory is still 1.2 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 03:02:06,954 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 323.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -191.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.50 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.94 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 590.43 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: 37.5 MB). Peak memory consumption was 37.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1546.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 944.7 MB in the end (delta: 146.6 MB). Peak memory consumption was 146.6 MB. Max. memory is 11.5 GB. * Witness Printer took 83.07 ms. Allocated memory is still 1.2 GB. Free memory is still 944.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 389]: 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: 13]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (((q == 3 && 2 == this_state) || (4 <= q && 3 == this_state)) || (this_state <= 0 && q == 2)) || (this_state <= 0 && q == 0) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: (4 <= q && 3 == this_state) || (this_state <= 0 && q == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 1.4s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 951 SDtfs, 337 SDslu, 405 SDs, 0 SdLazy, 217 SolverSat, 78 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 28 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 11 NumberOfFragments, 46 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 27 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 211 ConstructedInterpolants, 0 QuantifiedInterpolants, 7521 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 55/55 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...