./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i --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_a13e8e7a-e5d0-46aa-9f20-19fb2e8e1e29/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_a13e8e7a-e5d0-46aa-9f20-19fb2e8e1e29/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a13e8e7a-e5d0-46aa-9f20-19fb2e8e1e29/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a13e8e7a-e5d0-46aa-9f20-19fb2e8e1e29/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i -s /tmp/vcloud-vcloud-master/worker/run_dir_a13e8e7a-e5d0-46aa-9f20-19fb2e8e1e29/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a13e8e7a-e5d0-46aa-9f20-19fb2e8e1e29/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 305e9c546a6cc2591d6267bc612ab5ec3e8adaa4 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:58:21,156 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:58:21,158 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:58:21,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:58:21,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:58:21,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:58:21,175 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:58:21,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:58:21,186 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:58:21,190 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:58:21,191 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:58:21,192 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:58:21,192 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:58:21,194 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:58:21,195 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:58:21,196 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:58:21,197 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:58:21,198 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:58:21,200 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:58:21,203 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:58:21,206 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:58:21,209 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:58:21,210 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:58:21,211 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:58:21,213 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:58:21,213 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:58:21,213 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:58:21,215 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:58:21,215 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:58:21,216 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:58:21,216 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:58:21,216 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:58:21,217 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:58:21,218 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:58:21,219 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:58:21,219 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:58:21,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:58:21,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:58:21,220 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:58:21,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:58:21,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:58:21,222 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a13e8e7a-e5d0-46aa-9f20-19fb2e8e1e29/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:58:21,246 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:58:21,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:58:21,246 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:58:21,247 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:58:21,247 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:58:21,247 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:58:21,247 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:58:21,247 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:58:21,247 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:58:21,248 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:58:21,248 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:58:21,248 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:58:21,248 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:58:21,248 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:58:21,249 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:58:21,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:58:21,249 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:58:21,249 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:58:21,250 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:58:21,250 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:58:21,250 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:58:21,250 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:58:21,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:58:21,250 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:58:21,251 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:58:21,251 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:58:21,251 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:58:21,251 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:58:21,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:58:21,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:58:21,252 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:58:21,252 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:58:21,252 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:58:21,252 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:58:21,252 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:58:21,253 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:58:21,253 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:58:21,253 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_a13e8e7a-e5d0-46aa-9f20-19fb2e8e1e29/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 -> 305e9c546a6cc2591d6267bc612ab5ec3e8adaa4 [2019-11-26 02:58:21,416 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:58:21,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:58:21,434 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:58:21,435 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:58:21,435 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:58:21,436 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a13e8e7a-e5d0-46aa-9f20-19fb2e8e1e29/bin/utaipan/../../sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2019-11-26 02:58:21,493 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a13e8e7a-e5d0-46aa-9f20-19fb2e8e1e29/bin/utaipan/data/b88ea30f0/ac03dee0abc44009b62b2f39776e95fe/FLAGc84a02716 [2019-11-26 02:58:21,836 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:58:21,837 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a13e8e7a-e5d0-46aa-9f20-19fb2e8e1e29/sv-benchmarks/c/loop-invgen/sendmail-close-angle.i [2019-11-26 02:58:21,845 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a13e8e7a-e5d0-46aa-9f20-19fb2e8e1e29/bin/utaipan/data/b88ea30f0/ac03dee0abc44009b62b2f39776e95fe/FLAGc84a02716 [2019-11-26 02:58:22,232 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a13e8e7a-e5d0-46aa-9f20-19fb2e8e1e29/bin/utaipan/data/b88ea30f0/ac03dee0abc44009b62b2f39776e95fe [2019-11-26 02:58:22,234 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:58:22,236 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:58:22,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:58:22,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:58:22,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:58:22,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:58:22" (1/1) ... [2019-11-26 02:58:22,243 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6043df08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:58:22, skipping insertion in model container [2019-11-26 02:58:22,243 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:58:22" (1/1) ... [2019-11-26 02:58:22,249 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:58:22,269 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:58:22,451 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:58:22,456 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:58:22,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:58:22,542 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:58:22,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:58:22 WrapperNode [2019-11-26 02:58:22,543 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:58:22,544 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:58:22,544 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:58:22,544 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:58:22,553 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:58:22" (1/1) ... [2019-11-26 02:58:22,565 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:58:22" (1/1) ... [2019-11-26 02:58:22,582 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:58:22,583 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:58:22,583 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:58:22,583 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:58:22,591 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:58:22" (1/1) ... [2019-11-26 02:58:22,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:58:22" (1/1) ... [2019-11-26 02:58:22,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:58:22" (1/1) ... [2019-11-26 02:58:22,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:58:22" (1/1) ... [2019-11-26 02:58:22,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:58:22" (1/1) ... [2019-11-26 02:58:22,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:58:22" (1/1) ... [2019-11-26 02:58:22,614 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:58:22" (1/1) ... [2019-11-26 02:58:22,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:58:22,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:58:22,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:58:22,617 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:58:22,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:58:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a13e8e7a-e5d0-46aa-9f20-19fb2e8e1e29/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:58:22,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:58:22,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:58:23,007 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:58:23,008 INFO L284 CfgBuilder]: Removed 21 assume(true) statements. [2019-11-26 02:58:23,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:58:23 BoogieIcfgContainer [2019-11-26 02:58:23,009 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:58:23,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:58:23,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:58:23,012 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:58:23,012 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:58:22" (1/3) ... [2019-11-26 02:58:23,013 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd9cca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:58:23, skipping insertion in model container [2019-11-26 02:58:23,013 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:58:22" (2/3) ... [2019-11-26 02:58:23,014 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dd9cca7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:58:23, skipping insertion in model container [2019-11-26 02:58:23,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:58:23" (3/3) ... [2019-11-26 02:58:23,015 INFO L109 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2019-11-26 02:58:23,024 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:58:23,033 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-26 02:58:23,045 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-26 02:58:23,071 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:58:23,072 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:58:23,072 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:58:23,072 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:58:23,072 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:58:23,073 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:58:23,073 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:58:23,073 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:58:23,089 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-11-26 02:58:23,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-26 02:58:23,094 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:58:23,094 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:58:23,095 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:58:23,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:58:23,100 INFO L82 PathProgramCache]: Analyzing trace with hash -396103483, now seen corresponding path program 1 times [2019-11-26 02:58:23,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:58:23,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042712112] [2019-11-26 02:58:23,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:58:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:58:23,198 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:58:23,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042712112] [2019-11-26 02:58:23,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:58:23,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:58:23,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292177764] [2019-11-26 02:58:23,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-26 02:58:23,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:58:23,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-26 02:58:23,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-26 02:58:23,214 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 2 states. [2019-11-26 02:58:23,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:58:23,231 INFO L93 Difference]: Finished difference Result 78 states and 101 transitions. [2019-11-26 02:58:23,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-26 02:58:23,232 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-26 02:58:23,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:58:23,238 INFO L225 Difference]: With dead ends: 78 [2019-11-26 02:58:23,238 INFO L226 Difference]: Without dead ends: 38 [2019-11-26 02:58:23,241 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-26 02:58:23,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-26 02:58:23,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-26 02:58:23,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-26 02:58:23,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2019-11-26 02:58:23,271 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 8 [2019-11-26 02:58:23,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:58:23,272 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2019-11-26 02:58:23,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-26 02:58:23,272 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2019-11-26 02:58:23,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 02:58:23,273 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:58:23,273 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:58:23,273 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:58:23,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:58:23,274 INFO L82 PathProgramCache]: Analyzing trace with hash 551382066, now seen corresponding path program 1 times [2019-11-26 02:58:23,274 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:58:23,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409790907] [2019-11-26 02:58:23,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:58:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:58:23,328 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:58:23,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409790907] [2019-11-26 02:58:23,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:58:23,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:58:23,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956679741] [2019-11-26 02:58:23,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:58:23,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:58:23,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:58:23,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:58:23,331 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand 4 states. [2019-11-26 02:58:23,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:58:23,441 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2019-11-26 02:58:23,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:58:23,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 9 [2019-11-26 02:58:23,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:58:23,443 INFO L225 Difference]: With dead ends: 42 [2019-11-26 02:58:23,443 INFO L226 Difference]: Without dead ends: 36 [2019-11-26 02:58:23,444 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:58:23,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-26 02:58:23,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 32. [2019-11-26 02:58:23,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-26 02:58:23,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2019-11-26 02:58:23,450 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 9 [2019-11-26 02:58:23,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:58:23,450 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2019-11-26 02:58:23,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:58:23,451 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2019-11-26 02:58:23,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-26 02:58:23,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:58:23,451 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:58:23,452 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:58:23,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:58:23,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1597345877, now seen corresponding path program 1 times [2019-11-26 02:58:23,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:58:23,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498417253] [2019-11-26 02:58:23,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:58:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:58:23,497 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:58:23,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498417253] [2019-11-26 02:58:23,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:58:23,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:58:23,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596146507] [2019-11-26 02:58:23,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:58:23,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:58:23,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:58:23,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:58:23,499 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand 5 states. [2019-11-26 02:58:23,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:58:23,732 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-11-26 02:58:23,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:58:23,734 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-11-26 02:58:23,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:58:23,735 INFO L225 Difference]: With dead ends: 48 [2019-11-26 02:58:23,735 INFO L226 Difference]: Without dead ends: 44 [2019-11-26 02:58:23,736 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:58:23,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-26 02:58:23,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2019-11-26 02:58:23,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-11-26 02:58:23,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2019-11-26 02:58:23,743 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 11 [2019-11-26 02:58:23,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:58:23,744 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2019-11-26 02:58:23,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:58:23,744 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2019-11-26 02:58:23,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-26 02:58:23,745 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:58:23,745 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:58:23,746 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:58:23,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:58:23,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1050645099, now seen corresponding path program 1 times [2019-11-26 02:58:23,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:58:23,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631156238] [2019-11-26 02:58:23,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:58:23,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:58:23,783 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:58:23,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631156238] [2019-11-26 02:58:23,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:58:23,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:58:23,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469660199] [2019-11-26 02:58:23,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:58:23,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:58:23,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:58:23,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:58:23,785 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 4 states. [2019-11-26 02:58:23,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:58:23,864 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2019-11-26 02:58:23,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:58:23,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-26 02:58:23,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:58:23,866 INFO L225 Difference]: With dead ends: 42 [2019-11-26 02:58:23,866 INFO L226 Difference]: Without dead ends: 40 [2019-11-26 02:58:23,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:58:23,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-26 02:58:23,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-26 02:58:23,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-26 02:58:23,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2019-11-26 02:58:23,873 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 13 [2019-11-26 02:58:23,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:58:23,874 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2019-11-26 02:58:23,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:58:23,874 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2019-11-26 02:58:23,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-26 02:58:23,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:58:23,875 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:58:23,875 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:58:23,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:58:23,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1213350277, now seen corresponding path program 1 times [2019-11-26 02:58:23,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:58:23,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851596506] [2019-11-26 02:58:23,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:58:23,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:58:23,979 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:58:23,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851596506] [2019-11-26 02:58:23,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:58:23,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:58:23,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632217414] [2019-11-26 02:58:23,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:58:23,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:58:23,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:58:23,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:58:23,982 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 6 states. [2019-11-26 02:58:24,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:58:24,152 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2019-11-26 02:58:24,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:58:24,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-26 02:58:24,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:58:24,154 INFO L225 Difference]: With dead ends: 68 [2019-11-26 02:58:24,154 INFO L226 Difference]: Without dead ends: 54 [2019-11-26 02:58:24,154 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-26 02:58:24,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-26 02:58:24,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 50. [2019-11-26 02:58:24,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-26 02:58:24,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2019-11-26 02:58:24,162 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 15 [2019-11-26 02:58:24,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:58:24,164 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2019-11-26 02:58:24,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:58:24,165 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2019-11-26 02:58:24,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-26 02:58:24,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:58:24,165 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:58:24,166 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:58:24,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:58:24,166 INFO L82 PathProgramCache]: Analyzing trace with hash -352468520, now seen corresponding path program 1 times [2019-11-26 02:58:24,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:58:24,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909522874] [2019-11-26 02:58:24,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:58:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:58:24,244 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:58:24,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909522874] [2019-11-26 02:58:24,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:58:24,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:58:24,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290922909] [2019-11-26 02:58:24,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:58:24,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:58:24,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:58:24,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:58:24,246 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 6 states. [2019-11-26 02:58:24,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:58:24,376 INFO L93 Difference]: Finished difference Result 59 states and 61 transitions. [2019-11-26 02:58:24,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:58:24,377 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2019-11-26 02:58:24,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:58:24,377 INFO L225 Difference]: With dead ends: 59 [2019-11-26 02:58:24,377 INFO L226 Difference]: Without dead ends: 57 [2019-11-26 02:58:24,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-11-26 02:58:24,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-26 02:58:24,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 50. [2019-11-26 02:58:24,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-26 02:58:24,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2019-11-26 02:58:24,385 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 15 [2019-11-26 02:58:24,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:58:24,386 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2019-11-26 02:58:24,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:58:24,386 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2019-11-26 02:58:24,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-26 02:58:24,387 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:58:24,387 INFO L410 BasicCegarLoop]: trace histogram [2, 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:58:24,388 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:58:24,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:58:24,388 INFO L82 PathProgramCache]: Analyzing trace with hash 988547556, now seen corresponding path program 1 times [2019-11-26 02:58:24,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:58:24,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117534586] [2019-11-26 02:58:24,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:58:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:58:24,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:58:24,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117534586] [2019-11-26 02:58:24,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072076183] [2019-11-26 02:58:24,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a13e8e7a-e5d0-46aa-9f20-19fb2e8e1e29/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:58:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:58:24,550 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-26 02:58:24,556 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:58:24,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:58:24,690 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:58:24,695 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:58:24,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:58:24,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:58:24,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1849043383] [2019-11-26 02:58:24,832 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-11-26 02:58:24,833 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 02:58:24,837 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-26 02:58:24,843 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-26 02:58:24,843 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-26 02:58:25,101 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-26 02:58:25,276 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2019-11-26 02:58:25,505 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-26 02:58:26,490 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2019-11-26 02:58:26,647 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 32 [2019-11-26 02:58:27,014 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-11-26 02:58:27,016 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 02:58:27,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-26 02:58:27,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 16 [2019-11-26 02:58:27,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241261416] [2019-11-26 02:58:27,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-26 02:58:27,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:58:27,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-26 02:58:27,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2019-11-26 02:58:27,019 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 16 states. [2019-11-26 02:58:27,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:58:27,942 INFO L93 Difference]: Finished difference Result 115 states and 125 transitions. [2019-11-26 02:58:27,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-26 02:58:27,942 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 25 [2019-11-26 02:58:27,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:58:27,944 INFO L225 Difference]: With dead ends: 115 [2019-11-26 02:58:27,945 INFO L226 Difference]: Without dead ends: 88 [2019-11-26 02:58:27,948 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 41 SyntacticMatches, 8 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1528 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=615, Invalid=3167, Unknown=0, NotChecked=0, Total=3782 [2019-11-26 02:58:27,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-11-26 02:58:27,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 70. [2019-11-26 02:58:27,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-26 02:58:27,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2019-11-26 02:58:27,957 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 25 [2019-11-26 02:58:27,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:58:27,958 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2019-11-26 02:58:27,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-26 02:58:27,958 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2019-11-26 02:58:27,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-26 02:58:27,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:58:27,959 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:58:28,159 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:58:28,160 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:58:28,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:58:28,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1849429313, now seen corresponding path program 1 times [2019-11-26 02:58:28,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:58:28,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074318748] [2019-11-26 02:58:28,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:58:28,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:58:28,235 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:58:28,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074318748] [2019-11-26 02:58:28,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [115148962] [2019-11-26 02:58:28,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a13e8e7a-e5d0-46aa-9f20-19fb2e8e1e29/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:58:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:58:28,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 02:58:28,269 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:58:28,310 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:58:28,310 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:58:28,334 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:58:28,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1817823915] [2019-11-26 02:58:28,335 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-11-26 02:58:28,335 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 02:58:28,335 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-26 02:58:28,335 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-26 02:58:28,335 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-26 02:58:28,462 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-26 02:58:29,052 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 02:58:29,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-26 02:58:29,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2019-11-26 02:58:29,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135056984] [2019-11-26 02:58:29,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 02:58:29,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:58:29,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 02:58:29,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2019-11-26 02:58:29,053 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 11 states. [2019-11-26 02:58:29,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:58:29,234 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2019-11-26 02:58:29,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 02:58:29,234 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-11-26 02:58:29,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:58:29,235 INFO L225 Difference]: With dead ends: 72 [2019-11-26 02:58:29,235 INFO L226 Difference]: Without dead ends: 70 [2019-11-26 02:58:29,236 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 51 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 363 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=181, Invalid=875, Unknown=0, NotChecked=0, Total=1056 [2019-11-26 02:58:29,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-11-26 02:58:29,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2019-11-26 02:58:29,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-26 02:58:29,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2019-11-26 02:58:29,243 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 25 [2019-11-26 02:58:29,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:58:29,243 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2019-11-26 02:58:29,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 02:58:29,244 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2019-11-26 02:58:29,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-26 02:58:29,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:58:29,245 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2019-11-26 02:58:29,448 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:58:29,448 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:58:29,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:58:29,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1910118038, now seen corresponding path program 2 times [2019-11-26 02:58:29,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:58:29,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013366853] [2019-11-26 02:58:29,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:58:29,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:58:29,607 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:58:29,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013366853] [2019-11-26 02:58:29,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [339375451] [2019-11-26 02:58:29,608 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a13e8e7a-e5d0-46aa-9f20-19fb2e8e1e29/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:58:29,664 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-26 02:58:29,664 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 02:58:29,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 24 conjunts are in the unsatisfiable core [2019-11-26 02:58:29,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:58:29,845 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:58:29,845 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:58:30,039 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:58:30,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1227913613] [2019-11-26 02:58:30,048 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2019-11-26 02:58:30,048 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 02:58:30,049 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-26 02:58:30,049 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-26 02:58:30,049 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-26 02:58:30,186 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-26 02:58:31,049 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 02:58:31,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-26 02:58:31,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 23 [2019-11-26 02:58:31,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116592880] [2019-11-26 02:58:31,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-26 02:58:31,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:58:31,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-26 02:58:31,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1096, Unknown=0, NotChecked=0, Total=1260 [2019-11-26 02:58:31,051 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 23 states. [2019-11-26 02:58:32,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:58:32,105 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2019-11-26 02:58:32,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-26 02:58:32,105 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 35 [2019-11-26 02:58:32,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:58:32,106 INFO L225 Difference]: With dead ends: 77 [2019-11-26 02:58:32,106 INFO L226 Difference]: Without dead ends: 75 [2019-11-26 02:58:32,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 73 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1287 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=779, Invalid=3511, Unknown=0, NotChecked=0, Total=4290 [2019-11-26 02:58:32,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-26 02:58:32,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 68. [2019-11-26 02:58:32,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-26 02:58:32,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2019-11-26 02:58:32,115 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 35 [2019-11-26 02:58:32,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:58:32,115 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2019-11-26 02:58:32,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-26 02:58:32,115 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2019-11-26 02:58:32,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-26 02:58:32,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:58:32,117 INFO L410 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:58:32,317 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:58:32,318 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:58:32,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:58:32,318 INFO L82 PathProgramCache]: Analyzing trace with hash -843226378, now seen corresponding path program 2 times [2019-11-26 02:58:32,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:58:32,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166785304] [2019-11-26 02:58:32,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:58:32,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:58:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 29 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-26 02:58:32,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166785304] [2019-11-26 02:58:32,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713180634] [2019-11-26 02:58:32,490 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a13e8e7a-e5d0-46aa-9f20-19fb2e8e1e29/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:58:32,531 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-26 02:58:32,531 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-26 02:58:32,532 INFO L255 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-26 02:58:32,536 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:58:32,720 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-26 02:58:32,720 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:58:32,862 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-26 02:58:32,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [623437537] [2019-11-26 02:58:32,866 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2019-11-26 02:58:32,866 INFO L166 IcfgInterpreter]: Building call graph [2019-11-26 02:58:32,866 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-11-26 02:58:32,867 INFO L176 IcfgInterpreter]: Starting interpretation [2019-11-26 02:58:32,867 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-11-26 02:58:33,020 INFO L180 IcfgInterpreter]: Interpretation finished [2019-11-26 02:58:33,161 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2019-11-26 02:58:34,211 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 33 [2019-11-26 02:58:34,412 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 39 [2019-11-26 02:58:34,822 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-11-26 02:58:34,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-11-26 02:58:34,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 24 [2019-11-26 02:58:34,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993436601] [2019-11-26 02:58:34,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-11-26 02:58:34,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:58:34,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-11-26 02:58:34,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=1504, Unknown=0, NotChecked=0, Total=1722 [2019-11-26 02:58:34,824 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand 24 states. [2019-11-26 02:58:35,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:58:35,031 INFO L93 Difference]: Finished difference Result 68 states and 71 transitions. [2019-11-26 02:58:35,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:58:35,031 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2019-11-26 02:58:35,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:58:35,032 INFO L225 Difference]: With dead ends: 68 [2019-11-26 02:58:35,032 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:58:35,033 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 95 SyntacticMatches, 10 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=312, Invalid=1850, Unknown=0, NotChecked=0, Total=2162 [2019-11-26 02:58:35,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:58:35,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:58:35,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:58:35,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:58:35,034 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2019-11-26 02:58:35,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:58:35,034 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:58:35,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-11-26 02:58:35,034 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:58:35,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:58:35,234 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:58:35,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:58:35,522 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-26 02:58:35,522 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-26 02:58:35,522 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:58:35,522 INFO L444 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-11-26 02:58:35,522 INFO L440 ceAbstractionStarter]: At program point L4-2(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~buf~0 1) ULTIMATE.start_main_~buflim~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= 0 ULTIMATE.start_main_~buf~0) (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0)) (<= 0 ULTIMATE.start_main_~in~0) (= (+ ULTIMATE.start_main_~buflim~0 2) ULTIMATE.start_main_~bufferlen~0)) [2019-11-26 02:58:35,522 INFO L444 ceAbstractionStarter]: For program point L4-3(lines 4 6) no Hoare annotation was computed. [2019-11-26 02:58:35,523 INFO L440 ceAbstractionStarter]: At program point L4-5(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~buf~0 1) ULTIMATE.start_main_~buflim~0) (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= 0 ULTIMATE.start_main_~buf~0) (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0)) (<= 0 ULTIMATE.start_main_~in~0) (= (+ ULTIMATE.start_main_~buflim~0 2) ULTIMATE.start_main_~bufferlen~0)) [2019-11-26 02:58:35,523 INFO L444 ceAbstractionStarter]: For program point L4-6(lines 4 6) no Hoare annotation was computed. [2019-11-26 02:58:35,523 INFO L440 ceAbstractionStarter]: At program point L4-8(lines 3 8) the Hoare annotation is: (and (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~buf~0) (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0)) (<= 0 ULTIMATE.start_main_~in~0) (= (+ ULTIMATE.start_main_~buflim~0 2) ULTIMATE.start_main_~bufferlen~0) (<= ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~buflim~0)) [2019-11-26 02:58:35,523 INFO L444 ceAbstractionStarter]: For program point L4-9(lines 4 6) no Hoare annotation was computed. [2019-11-26 02:58:35,523 INFO L440 ceAbstractionStarter]: At program point L4-11(lines 3 34) the Hoare annotation is: (let ((.cse0 (<= 0 ULTIMATE.start_main_~in~0)) (.cse1 (= (+ ULTIMATE.start_main_~buflim~0 2) ULTIMATE.start_main_~bufferlen~0)) (.cse2 (<= ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~buflim~0))) (or (and (<= ULTIMATE.start_main_~in~0 0) (= 0 ULTIMATE.start_main_~buf~0) (< ULTIMATE.start_main_~bufferlen~0 ULTIMATE.start_main_~inlen~0) .cse0 .cse1 .cse2) (and (= 1 ULTIMATE.start___VERIFIER_assert_~cond) (<= (+ ULTIMATE.start_main_~buflim~0 ULTIMATE.start_main_~in~0 3) (+ ULTIMATE.start_main_~buf~0 ULTIMATE.start_main_~inlen~0)) (<= 0 ULTIMATE.start_main_~buf~0) .cse0 .cse1 .cse2))) [2019-11-26 02:58:35,523 INFO L444 ceAbstractionStarter]: For program point L4-12(lines 4 6) no Hoare annotation was computed. [2019-11-26 02:58:35,523 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-26 02:58:35,523 INFO L440 ceAbstractionStarter]: At program point L4-14(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~buf~0 2) ULTIMATE.start_main_~bufferlen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~buf~0) (<= 0 ULTIMATE.start_main_~in~0)) [2019-11-26 02:58:35,523 INFO L444 ceAbstractionStarter]: For program point L4-15(lines 4 6) no Hoare annotation was computed. [2019-11-26 02:58:35,524 INFO L440 ceAbstractionStarter]: At program point L4-17(lines 3 8) the Hoare annotation is: (and (<= (+ ULTIMATE.start_main_~buf~0 2) ULTIMATE.start_main_~bufferlen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~buf~0) (<= 0 ULTIMATE.start_main_~in~0)) [2019-11-26 02:58:35,524 INFO L444 ceAbstractionStarter]: For program point L4-18(lines 4 6) no Hoare annotation was computed. [2019-11-26 02:58:35,524 INFO L440 ceAbstractionStarter]: At program point L4-20(lines 3 8) the Hoare annotation is: (and (<= 2 ULTIMATE.start_main_~bufferlen~0) (<= (+ ULTIMATE.start_main_~buf~0 1) ULTIMATE.start_main_~bufferlen~0) (not (= 0 ULTIMATE.start___VERIFIER_assert_~cond)) (<= 0 ULTIMATE.start_main_~buf~0) (<= 0 ULTIMATE.start_main_~in~0)) [2019-11-26 02:58:35,524 INFO L444 ceAbstractionStarter]: For program point L4-21(lines 4 6) no Hoare annotation was computed. [2019-11-26 02:58:35,524 INFO L447 ceAbstractionStarter]: At program point L4-23(lines 3 8) the Hoare annotation is: true [2019-11-26 02:58:35,524 INFO L444 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-11-26 02:58:35,524 INFO L444 ceAbstractionStarter]: For program point L5-1(line 5) no Hoare annotation was computed. [2019-11-26 02:58:35,524 INFO L444 ceAbstractionStarter]: For program point L5-2(line 5) no Hoare annotation was computed. [2019-11-26 02:58:35,524 INFO L444 ceAbstractionStarter]: For program point L5-3(line 5) no Hoare annotation was computed. [2019-11-26 02:58:35,525 INFO L444 ceAbstractionStarter]: For program point L5-4(line 5) no Hoare annotation was computed. [2019-11-26 02:58:35,525 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-26 02:58:35,525 INFO L444 ceAbstractionStarter]: For program point L5-5(line 5) no Hoare annotation was computed. [2019-11-26 02:58:35,525 INFO L444 ceAbstractionStarter]: For program point L5-6(line 5) no Hoare annotation was computed. [2019-11-26 02:58:35,525 INFO L444 ceAbstractionStarter]: For program point L5-7(line 5) no Hoare annotation was computed. [2019-11-26 02:58:35,525 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-26 02:58:35,525 INFO L444 ceAbstractionStarter]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2019-11-26 02:58:35,525 INFO L444 ceAbstractionStarter]: For program point L23-3(lines 23 34) no Hoare annotation was computed. [2019-11-26 02:58:35,525 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-26 02:58:35,525 INFO L447 ceAbstractionStarter]: At program point L41(lines 11 42) the Hoare annotation is: true [2019-11-26 02:58:35,527 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:58:35,527 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-26 02:58:35,527 INFO L444 ceAbstractionStarter]: For program point L25(lines 25 26) no Hoare annotation was computed. [2019-11-26 02:58:35,527 INFO L444 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-11-26 02:58:35,527 INFO L444 ceAbstractionStarter]: For program point L17-1(lines 11 42) no Hoare annotation was computed. [2019-11-26 02:58:35,528 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-26 02:58:35,528 INFO L444 ceAbstractionStarter]: For program point L18(lines 11 42) no Hoare annotation was computed. [2019-11-26 02:58:35,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:58:35 BoogieIcfgContainer [2019-11-26 02:58:35,544 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:58:35,544 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:58:35,544 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:58:35,545 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:58:35,545 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:58:23" (3/4) ... [2019-11-26 02:58:35,548 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:58:35,556 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2019-11-26 02:58:35,556 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-26 02:58:35,557 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:58:35,603 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a13e8e7a-e5d0-46aa-9f20-19fb2e8e1e29/bin/utaipan/witness.graphml [2019-11-26 02:58:35,604 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:58:35,605 INFO L168 Benchmark]: Toolchain (without parser) took 13369.47 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 280.0 MB). Free memory was 950.1 MB in the beginning and 1.3 GB in the end (delta: -308.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:58:35,605 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:58:35,606 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -228.6 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:58:35,606 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:58:35,606 INFO L168 Benchmark]: Boogie Preprocessor took 33.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:58:35,607 INFO L168 Benchmark]: RCFGBuilder took 392.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:58:35,607 INFO L168 Benchmark]: TraceAbstraction took 12534.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 97.5 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -107.6 MB). Peak memory consumption was 312.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:58:35,608 INFO L168 Benchmark]: Witness Printer took 59.41 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:58:35,610 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 306.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 182.5 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -228.6 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.82 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 392.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 12534.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 97.5 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -107.6 MB). Peak memory consumption was 312.6 MB. Max. memory is 11.5 GB. * Witness Printer took 59.41 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((buf + 1 <= buflim && 1 == cond) && 0 <= buf) && buflim + in + 3 <= buf + inlen) && 0 <= in) && buflim + 2 == bufferlen - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((2 <= bufferlen && buf + 1 <= bufferlen) && !(0 == cond)) && 0 <= buf) && 0 <= in - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((buf + 2 <= bufferlen && !(0 == cond)) && 0 <= buf) && 0 <= in - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((!(0 == cond) && 0 <= buf) && buflim + in + 3 <= buf + inlen) && 0 <= in) && buflim + 2 == bufferlen) && buf <= buflim - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((((buf + 1 <= buflim && 1 == cond) && 0 <= buf) && buflim + in + 3 <= buf + inlen) && 0 <= in) && buflim + 2 == bufferlen - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: ((buf + 2 <= bufferlen && !(0 == cond)) && 0 <= buf) && 0 <= in - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3]: Loop Invariant Derived loop invariant: (((((in <= 0 && 0 == buf) && bufferlen < inlen) && 0 <= in) && buflim + 2 == bufferlen) && buf <= buflim) || (((((1 == cond && buflim + in + 3 <= buf + inlen) && 0 <= buf) && 0 <= in) && buflim + 2 == bufferlen) && buf <= buflim) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 41 locations, 8 error locations. Result: SAFE, OverallTime: 12.4s, OverallIterations: 10, TraceHistogramMax: 4, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, HoareTripleCheckerStatistics: 271 SDtfs, 869 SDslu, 654 SDs, 0 SdLazy, 797 SolverSat, 478 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 532 GetRequests, 272 SyntacticMatches, 30 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4055 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=70occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 42 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 44 NumberOfFragments, 184 HoareAnnotationTreeSize, 9 FomulaSimplifications, 4497 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 541 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 331 NumberOfCodeBlocks, 311 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 443 ConstructedInterpolants, 0 QuantifiedInterpolants, 95873 SizeOfPredicates, 37 NumberOfNonLiveVariables, 332 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 18 InterpolantComputations, 6 PerfectInterpolantSequences, 39/234 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...