./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/psyco/psyco_io_1.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_ce5df716-a358-42db-a6fa-57eb620dd382/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ce5df716-a358-42db-a6fa-57eb620dd382/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ce5df716-a358-42db-a6fa-57eb620dd382/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ce5df716-a358-42db-a6fa-57eb620dd382/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/psyco/psyco_io_1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ce5df716-a358-42db-a6fa-57eb620dd382/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ce5df716-a358-42db-a6fa-57eb620dd382/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 69c831b1eda23dac6e2f4454b4feebfba511ade3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 02:32:56,850 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:32:56,852 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:32:56,866 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:32:56,866 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:32:56,868 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:32:56,869 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:32:56,877 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:32:56,882 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:32:56,886 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:32:56,887 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:32:56,888 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:32:56,888 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:32:56,890 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:32:56,891 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:32:56,892 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:32:56,893 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:32:56,894 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:32:56,897 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:32:56,900 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:32:56,904 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:32:56,907 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:32:56,909 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:32:56,910 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:32:56,912 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:32:56,912 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:32:56,913 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:32:56,914 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:32:56,914 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:32:56,915 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:32:56,916 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:32:56,916 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:32:56,917 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:32:56,918 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:32:56,919 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:32:56,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:32:56,920 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:32:56,920 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:32:56,921 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:32:56,921 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:32:56,923 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:32:56,923 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ce5df716-a358-42db-a6fa-57eb620dd382/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:32:56,948 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:32:56,958 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:32:56,959 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:32:56,959 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:32:56,960 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:32:56,960 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:32:56,960 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:32:56,960 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:32:56,960 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:32:56,961 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:32:56,961 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:32:56,961 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:32:56,961 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:32:56,962 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:32:56,962 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:32:56,962 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:32:56,963 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:32:56,964 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:32:56,964 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:32:56,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:32:56,964 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:32:56,964 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:32:56,965 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:32:56,965 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:32:56,965 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:32:56,966 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:32:56,966 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:32:56,966 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:32:56,966 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:32:56,966 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:32:56,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:32:56,967 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:32:56,967 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:32:56,967 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:32:56,968 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:32:56,968 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:32:56,968 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:32:56,968 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_ce5df716-a358-42db-a6fa-57eb620dd382/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 -> 69c831b1eda23dac6e2f4454b4feebfba511ade3 [2019-11-26 02:32:57,104 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:32:57,115 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:32:57,117 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:32:57,119 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:32:57,119 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:32:57,120 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ce5df716-a358-42db-a6fa-57eb620dd382/bin/utaipan/../../sv-benchmarks/c/psyco/psyco_io_1.c [2019-11-26 02:32:57,177 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ce5df716-a358-42db-a6fa-57eb620dd382/bin/utaipan/data/ba84d246c/450db4fbf4c8433c8f7a58a009d7bb83/FLAG8548e5a7b [2019-11-26 02:32:57,615 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:32:57,616 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ce5df716-a358-42db-a6fa-57eb620dd382/sv-benchmarks/c/psyco/psyco_io_1.c [2019-11-26 02:32:57,628 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ce5df716-a358-42db-a6fa-57eb620dd382/bin/utaipan/data/ba84d246c/450db4fbf4c8433c8f7a58a009d7bb83/FLAG8548e5a7b [2019-11-26 02:32:57,959 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ce5df716-a358-42db-a6fa-57eb620dd382/bin/utaipan/data/ba84d246c/450db4fbf4c8433c8f7a58a009d7bb83 [2019-11-26 02:32:57,961 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:32:57,962 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:32:57,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:32:57,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:32:57,967 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:32:57,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:32:57" (1/1) ... [2019-11-26 02:32:57,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c08adcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:32:57, skipping insertion in model container [2019-11-26 02:32:57,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:32:57" (1/1) ... [2019-11-26 02:32:57,977 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:32:58,018 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:32:58,308 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:32:58,318 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:32:58,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:32:58,379 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:32:58,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:32:58 WrapperNode [2019-11-26 02:32:58,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:32:58,387 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:32:58,387 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:32:58,387 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:32:58,395 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:32:58" (1/1) ... [2019-11-26 02:32:58,401 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:32:58" (1/1) ... [2019-11-26 02:32:58,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:32:58,431 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:32:58,431 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:32:58,431 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:32:58,440 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:32:58" (1/1) ... [2019-11-26 02:32:58,440 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:32:58" (1/1) ... [2019-11-26 02:32:58,446 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:32:58" (1/1) ... [2019-11-26 02:32:58,446 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:32:58" (1/1) ... [2019-11-26 02:32:58,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:32:58" (1/1) ... [2019-11-26 02:32:58,468 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:32:58" (1/1) ... [2019-11-26 02:32:58,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:32:58" (1/1) ... [2019-11-26 02:32:58,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:32:58,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:32:58,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:32:58,473 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:32:58,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:32:58" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce5df716-a358-42db-a6fa-57eb620dd382/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 02:32:58,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:32:58,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:32:58,958 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:32:58,958 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-26 02:32:58,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:32:58 BoogieIcfgContainer [2019-11-26 02:32:58,959 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:32:58,960 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:32:58,960 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:32:58,963 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:32:58,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:32:57" (1/3) ... [2019-11-26 02:32:58,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53aadcf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:32:58, skipping insertion in model container [2019-11-26 02:32:58,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:32:58" (2/3) ... [2019-11-26 02:32:58,964 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53aadcf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:32:58, skipping insertion in model container [2019-11-26 02:32:58,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:32:58" (3/3) ... [2019-11-26 02:32:58,966 INFO L109 eAbstractionObserver]: Analyzing ICFG psyco_io_1.c [2019-11-26 02:32:58,972 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:32:58,977 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:32:58,983 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:32:59,003 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:32:59,003 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:32:59,003 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:32:59,003 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:32:59,003 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:32:59,004 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:32:59,004 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:32:59,004 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:32:59,016 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states. [2019-11-26 02:32:59,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-26 02:32:59,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:59,022 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:32:59,022 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:59,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:59,026 INFO L82 PathProgramCache]: Analyzing trace with hash -162000591, now seen corresponding path program 1 times [2019-11-26 02:32:59,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:59,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140109338] [2019-11-26 02:32:59,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:32:59,140 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 02:32:59,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140109338] [2019-11-26 02:32:59,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:59,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:32:59,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360808037] [2019-11-26 02:32:59,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-26 02:32:59,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:59,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-26 02:32:59,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-26 02:32:59,158 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 2 states. [2019-11-26 02:32:59,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:59,177 INFO L93 Difference]: Finished difference Result 127 states and 241 transitions. [2019-11-26 02:32:59,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-26 02:32:59,178 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-26 02:32:59,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:59,188 INFO L225 Difference]: With dead ends: 127 [2019-11-26 02:32:59,188 INFO L226 Difference]: Without dead ends: 56 [2019-11-26 02:32:59,191 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 02:32:59,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-26 02:32:59,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-11-26 02:32:59,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-11-26 02:32:59,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 86 transitions. [2019-11-26 02:32:59,222 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 86 transitions. Word has length 8 [2019-11-26 02:32:59,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:59,222 INFO L462 AbstractCegarLoop]: Abstraction has 56 states and 86 transitions. [2019-11-26 02:32:59,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-26 02:32:59,222 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 86 transitions. [2019-11-26 02:32:59,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 02:32:59,223 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:59,223 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:32:59,223 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:59,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:59,224 INFO L82 PathProgramCache]: Analyzing trace with hash -194557569, now seen corresponding path program 1 times [2019-11-26 02:32:59,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:59,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642175002] [2019-11-26 02:32:59,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:32:59,270 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 02:32:59,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642175002] [2019-11-26 02:32:59,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:59,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:32:59,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516723550] [2019-11-26 02:32:59,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:32:59,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:59,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:32:59,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:32:59,273 INFO L87 Difference]: Start difference. First operand 56 states and 86 transitions. Second operand 3 states. [2019-11-26 02:32:59,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:59,321 INFO L93 Difference]: Finished difference Result 114 states and 175 transitions. [2019-11-26 02:32:59,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:32:59,322 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-26 02:32:59,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:59,323 INFO L225 Difference]: With dead ends: 114 [2019-11-26 02:32:59,323 INFO L226 Difference]: Without dead ends: 59 [2019-11-26 02:32:59,324 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 02:32:59,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-26 02:32:59,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2019-11-26 02:32:59,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-11-26 02:32:59,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2019-11-26 02:32:59,331 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 9 [2019-11-26 02:32:59,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:59,331 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2019-11-26 02:32:59,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:32:59,332 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2019-11-26 02:32:59,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-26 02:32:59,332 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:59,333 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:32:59,333 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:59,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:59,333 INFO L82 PathProgramCache]: Analyzing trace with hash -694410156, now seen corresponding path program 1 times [2019-11-26 02:32:59,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:59,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130988067] [2019-11-26 02:32:59,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:32:59,370 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 02:32:59,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130988067] [2019-11-26 02:32:59,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:59,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:32:59,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055718984] [2019-11-26 02:32:59,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:32:59,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:59,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:32:59,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:32:59,372 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand 3 states. [2019-11-26 02:32:59,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:59,408 INFO L93 Difference]: Finished difference Result 108 states and 164 transitions. [2019-11-26 02:32:59,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:32:59,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-26 02:32:59,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:59,409 INFO L225 Difference]: With dead ends: 108 [2019-11-26 02:32:59,410 INFO L226 Difference]: Without dead ends: 51 [2019-11-26 02:32:59,410 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 02:32:59,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-26 02:32:59,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2019-11-26 02:32:59,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-26 02:32:59,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 75 transitions. [2019-11-26 02:32:59,416 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 75 transitions. Word has length 14 [2019-11-26 02:32:59,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:59,416 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 75 transitions. [2019-11-26 02:32:59,416 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:32:59,417 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 75 transitions. [2019-11-26 02:32:59,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-26 02:32:59,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:59,418 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:32:59,418 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:59,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:59,418 INFO L82 PathProgramCache]: Analyzing trace with hash 905287082, now seen corresponding path program 1 times [2019-11-26 02:32:59,418 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:59,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662673393] [2019-11-26 02:32:59,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:59,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:32:59,458 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 02:32:59,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662673393] [2019-11-26 02:32:59,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:59,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:32:59,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545563857] [2019-11-26 02:32:59,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:32:59,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:59,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:32:59,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:32:59,461 INFO L87 Difference]: Start difference. First operand 51 states and 75 transitions. Second operand 3 states. [2019-11-26 02:32:59,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:59,525 INFO L93 Difference]: Finished difference Result 135 states and 205 transitions. [2019-11-26 02:32:59,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:32:59,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-26 02:32:59,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:59,526 INFO L225 Difference]: With dead ends: 135 [2019-11-26 02:32:59,527 INFO L226 Difference]: Without dead ends: 89 [2019-11-26 02:32:59,527 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 02:32:59,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-26 02:32:59,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2019-11-26 02:32:59,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-26 02:32:59,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 127 transitions. [2019-11-26 02:32:59,535 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 127 transitions. Word has length 19 [2019-11-26 02:32:59,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:59,535 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 127 transitions. [2019-11-26 02:32:59,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:32:59,536 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 127 transitions. [2019-11-26 02:32:59,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-26 02:32:59,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:59,537 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:32:59,537 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:59,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:59,537 INFO L82 PathProgramCache]: Analyzing trace with hash 264332961, now seen corresponding path program 1 times [2019-11-26 02:32:59,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:59,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377167673] [2019-11-26 02:32:59,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:59,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:32:59,584 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 02:32:59,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377167673] [2019-11-26 02:32:59,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:59,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:32:59,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397701170] [2019-11-26 02:32:59,585 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:32:59,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:59,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:32:59,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:32:59,586 INFO L87 Difference]: Start difference. First operand 86 states and 127 transitions. Second operand 3 states. [2019-11-26 02:32:59,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:59,622 INFO L93 Difference]: Finished difference Result 175 states and 257 transitions. [2019-11-26 02:32:59,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:32:59,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-26 02:32:59,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:59,624 INFO L225 Difference]: With dead ends: 175 [2019-11-26 02:32:59,624 INFO L226 Difference]: Without dead ends: 96 [2019-11-26 02:32:59,625 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 02:32:59,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-26 02:32:59,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-11-26 02:32:59,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-26 02:32:59,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 135 transitions. [2019-11-26 02:32:59,637 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 135 transitions. Word has length 20 [2019-11-26 02:32:59,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:59,638 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 135 transitions. [2019-11-26 02:32:59,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:32:59,638 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 135 transitions. [2019-11-26 02:32:59,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-26 02:32:59,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:59,640 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:32:59,640 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:59,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:59,643 INFO L82 PathProgramCache]: Analyzing trace with hash 948672522, now seen corresponding path program 1 times [2019-11-26 02:32:59,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:59,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075202927] [2019-11-26 02:32:59,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:32:59,713 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-26 02:32:59,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075202927] [2019-11-26 02:32:59,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:59,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:32:59,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330694205] [2019-11-26 02:32:59,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:32:59,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:59,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:32:59,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:32:59,715 INFO L87 Difference]: Start difference. First operand 94 states and 135 transitions. Second operand 3 states. [2019-11-26 02:32:59,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:59,748 INFO L93 Difference]: Finished difference Result 159 states and 229 transitions. [2019-11-26 02:32:59,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:32:59,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-26 02:32:59,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:59,750 INFO L225 Difference]: With dead ends: 159 [2019-11-26 02:32:59,750 INFO L226 Difference]: Without dead ends: 72 [2019-11-26 02:32:59,751 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 02:32:59,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-26 02:32:59,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2019-11-26 02:32:59,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-26 02:32:59,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 100 transitions. [2019-11-26 02:32:59,760 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 100 transitions. Word has length 31 [2019-11-26 02:32:59,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:59,763 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 100 transitions. [2019-11-26 02:32:59,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:32:59,763 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 100 transitions. [2019-11-26 02:32:59,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-26 02:32:59,765 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:32:59,765 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, 1, 1, 1, 1] [2019-11-26 02:32:59,766 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:32:59,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:32:59,767 INFO L82 PathProgramCache]: Analyzing trace with hash 1609281601, now seen corresponding path program 1 times [2019-11-26 02:32:59,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:32:59,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350265605] [2019-11-26 02:32:59,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:32:59,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:32:59,878 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 02:32:59,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350265605] [2019-11-26 02:32:59,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:32:59,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:32:59,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290273086] [2019-11-26 02:32:59,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:32:59,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:32:59,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:32:59,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:32:59,880 INFO L87 Difference]: Start difference. First operand 72 states and 100 transitions. Second operand 4 states. [2019-11-26 02:32:59,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:32:59,946 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2019-11-26 02:32:59,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:32:59,947 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-26 02:32:59,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:32:59,948 INFO L225 Difference]: With dead ends: 75 [2019-11-26 02:32:59,948 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:32:59,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-11-26 02:32:59,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:32:59,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:32:59,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:32:59,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:32:59,949 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2019-11-26 02:32:59,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:32:59,949 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:32:59,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:32:59,950 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:32:59,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:32:59,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:33:00,049 INFO L444 ceAbstractionStarter]: For program point L36(lines 36 47) no Hoare annotation was computed. [2019-11-26 02:33:00,049 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:33:00,049 INFO L444 ceAbstractionStarter]: For program point L86(lines 86 101) no Hoare annotation was computed. [2019-11-26 02:33:00,050 INFO L444 ceAbstractionStarter]: For program point L53(lines 53 104) no Hoare annotation was computed. [2019-11-26 02:33:00,050 INFO L444 ceAbstractionStarter]: For program point L202(lines 202 217) no Hoare annotation was computed. [2019-11-26 02:33:00,050 INFO L444 ceAbstractionStarter]: For program point L70(lines 70 85) no Hoare annotation was computed. [2019-11-26 02:33:00,050 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 333) no Hoare annotation was computed. [2019-11-26 02:33:00,050 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 201) no Hoare annotation was computed. [2019-11-26 02:33:00,050 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 69) no Hoare annotation was computed. [2019-11-26 02:33:00,050 INFO L440 ceAbstractionStarter]: At program point L335(lines 23 339) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~this_sink~0 0))) (or (and .cse0 (= ULTIMATE.start_main_~q~0 2)) (and (or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0)) (<= 3 ULTIMATE.start_main_~q~0)) (and .cse0 (= ULTIMATE.start_main_~q~0 0)))) [2019-11-26 02:33:00,051 INFO L444 ceAbstractionStarter]: For program point L302(lines 302 317) no Hoare annotation was computed. [2019-11-26 02:33:00,051 INFO L444 ceAbstractionStarter]: For program point L170(lines 170 185) no Hoare annotation was computed. [2019-11-26 02:33:00,051 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 301) no Hoare annotation was computed. [2019-11-26 02:33:00,051 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 169) no Hoare annotation was computed. [2019-11-26 02:33:00,051 INFO L444 ceAbstractionStarter]: For program point L88(lines 88 99) no Hoare annotation was computed. [2019-11-26 02:33:00,051 INFO L444 ceAbstractionStarter]: For program point L270(lines 270 285) no Hoare annotation was computed. [2019-11-26 02:33:00,051 INFO L444 ceAbstractionStarter]: For program point L204(lines 204 215) no Hoare annotation was computed. [2019-11-26 02:33:00,051 INFO L444 ceAbstractionStarter]: For program point L138(lines 138 153) no Hoare annotation was computed. [2019-11-26 02:33:00,051 INFO L444 ceAbstractionStarter]: For program point L105(lines 105 220) no Hoare annotation was computed. [2019-11-26 02:33:00,051 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 83) no Hoare annotation was computed. [2019-11-26 02:33:00,052 INFO L444 ceAbstractionStarter]: For program point L320(lines 320 331) no Hoare annotation was computed. [2019-11-26 02:33:00,052 INFO L444 ceAbstractionStarter]: For program point L254(lines 254 269) no Hoare annotation was computed. [2019-11-26 02:33:00,052 INFO L444 ceAbstractionStarter]: For program point L221(lines 221 336) no Hoare annotation was computed. [2019-11-26 02:33:00,052 INFO L444 ceAbstractionStarter]: For program point L188(lines 188 199) no Hoare annotation was computed. [2019-11-26 02:33:00,052 INFO L444 ceAbstractionStarter]: For program point L122(lines 122 137) no Hoare annotation was computed. [2019-11-26 02:33:00,052 INFO L444 ceAbstractionStarter]: For program point L56(lines 56 67) no Hoare annotation was computed. [2019-11-26 02:33:00,052 INFO L440 ceAbstractionStarter]: At program point L23-2(lines 23 339) the Hoare annotation is: (or (and (or (<= (+ ULTIMATE.start_main_~this_sink~0 1) 0) (<= 1 ULTIMATE.start_main_~this_sink~0)) (<= 3 ULTIMATE.start_main_~q~0)) (and (= ULTIMATE.start_main_~this_sink~0 0) (= ULTIMATE.start_main_~q~0 0))) [2019-11-26 02:33:00,052 INFO L444 ceAbstractionStarter]: For program point L23-3(lines 23 339) no Hoare annotation was computed. [2019-11-26 02:33:00,052 INFO L444 ceAbstractionStarter]: For program point L304(lines 304 315) no Hoare annotation was computed. [2019-11-26 02:33:00,053 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 253) no Hoare annotation was computed. [2019-11-26 02:33:00,053 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 183) no Hoare annotation was computed. [2019-11-26 02:33:00,053 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 121) no Hoare annotation was computed. [2019-11-26 02:33:00,054 INFO L444 ceAbstractionStarter]: For program point L40(lines 40 42) no Hoare annotation was computed. [2019-11-26 02:33:00,054 INFO L444 ceAbstractionStarter]: For program point L288(lines 288 299) no Hoare annotation was computed. [2019-11-26 02:33:00,054 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 237) no Hoare annotation was computed. [2019-11-26 02:33:00,054 INFO L444 ceAbstractionStarter]: For program point L156(lines 156 167) no Hoare annotation was computed. [2019-11-26 02:33:00,054 INFO L444 ceAbstractionStarter]: For program point L272(lines 272 283) no Hoare annotation was computed. [2019-11-26 02:33:00,054 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 151) no Hoare annotation was computed. [2019-11-26 02:33:00,055 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:33:00,055 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 267) no Hoare annotation was computed. [2019-11-26 02:33:00,055 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 135) no Hoare annotation was computed. [2019-11-26 02:33:00,055 INFO L444 ceAbstractionStarter]: For program point L240(lines 240 251) no Hoare annotation was computed. [2019-11-26 02:33:00,055 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 119) no Hoare annotation was computed. [2019-11-26 02:33:00,055 INFO L444 ceAbstractionStarter]: For program point L224(lines 224 235) no Hoare annotation was computed. [2019-11-26 02:33:00,056 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 94) no Hoare annotation was computed. [2019-11-26 02:33:00,056 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 210) no Hoare annotation was computed. [2019-11-26 02:33:00,056 INFO L444 ceAbstractionStarter]: For program point L76(lines 76 78) no Hoare annotation was computed. [2019-11-26 02:33:00,056 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 326) no Hoare annotation was computed. [2019-11-26 02:33:00,056 INFO L444 ceAbstractionStarter]: For program point L192(lines 192 194) no Hoare annotation was computed. [2019-11-26 02:33:00,056 INFO L444 ceAbstractionStarter]: For program point L60(lines 60 62) no Hoare annotation was computed. [2019-11-26 02:33:00,057 INFO L444 ceAbstractionStarter]: For program point L308(lines 308 310) no Hoare annotation was computed. [2019-11-26 02:33:00,057 INFO L444 ceAbstractionStarter]: For program point L176(lines 176 178) no Hoare annotation was computed. [2019-11-26 02:33:00,057 INFO L440 ceAbstractionStarter]: At program point L325(lines 13 344) the Hoare annotation is: false [2019-11-26 02:33:00,057 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 294) no Hoare annotation was computed. [2019-11-26 02:33:00,057 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 162) no Hoare annotation was computed. [2019-11-26 02:33:00,057 INFO L444 ceAbstractionStarter]: For program point L276(lines 276 278) no Hoare annotation was computed. [2019-11-26 02:33:00,058 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 146) no Hoare annotation was computed. [2019-11-26 02:33:00,058 INFO L444 ceAbstractionStarter]: For program point L260(lines 260 262) no Hoare annotation was computed. [2019-11-26 02:33:00,058 INFO L444 ceAbstractionStarter]: For program point L128(lines 128 130) no Hoare annotation was computed. [2019-11-26 02:33:00,058 INFO L444 ceAbstractionStarter]: For program point L244(lines 244 246) no Hoare annotation was computed. [2019-11-26 02:33:00,058 INFO L444 ceAbstractionStarter]: For program point L112(lines 112 114) no Hoare annotation was computed. [2019-11-26 02:33:00,058 INFO L447 ceAbstractionStarter]: At program point L13(lines 13 344) the Hoare annotation is: true [2019-11-26 02:33:00,058 INFO L444 ceAbstractionStarter]: For program point L228(lines 228 230) no Hoare annotation was computed. [2019-11-26 02:33:00,059 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 343) no Hoare annotation was computed. [2019-11-26 02:33:00,059 INFO L444 ceAbstractionStarter]: For program point L33(lines 33 52) no Hoare annotation was computed. [2019-11-26 02:33:00,059 INFO L444 ceAbstractionStarter]: For program point L34(lines 34 49) no Hoare annotation was computed. [2019-11-26 02:33:00,073 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:33:00 BoogieIcfgContainer [2019-11-26 02:33:00,073 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:33:00,074 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:33:00,074 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:33:00,074 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:33:00,074 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:32:58" (3/4) ... [2019-11-26 02:33:00,077 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:33:00,096 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-26 02:33:00,097 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-26 02:33:00,152 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ce5df716-a358-42db-a6fa-57eb620dd382/bin/utaipan/witness.graphml [2019-11-26 02:33:00,152 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:33:00,154 INFO L168 Benchmark]: Toolchain (without parser) took 2190.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.6 MB). Free memory was 950.1 MB in the beginning and 1.0 GB in the end (delta: -98.3 MB). Peak memory consumption was 97.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:33:00,154 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:33:00,155 INFO L168 Benchmark]: CACSL2BoogieTranslator took 423.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.6 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -240.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:33:00,156 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:33:00,156 INFO L168 Benchmark]: Boogie Preprocessor took 41.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:33:00,157 INFO L168 Benchmark]: RCFGBuilder took 486.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:33:00,157 INFO L168 Benchmark]: TraceAbstraction took 1113.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 96.7 MB). Peak memory consumption was 96.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:33:00,158 INFO L168 Benchmark]: Witness Printer took 78.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:33:00,160 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 423.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.6 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -240.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 486.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 34.5 MB). Peak memory consumption was 34.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1113.14 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 96.7 MB). Peak memory consumption was 96.7 MB. Max. memory is 11.5 GB. * Witness Printer took 78.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 343]: 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: 23]: Loop Invariant Derived loop invariant: ((this_sink + 1 <= 0 || 1 <= this_sink) && 3 <= q) || (this_sink == 0 && q == 0) - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((this_sink == 0 && q == 2) || ((this_sink + 1 <= 0 || 1 <= this_sink) && 3 <= q)) || (this_sink == 0 && q == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 1 error locations. Result: SAFE, OverallTime: 1.0s, OverallIterations: 7, TraceHistogramMax: 3, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 512 SDtfs, 190 SDslu, 255 SDs, 0 SdLazy, 88 SolverSat, 36 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=94occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 12 NumberOfFragments, 51 HoareAnnotationTreeSize, 4 FomulaSimplifications, 34 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 9 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 133 NumberOfCodeBlocks, 133 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 126 ConstructedInterpolants, 0 QuantifiedInterpolants, 6811 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 27/27 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...