./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem01_label26.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_6e2c2e97-1758-4cb9-a3b1-9038dea43dfd/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6e2c2e97-1758-4cb9-a3b1-9038dea43dfd/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6e2c2e97-1758-4cb9-a3b1-9038dea43dfd/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6e2c2e97-1758-4cb9-a3b1-9038dea43dfd/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem01_label26.c -s /tmp/vcloud-vcloud-master/worker/run_dir_6e2c2e97-1758-4cb9-a3b1-9038dea43dfd/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6e2c2e97-1758-4cb9-a3b1-9038dea43dfd/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 e002fb6463a65ebb6b75b40986db95c31112380a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:18:33,055 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:18:33,056 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:18:33,075 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:18:33,076 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:18:33,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:18:33,079 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:18:33,092 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:18:33,093 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:18:33,094 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:18:33,095 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:18:33,096 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:18:33,096 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:18:33,097 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:18:33,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:18:33,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:18:33,100 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:18:33,101 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:18:33,103 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:18:33,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:18:33,120 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:18:33,125 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:18:33,126 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:18:33,127 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:18:33,131 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:18:33,132 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:18:33,132 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:18:33,133 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:18:33,134 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:18:33,135 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:18:33,135 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:18:33,136 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:18:33,137 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:18:33,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:18:33,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:18:33,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:18:33,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:18:33,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:18:33,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:18:33,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:18:33,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:18:33,142 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6e2c2e97-1758-4cb9-a3b1-9038dea43dfd/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:18:33,162 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:18:33,162 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:18:33,163 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:18:33,164 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:18:33,164 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:18:33,164 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:18:33,164 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:18:33,165 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:18:33,165 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:18:33,165 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:18:33,166 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:18:33,166 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:18:33,167 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:18:33,167 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:18:33,167 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:18:33,168 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:18:33,168 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:18:33,168 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:18:33,168 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:18:33,168 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:18:33,168 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:18:33,169 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:18:33,169 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:18:33,169 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:18:33,169 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:18:33,169 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:18:33,170 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:18:33,170 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:18:33,170 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:18:33,170 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:18:33,170 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:18:33,171 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:18:33,171 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:18:33,171 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:18:33,171 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:18:33,172 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:18:33,172 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:18:33,172 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_6e2c2e97-1758-4cb9-a3b1-9038dea43dfd/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 -> e002fb6463a65ebb6b75b40986db95c31112380a [2019-11-26 02:18:33,313 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:18:33,329 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:18:33,332 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:18:33,334 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:18:33,334 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:18:33,336 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6e2c2e97-1758-4cb9-a3b1-9038dea43dfd/bin/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem01_label26.c [2019-11-26 02:18:33,407 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6e2c2e97-1758-4cb9-a3b1-9038dea43dfd/bin/utaipan/data/99faf7984/6ac610a6e5f043babb8164c8771d4b70/FLAG6864ef17f [2019-11-26 02:18:33,903 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:18:33,904 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6e2c2e97-1758-4cb9-a3b1-9038dea43dfd/sv-benchmarks/c/eca-rers2012/Problem01_label26.c [2019-11-26 02:18:33,917 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6e2c2e97-1758-4cb9-a3b1-9038dea43dfd/bin/utaipan/data/99faf7984/6ac610a6e5f043babb8164c8771d4b70/FLAG6864ef17f [2019-11-26 02:18:34,171 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6e2c2e97-1758-4cb9-a3b1-9038dea43dfd/bin/utaipan/data/99faf7984/6ac610a6e5f043babb8164c8771d4b70 [2019-11-26 02:18:34,173 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:18:34,175 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:18:34,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:18:34,176 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:18:34,180 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:18:34,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:18:34" (1/1) ... [2019-11-26 02:18:34,183 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f2b453 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:18:34, skipping insertion in model container [2019-11-26 02:18:34,183 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:18:34" (1/1) ... [2019-11-26 02:18:34,188 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:18:34,252 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:18:34,773 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:18:34,777 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:18:34,854 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:18:34,868 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:18:34,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:18:34 WrapperNode [2019-11-26 02:18:34,868 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:18:34,869 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:18:34,869 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:18:34,869 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:18:34,877 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:18:34" (1/1) ... [2019-11-26 02:18:34,894 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:18:34" (1/1) ... [2019-11-26 02:18:34,941 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:18:34,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:18:34,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:18:34,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:18:34,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:18:34" (1/1) ... [2019-11-26 02:18:34,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:18:34" (1/1) ... [2019-11-26 02:18:34,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:18:34" (1/1) ... [2019-11-26 02:18:34,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:18:34" (1/1) ... [2019-11-26 02:18:34,988 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:18:34" (1/1) ... [2019-11-26 02:18:34,998 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:18:34" (1/1) ... [2019-11-26 02:18:35,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:18:34" (1/1) ... [2019-11-26 02:18:35,009 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:18:35,010 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:18:35,010 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:18:35,010 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:18:35,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:18:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6e2c2e97-1758-4cb9-a3b1-9038dea43dfd/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:18:35,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:18:35,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:18:36,845 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:18:36,845 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:18:36,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:18:36 BoogieIcfgContainer [2019-11-26 02:18:36,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:18:36,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:18:36,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:18:36,851 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:18:36,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:18:34" (1/3) ... [2019-11-26 02:18:36,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150e95c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:18:36, skipping insertion in model container [2019-11-26 02:18:36,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:18:34" (2/3) ... [2019-11-26 02:18:36,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@150e95c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:18:36, skipping insertion in model container [2019-11-26 02:18:36,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:18:36" (3/3) ... [2019-11-26 02:18:36,855 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label26.c [2019-11-26 02:18:36,864 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:18:36,871 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:18:36,881 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:18:36,918 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:18:36,919 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:18:36,919 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:18:36,919 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:18:36,919 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:18:36,919 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:18:36,919 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:18:36,920 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:18:36,938 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-11-26 02:18:36,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:18:36,946 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:18:36,947 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:18:36,947 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:18:36,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:18:36,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1323241759, now seen corresponding path program 1 times [2019-11-26 02:18:36,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:18:36,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440193591] [2019-11-26 02:18:36,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:18:37,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:18:37,287 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:18:37,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440193591] [2019-11-26 02:18:37,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:18:37,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:18:37,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004362530] [2019-11-26 02:18:37,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:18:37,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:18:37,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:18:37,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:18:37,311 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 4 states. [2019-11-26 02:18:38,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:18:38,076 INFO L93 Difference]: Finished difference Result 297 states and 569 transitions. [2019-11-26 02:18:38,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:18:38,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 71 [2019-11-26 02:18:38,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:18:38,098 INFO L225 Difference]: With dead ends: 297 [2019-11-26 02:18:38,098 INFO L226 Difference]: Without dead ends: 216 [2019-11-26 02:18:38,102 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:18:38,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2019-11-26 02:18:38,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2019-11-26 02:18:38,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2019-11-26 02:18:38,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 372 transitions. [2019-11-26 02:18:38,179 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 372 transitions. Word has length 71 [2019-11-26 02:18:38,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:18:38,180 INFO L462 AbstractCegarLoop]: Abstraction has 216 states and 372 transitions. [2019-11-26 02:18:38,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:18:38,180 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 372 transitions. [2019-11-26 02:18:38,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-26 02:18:38,192 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:18:38,192 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:18:38,192 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:18:38,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:18:38,193 INFO L82 PathProgramCache]: Analyzing trace with hash -2123299052, now seen corresponding path program 1 times [2019-11-26 02:18:38,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:18:38,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491740572] [2019-11-26 02:18:38,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:18:38,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:18:38,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:18:38,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491740572] [2019-11-26 02:18:38,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:18:38,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:18:38,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058565229] [2019-11-26 02:18:38,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:18:38,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:18:38,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:18:38,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:18:38,390 INFO L87 Difference]: Start difference. First operand 216 states and 372 transitions. Second operand 4 states. [2019-11-26 02:18:38,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:18:38,986 INFO L93 Difference]: Finished difference Result 786 states and 1358 transitions. [2019-11-26 02:18:38,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:18:38,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-26 02:18:38,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:18:38,991 INFO L225 Difference]: With dead ends: 786 [2019-11-26 02:18:38,991 INFO L226 Difference]: Without dead ends: 571 [2019-11-26 02:18:38,993 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:18:38,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2019-11-26 02:18:39,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 358. [2019-11-26 02:18:39,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2019-11-26 02:18:39,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 550 transitions. [2019-11-26 02:18:39,019 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 550 transitions. Word has length 78 [2019-11-26 02:18:39,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:18:39,020 INFO L462 AbstractCegarLoop]: Abstraction has 358 states and 550 transitions. [2019-11-26 02:18:39,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:18:39,020 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 550 transitions. [2019-11-26 02:18:39,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-26 02:18:39,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:18:39,022 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:18:39,022 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:18:39,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:18:39,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1800587569, now seen corresponding path program 1 times [2019-11-26 02:18:39,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:18:39,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920524759] [2019-11-26 02:18:39,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:18:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:18:39,080 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:18:39,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920524759] [2019-11-26 02:18:39,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:18:39,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:18:39,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412679038] [2019-11-26 02:18:39,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:18:39,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:18:39,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:18:39,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:18:39,082 INFO L87 Difference]: Start difference. First operand 358 states and 550 transitions. Second operand 4 states. [2019-11-26 02:18:39,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:18:39,581 INFO L93 Difference]: Finished difference Result 857 states and 1277 transitions. [2019-11-26 02:18:39,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:18:39,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-11-26 02:18:39,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:18:39,584 INFO L225 Difference]: With dead ends: 857 [2019-11-26 02:18:39,584 INFO L226 Difference]: Without dead ends: 429 [2019-11-26 02:18:39,587 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:18:39,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2019-11-26 02:18:39,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2019-11-26 02:18:39,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-26 02:18:39,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 569 transitions. [2019-11-26 02:18:39,629 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 569 transitions. Word has length 92 [2019-11-26 02:18:39,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:18:39,630 INFO L462 AbstractCegarLoop]: Abstraction has 429 states and 569 transitions. [2019-11-26 02:18:39,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:18:39,631 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 569 transitions. [2019-11-26 02:18:39,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-26 02:18:39,633 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:18:39,638 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:18:39,638 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:18:39,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:18:39,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1032091724, now seen corresponding path program 1 times [2019-11-26 02:18:39,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:18:39,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8784935] [2019-11-26 02:18:39,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:18:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:18:39,703 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:18:39,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8784935] [2019-11-26 02:18:39,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:18:39,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:18:39,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260794485] [2019-11-26 02:18:39,707 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:18:39,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:18:39,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:18:39,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:18:39,708 INFO L87 Difference]: Start difference. First operand 429 states and 569 transitions. Second operand 3 states. [2019-11-26 02:18:40,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:18:40,060 INFO L93 Difference]: Finished difference Result 1212 states and 1622 transitions. [2019-11-26 02:18:40,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:18:40,060 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-26 02:18:40,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:18:40,065 INFO L225 Difference]: With dead ends: 1212 [2019-11-26 02:18:40,065 INFO L226 Difference]: Without dead ends: 784 [2019-11-26 02:18:40,066 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:18:40,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2019-11-26 02:18:40,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 642. [2019-11-26 02:18:40,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 642 states. [2019-11-26 02:18:40,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 833 transitions. [2019-11-26 02:18:40,086 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 833 transitions. Word has length 93 [2019-11-26 02:18:40,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:18:40,087 INFO L462 AbstractCegarLoop]: Abstraction has 642 states and 833 transitions. [2019-11-26 02:18:40,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:18:40,087 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 833 transitions. [2019-11-26 02:18:40,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-11-26 02:18:40,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:18:40,089 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:18:40,089 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:18:40,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:18:40,090 INFO L82 PathProgramCache]: Analyzing trace with hash 143197316, now seen corresponding path program 1 times [2019-11-26 02:18:40,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:18:40,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895133095] [2019-11-26 02:18:40,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:18:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:18:40,134 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-26 02:18:40,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895133095] [2019-11-26 02:18:40,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:18:40,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:18:40,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430921599] [2019-11-26 02:18:40,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:18:40,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:18:40,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:18:40,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:18:40,136 INFO L87 Difference]: Start difference. First operand 642 states and 833 transitions. Second operand 3 states. [2019-11-26 02:18:40,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:18:40,518 INFO L93 Difference]: Finished difference Result 1709 states and 2233 transitions. [2019-11-26 02:18:40,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:18:40,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-11-26 02:18:40,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:18:40,525 INFO L225 Difference]: With dead ends: 1709 [2019-11-26 02:18:40,525 INFO L226 Difference]: Without dead ends: 1068 [2019-11-26 02:18:40,526 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:18:40,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2019-11-26 02:18:40,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 784. [2019-11-26 02:18:40,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-26 02:18:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1021 transitions. [2019-11-26 02:18:40,561 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1021 transitions. Word has length 97 [2019-11-26 02:18:40,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:18:40,562 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1021 transitions. [2019-11-26 02:18:40,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:18:40,562 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1021 transitions. [2019-11-26 02:18:40,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-26 02:18:40,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:18:40,566 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:18:40,566 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:18:40,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:18:40,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1126555358, now seen corresponding path program 1 times [2019-11-26 02:18:40,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:18:40,567 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121410664] [2019-11-26 02:18:40,567 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:18:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:18:40,665 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-26 02:18:40,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121410664] [2019-11-26 02:18:40,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:18:40,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:18:40,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324701139] [2019-11-26 02:18:40,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:18:40,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:18:40,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:18:40,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:18:40,669 INFO L87 Difference]: Start difference. First operand 784 states and 1021 transitions. Second operand 3 states. [2019-11-26 02:18:41,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:18:41,021 INFO L93 Difference]: Finished difference Result 1638 states and 2133 transitions. [2019-11-26 02:18:41,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:18:41,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-26 02:18:41,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:18:41,026 INFO L225 Difference]: With dead ends: 1638 [2019-11-26 02:18:41,026 INFO L226 Difference]: Without dead ends: 855 [2019-11-26 02:18:41,027 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:18:41,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2019-11-26 02:18:41,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 784. [2019-11-26 02:18:41,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2019-11-26 02:18:41,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1021 transitions. [2019-11-26 02:18:41,051 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1021 transitions. Word has length 99 [2019-11-26 02:18:41,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:18:41,056 INFO L462 AbstractCegarLoop]: Abstraction has 784 states and 1021 transitions. [2019-11-26 02:18:41,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:18:41,056 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1021 transitions. [2019-11-26 02:18:41,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-26 02:18:41,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:18:41,058 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:18:41,058 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:18:41,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:18:41,059 INFO L82 PathProgramCache]: Analyzing trace with hash 397471773, now seen corresponding path program 1 times [2019-11-26 02:18:41,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:18:41,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017372387] [2019-11-26 02:18:41,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:18:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:18:41,129 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:18:41,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017372387] [2019-11-26 02:18:41,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:18:41,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:18:41,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269513390] [2019-11-26 02:18:41,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:18:41,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:18:41,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:18:41,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:18:41,132 INFO L87 Difference]: Start difference. First operand 784 states and 1021 transitions. Second operand 3 states. [2019-11-26 02:18:41,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:18:41,444 INFO L93 Difference]: Finished difference Result 1780 states and 2291 transitions. [2019-11-26 02:18:41,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:18:41,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-26 02:18:41,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:18:41,449 INFO L225 Difference]: With dead ends: 1780 [2019-11-26 02:18:41,450 INFO L226 Difference]: Without dead ends: 997 [2019-11-26 02:18:41,451 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:18:41,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-26 02:18:41,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 926. [2019-11-26 02:18:41,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-26 02:18:41,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1184 transitions. [2019-11-26 02:18:41,473 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1184 transitions. Word has length 100 [2019-11-26 02:18:41,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:18:41,474 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1184 transitions. [2019-11-26 02:18:41,474 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:18:41,474 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1184 transitions. [2019-11-26 02:18:41,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-26 02:18:41,476 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:18:41,477 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:18:41,477 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:18:41,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:18:41,477 INFO L82 PathProgramCache]: Analyzing trace with hash 2113451237, now seen corresponding path program 1 times [2019-11-26 02:18:41,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:18:41,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43482590] [2019-11-26 02:18:41,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:18:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:18:41,653 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:18:41,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43482590] [2019-11-26 02:18:41,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:18:41,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-26 02:18:41,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809646020] [2019-11-26 02:18:41,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-26 02:18:41,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:18:41,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-26 02:18:41,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:18:41,655 INFO L87 Difference]: Start difference. First operand 926 states and 1184 transitions. Second operand 8 states. [2019-11-26 02:18:42,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:18:42,187 INFO L93 Difference]: Finished difference Result 1961 states and 2496 transitions. [2019-11-26 02:18:42,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-26 02:18:42,192 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 104 [2019-11-26 02:18:42,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:18:42,198 INFO L225 Difference]: With dead ends: 1961 [2019-11-26 02:18:42,199 INFO L226 Difference]: Without dead ends: 1107 [2019-11-26 02:18:42,202 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:18:42,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1107 states. [2019-11-26 02:18:42,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1107 to 926. [2019-11-26 02:18:42,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-26 02:18:42,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1172 transitions. [2019-11-26 02:18:42,227 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1172 transitions. Word has length 104 [2019-11-26 02:18:42,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:18:42,228 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1172 transitions. [2019-11-26 02:18:42,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-26 02:18:42,228 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1172 transitions. [2019-11-26 02:18:42,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-26 02:18:42,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:18:42,231 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:18:42,231 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:18:42,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:18:42,231 INFO L82 PathProgramCache]: Analyzing trace with hash 646849554, now seen corresponding path program 1 times [2019-11-26 02:18:42,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:18:42,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699756980] [2019-11-26 02:18:42,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:18:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:18:42,318 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:18:42,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699756980] [2019-11-26 02:18:42,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:18:42,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:18:42,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674427573] [2019-11-26 02:18:42,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:18:42,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:18:42,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:18:42,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:18:42,326 INFO L87 Difference]: Start difference. First operand 926 states and 1172 transitions. Second operand 3 states. [2019-11-26 02:18:42,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:18:42,600 INFO L93 Difference]: Finished difference Result 1141 states and 1461 transitions. [2019-11-26 02:18:42,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:18:42,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-11-26 02:18:42,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:18:42,606 INFO L225 Difference]: With dead ends: 1141 [2019-11-26 02:18:42,607 INFO L226 Difference]: Without dead ends: 1139 [2019-11-26 02:18:42,607 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:18:42,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1139 states. [2019-11-26 02:18:42,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1139 to 997. [2019-11-26 02:18:42,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-26 02:18:42,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1288 transitions. [2019-11-26 02:18:42,632 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1288 transitions. Word has length 130 [2019-11-26 02:18:42,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:18:42,632 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1288 transitions. [2019-11-26 02:18:42,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:18:42,632 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1288 transitions. [2019-11-26 02:18:42,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-26 02:18:42,635 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:18:42,635 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:18:42,635 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:18:42,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:18:42,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1183258047, now seen corresponding path program 1 times [2019-11-26 02:18:42,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:18:42,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305307147] [2019-11-26 02:18:42,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:18:42,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:18:42,685 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2019-11-26 02:18:42,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305307147] [2019-11-26 02:18:42,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:18:42,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:18:42,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923780998] [2019-11-26 02:18:42,687 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:18:42,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:18:42,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:18:42,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:18:42,687 INFO L87 Difference]: Start difference. First operand 997 states and 1288 transitions. Second operand 3 states. [2019-11-26 02:18:42,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:18:42,928 INFO L93 Difference]: Finished difference Result 1993 states and 2573 transitions. [2019-11-26 02:18:42,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:18:42,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2019-11-26 02:18:42,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:18:42,933 INFO L225 Difference]: With dead ends: 1993 [2019-11-26 02:18:42,933 INFO L226 Difference]: Without dead ends: 997 [2019-11-26 02:18:42,934 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:18:42,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-26 02:18:42,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2019-11-26 02:18:42,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 997 states. [2019-11-26 02:18:42,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1170 transitions. [2019-11-26 02:18:42,957 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1170 transitions. Word has length 135 [2019-11-26 02:18:42,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:18:42,957 INFO L462 AbstractCegarLoop]: Abstraction has 997 states and 1170 transitions. [2019-11-26 02:18:42,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:18:42,957 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1170 transitions. [2019-11-26 02:18:42,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-11-26 02:18:42,960 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:18:42,960 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:18:42,961 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:18:42,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:18:42,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1012112364, now seen corresponding path program 1 times [2019-11-26 02:18:42,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:18:42,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949752198] [2019-11-26 02:18:42,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:18:42,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:18:43,073 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 113 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2019-11-26 02:18:43,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949752198] [2019-11-26 02:18:43,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:18:43,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:18:43,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438420400] [2019-11-26 02:18:43,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:18:43,074 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:18:43,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:18:43,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:18:43,075 INFO L87 Difference]: Start difference. First operand 997 states and 1170 transitions. Second operand 3 states. [2019-11-26 02:18:43,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:18:43,327 INFO L93 Difference]: Finished difference Result 1993 states and 2339 transitions. [2019-11-26 02:18:43,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:18:43,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 165 [2019-11-26 02:18:43,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:18:43,332 INFO L225 Difference]: With dead ends: 1993 [2019-11-26 02:18:43,332 INFO L226 Difference]: Without dead ends: 997 [2019-11-26 02:18:43,334 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:18:43,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2019-11-26 02:18:43,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 926. [2019-11-26 02:18:43,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-26 02:18:43,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1074 transitions. [2019-11-26 02:18:43,355 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1074 transitions. Word has length 165 [2019-11-26 02:18:43,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:18:43,355 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1074 transitions. [2019-11-26 02:18:43,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:18:43,355 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1074 transitions. [2019-11-26 02:18:43,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-11-26 02:18:43,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:18:43,361 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:18:43,361 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:18:43,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:18:43,361 INFO L82 PathProgramCache]: Analyzing trace with hash -289993856, now seen corresponding path program 1 times [2019-11-26 02:18:43,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:18:43,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137480826] [2019-11-26 02:18:43,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:18:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:18:43,588 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 181 proven. 93 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-26 02:18:43,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137480826] [2019-11-26 02:18:43,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1203749409] [2019-11-26 02:18:43,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6e2c2e97-1758-4cb9-a3b1-9038dea43dfd/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:18:43,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:18:43,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 432 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-26 02:18:43,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:18:43,789 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-11-26 02:18:43,789 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:18:43,838 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 122 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2019-11-26 02:18:43,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:18:43,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [7] total 9 [2019-11-26 02:18:43,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952822511] [2019-11-26 02:18:43,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:18:43,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:18:43,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:18:43,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-26 02:18:43,841 INFO L87 Difference]: Start difference. First operand 926 states and 1074 transitions. Second operand 3 states. [2019-11-26 02:18:44,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:18:44,090 INFO L93 Difference]: Finished difference Result 1849 states and 2159 transitions. [2019-11-26 02:18:44,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:18:44,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-11-26 02:18:44,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:18:44,090 INFO L225 Difference]: With dead ends: 1849 [2019-11-26 02:18:44,090 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:18:44,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 387 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-26 02:18:44,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:18:44,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:18:44,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:18:44,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:18:44,093 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 194 [2019-11-26 02:18:44,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:18:44,093 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:18:44,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:18:44,094 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:18:44,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:18:44,297 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:18:44,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:18:44,487 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-26 02:18:44,487 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-26 02:18:44,487 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-26 02:18:44,487 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-26 02:18:44,487 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-26 02:18:44,487 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-26 02:18:44,487 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-26 02:18:44,487 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-26 02:18:44,487 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-26 02:18:44,487 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-26 02:18:44,487 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-26 02:18:44,487 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-26 02:18:44,488 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-26 02:18:44,488 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-26 02:18:44,488 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-26 02:18:44,488 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-26 02:18:44,488 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-26 02:18:44,488 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (not (= 15 ~a8~0)) (and (not (= 1 ~a7~0)) .cse0 (= ~a20~0 1)) (and .cse0 (<= ~a20~0 0)))) [2019-11-26 02:18:44,488 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-26 02:18:44,488 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-26 02:18:44,488 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-26 02:18:44,488 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-26 02:18:44,488 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-26 02:18:44,488 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-26 02:18:44,489 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-26 02:18:44,489 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-26 02:18:44,489 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-26 02:18:44,489 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-26 02:18:44,489 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-26 02:18:44,489 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-26 02:18:44,489 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-26 02:18:44,489 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:18:44,489 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-26 02:18:44,489 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-26 02:18:44,489 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-26 02:18:44,489 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:18:44,489 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-26 02:18:44,489 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-26 02:18:44,489 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-26 02:18:44,490 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-26 02:18:44,490 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-26 02:18:44,490 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-26 02:18:44,490 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= ~a21~0 1))) (or (not (= 15 ~a8~0)) (and (not (= 1 ~a7~0)) .cse0 (= ~a20~0 1)) (and .cse0 (<= ~a20~0 0)))) [2019-11-26 02:18:44,490 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-26 02:18:44,490 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-26 02:18:44,490 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-26 02:18:44,490 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-26 02:18:44,490 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-26 02:18:44,490 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-26 02:18:44,490 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:18:44,490 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-26 02:18:44,490 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-26 02:18:44,490 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-26 02:18:44,490 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-26 02:18:44,491 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-26 02:18:44,491 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-26 02:18:44,491 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-26 02:18:44,491 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-26 02:18:44,491 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-26 02:18:44,491 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-26 02:18:44,491 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-26 02:18:44,491 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-26 02:18:44,491 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-26 02:18:44,491 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-26 02:18:44,491 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-26 02:18:44,491 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-26 02:18:44,491 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-26 02:18:44,491 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-26 02:18:44,492 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 485) no Hoare annotation was computed. [2019-11-26 02:18:44,492 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-26 02:18:44,492 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-26 02:18:44,492 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-26 02:18:44,492 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-26 02:18:44,492 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-26 02:18:44,492 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-26 02:18:44,492 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-26 02:18:44,506 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:18:44 BoogieIcfgContainer [2019-11-26 02:18:44,506 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:18:44,507 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:18:44,507 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:18:44,507 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:18:44,508 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:18:36" (3/4) ... [2019-11-26 02:18:44,510 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:18:44,533 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 100 nodes and edges [2019-11-26 02:18:44,535 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-11-26 02:18:44,536 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-26 02:18:44,659 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6e2c2e97-1758-4cb9-a3b1-9038dea43dfd/bin/utaipan/witness.graphml [2019-11-26 02:18:44,659 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:18:44,661 INFO L168 Benchmark]: Toolchain (without parser) took 10486.42 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 291.0 MB). Free memory was 940.7 MB in the beginning and 864.4 MB in the end (delta: 76.3 MB). Peak memory consumption was 367.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:18:44,662 INFO L168 Benchmark]: CDTParser took 1.78 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 02:18:44,662 INFO L168 Benchmark]: CACSL2BoogieTranslator took 693.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -165.1 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:18:44,662 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.27 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: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:18:44,663 INFO L168 Benchmark]: Boogie Preprocessor took 66.85 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: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:18:44,663 INFO L168 Benchmark]: RCFGBuilder took 1837.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 875.9 MB in the end (delta: 215.2 MB). Peak memory consumption was 215.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:18:44,663 INFO L168 Benchmark]: TraceAbstraction took 7658.16 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 158.3 MB). Free memory was 875.9 MB in the beginning and 886.8 MB in the end (delta: -10.9 MB). Peak memory consumption was 147.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:18:44,664 INFO L168 Benchmark]: Witness Printer took 152.57 ms. Allocated memory is still 1.3 GB. Free memory was 886.8 MB in the beginning and 864.4 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:18:44,666 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.78 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 693.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -165.1 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 73.27 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: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 66.85 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: 7.3 MB). Peak memory consumption was 7.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1837.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 875.9 MB in the end (delta: 215.2 MB). Peak memory consumption was 215.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7658.16 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 158.3 MB). Free memory was 875.9 MB in the beginning and 886.8 MB in the end (delta: -10.9 MB). Peak memory consumption was 147.5 MB. Max. memory is 11.5 GB. * Witness Printer took 152.57 ms. Allocated memory is still 1.3 GB. Free memory was 886.8 MB in the beginning and 864.4 MB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 485]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (!(15 == a8) || ((!(1 == a7) && a21 == 1) && a20 == 1)) || (a21 == 1 && a20 <= 0) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (!(15 == a8) || ((!(1 == a7) && a21 == 1) && a20 == 1)) || (a21 == 1 && a20 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 76 locations, 1 error locations. Result: SAFE, OverallTime: 7.5s, OverallIterations: 12, TraceHistogramMax: 6, AutomataDifference: 4.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 610 SDtfs, 1009 SDslu, 74 SDs, 0 SdLazy, 3143 SolverSat, 786 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 431 GetRequests, 400 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=997occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 12 MinimizatonAttempts, 1175 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 40 NumberOfFragments, 47 HoareAnnotationTreeSize, 3 FomulaSimplifications, 20956 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 6 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 1552 NumberOfCodeBlocks, 1552 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1732 ConstructedInterpolants, 0 QuantifiedInterpolants, 555282 SizeOfPredicates, 1 NumberOfNonLiveVariables, 432 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 14 InterpolantComputations, 13 PerfectInterpolantSequences, 1362/1455 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...