./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9396cba5-c36c-4ccb-b29a-9bae931bf721/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9396cba5-c36c-4ccb-b29a-9bae931bf721/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9396cba5-c36c-4ccb-b29a-9bae931bf721/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9396cba5-c36c-4ccb-b29a-9bae931bf721/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9396cba5-c36c-4ccb-b29a-9bae931bf721/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9396cba5-c36c-4ccb-b29a-9bae931bf721/bin-2019/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.23-1dbac8b [2018-11-10 07:13:10,313 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 07:13:10,314 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 07:13:10,321 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 07:13:10,321 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 07:13:10,322 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 07:13:10,323 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 07:13:10,324 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 07:13:10,325 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 07:13:10,326 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 07:13:10,326 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 07:13:10,327 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 07:13:10,327 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 07:13:10,328 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 07:13:10,329 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 07:13:10,329 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 07:13:10,330 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 07:13:10,331 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 07:13:10,333 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 07:13:10,334 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 07:13:10,335 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 07:13:10,336 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 07:13:10,337 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 07:13:10,338 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 07:13:10,338 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 07:13:10,338 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 07:13:10,339 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 07:13:10,340 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 07:13:10,340 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 07:13:10,341 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 07:13:10,341 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 07:13:10,342 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 07:13:10,342 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 07:13:10,342 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 07:13:10,343 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 07:13:10,344 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 07:13:10,344 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9396cba5-c36c-4ccb-b29a-9bae931bf721/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 07:13:10,354 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 07:13:10,355 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 07:13:10,355 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 07:13:10,356 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 07:13:10,356 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 07:13:10,356 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 07:13:10,356 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 07:13:10,356 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 07:13:10,356 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 07:13:10,356 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 07:13:10,356 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 07:13:10,357 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 07:13:10,357 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 07:13:10,357 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 07:13:10,357 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 07:13:10,358 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 07:13:10,358 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 07:13:10,358 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 07:13:10,358 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 07:13:10,358 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 07:13:10,358 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 07:13:10,358 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 07:13:10,359 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 07:13:10,359 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 07:13:10,359 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 07:13:10,359 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 07:13:10,359 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 07:13:10,359 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 07:13:10,359 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 07:13:10,359 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 07:13:10,359 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 07:13:10,360 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 07:13:10,360 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 07:13:10,360 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 07:13:10,360 INFO L133 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/working_dir_9396cba5-c36c-4ccb-b29a-9bae931bf721/bin-2019/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 [2018-11-10 07:13:10,383 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 07:13:10,391 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 07:13:10,394 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 07:13:10,395 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 07:13:10,395 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 07:13:10,396 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9396cba5-c36c-4ccb-b29a-9bae931bf721/bin-2019/utaipan/../../sv-benchmarks/c/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i [2018-11-10 07:13:10,434 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9396cba5-c36c-4ccb-b29a-9bae931bf721/bin-2019/utaipan/data/fa3a690ba/0afeddd0bfad47069bd0bb3dba544190/FLAG8ec80aab2 [2018-11-10 07:13:10,832 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 07:13:10,833 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9396cba5-c36c-4ccb-b29a-9bae931bf721/sv-benchmarks/c/loop-invgen/sendmail-close-angle_true-unreach-call_true-termination.i [2018-11-10 07:13:10,838 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9396cba5-c36c-4ccb-b29a-9bae931bf721/bin-2019/utaipan/data/fa3a690ba/0afeddd0bfad47069bd0bb3dba544190/FLAG8ec80aab2 [2018-11-10 07:13:10,847 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9396cba5-c36c-4ccb-b29a-9bae931bf721/bin-2019/utaipan/data/fa3a690ba/0afeddd0bfad47069bd0bb3dba544190 [2018-11-10 07:13:10,849 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 07:13:10,850 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 07:13:10,850 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 07:13:10,850 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 07:13:10,853 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 07:13:10,853 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:13:10" (1/1) ... [2018-11-10 07:13:10,855 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@aea677a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:10, skipping insertion in model container [2018-11-10 07:13:10,855 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:13:10" (1/1) ... [2018-11-10 07:13:10,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 07:13:10,882 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 07:13:11,015 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:13:11,018 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 07:13:11,030 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 07:13:11,039 INFO L193 MainTranslator]: Completed translation [2018-11-10 07:13:11,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:11 WrapperNode [2018-11-10 07:13:11,039 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 07:13:11,040 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 07:13:11,040 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 07:13:11,040 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 07:13:11,045 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:11" (1/1) ... [2018-11-10 07:13:11,049 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:11" (1/1) ... [2018-11-10 07:13:11,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 07:13:11,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 07:13:11,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 07:13:11,053 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 07:13:11,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:11" (1/1) ... [2018-11-10 07:13:11,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:11" (1/1) ... [2018-11-10 07:13:11,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:11" (1/1) ... [2018-11-10 07:13:11,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:11" (1/1) ... [2018-11-10 07:13:11,063 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:11" (1/1) ... [2018-11-10 07:13:11,067 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:11" (1/1) ... [2018-11-10 07:13:11,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:11" (1/1) ... [2018-11-10 07:13:11,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 07:13:11,069 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 07:13:11,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 07:13:11,069 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 07:13:11,070 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9396cba5-c36c-4ccb-b29a-9bae931bf721/bin-2019/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 [2018-11-10 07:13:11,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 07:13:11,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 07:13:11,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 07:13:11,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 07:13:11,142 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 07:13:11,142 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 07:13:11,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 07:13:11,142 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 07:13:11,279 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 07:13:11,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:13:11 BoogieIcfgContainer [2018-11-10 07:13:11,280 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 07:13:11,280 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 07:13:11,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 07:13:11,283 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 07:13:11,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:13:10" (1/3) ... [2018-11-10 07:13:11,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c5038b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:13:11, skipping insertion in model container [2018-11-10 07:13:11,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:13:11" (2/3) ... [2018-11-10 07:13:11,284 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c5038b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:13:11, skipping insertion in model container [2018-11-10 07:13:11,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:13:11" (3/3) ... [2018-11-10 07:13:11,285 INFO L112 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle_true-unreach-call_true-termination.i [2018-11-10 07:13:11,292 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 07:13:11,297 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 07:13:11,308 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 07:13:11,330 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 07:13:11,331 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 07:13:11,331 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 07:13:11,331 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 07:13:11,331 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 07:13:11,331 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 07:13:11,331 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 07:13:11,331 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 07:13:11,342 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-10 07:13:11,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 07:13:11,346 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:13:11,346 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:13:11,348 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:13:11,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:13:11,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1538012201, now seen corresponding path program 1 times [2018-11-10 07:13:11,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:13:11,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:11,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:13:11,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:11,387 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:13:11,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:13:11,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:13:11,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:13:11,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 07:13:11,434 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:13:11,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 07:13:11,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 07:13:11,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 07:13:11,447 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-11-10 07:13:11,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:13:11,465 INFO L93 Difference]: Finished difference Result 63 states and 94 transitions. [2018-11-10 07:13:11,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 07:13:11,466 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-10 07:13:11,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:13:11,472 INFO L225 Difference]: With dead ends: 63 [2018-11-10 07:13:11,472 INFO L226 Difference]: Without dead ends: 30 [2018-11-10 07:13:11,475 INFO L605 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 [2018-11-10 07:13:11,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-10 07:13:11,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-10 07:13:11,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-10 07:13:11,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2018-11-10 07:13:11,504 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 14 [2018-11-10 07:13:11,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:13:11,505 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-11-10 07:13:11,505 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 07:13:11,505 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2018-11-10 07:13:11,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-10 07:13:11,507 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:13:11,507 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:13:11,507 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:13:11,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:13:11,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1856547447, now seen corresponding path program 1 times [2018-11-10 07:13:11,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:13:11,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:11,512 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:13:11,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:11,512 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:13:11,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:13:11,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:13:11,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 07:13:11,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 07:13:11,575 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:13:11,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 07:13:11,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 07:13:11,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 07:13:11,577 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand 5 states. [2018-11-10 07:13:11,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:13:11,657 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-11-10 07:13:11,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 07:13:11,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-10 07:13:11,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:13:11,659 INFO L225 Difference]: With dead ends: 36 [2018-11-10 07:13:11,659 INFO L226 Difference]: Without dead ends: 34 [2018-11-10 07:13:11,659 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 07:13:11,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-10 07:13:11,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-11-10 07:13:11,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-10 07:13:11,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-11-10 07:13:11,667 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 16 [2018-11-10 07:13:11,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:13:11,667 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-11-10 07:13:11,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 07:13:11,667 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-11-10 07:13:11,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 07:13:11,667 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:13:11,668 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:13:11,668 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:13:11,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:13:11,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1929535109, now seen corresponding path program 1 times [2018-11-10 07:13:11,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:13:11,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:11,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:13:11,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:11,669 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:13:11,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:13:11,755 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 07:13:11,755 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:13:11,755 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:13:11,756 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-11-10 07:13:11,758 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [27], [29], [32], [59], [62], [64], [67], [69], [70], [71], [72], [82], [83], [84] [2018-11-10 07:13:11,803 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 07:13:11,804 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 07:13:11,915 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 07:13:11,916 INFO L272 AbstractInterpreter]: Visited 19 different actions 23 times. Never merged. Never widened. Never found a fixpoint. Largest state had 8 variables. [2018-11-10 07:13:11,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:13:11,920 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 07:13:11,990 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 64% of their original sizes. [2018-11-10 07:13:11,990 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 07:13:12,084 INFO L415 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-11-10 07:13:12,084 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 07:13:12,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:13:12,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2018-11-10 07:13:12,085 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:13:12,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-10 07:13:12,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 07:13:12,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-10 07:13:12,086 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 10 states. [2018-11-10 07:13:12,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:13:12,458 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2018-11-10 07:13:12,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 07:13:12,459 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-11-10 07:13:12,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:13:12,460 INFO L225 Difference]: With dead ends: 54 [2018-11-10 07:13:12,460 INFO L226 Difference]: Without dead ends: 52 [2018-11-10 07:13:12,460 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-10 07:13:12,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-10 07:13:12,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2018-11-10 07:13:12,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-10 07:13:12,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2018-11-10 07:13:12,471 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 21 [2018-11-10 07:13:12,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:13:12,472 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2018-11-10 07:13:12,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-10 07:13:12,472 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2018-11-10 07:13:12,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-10 07:13:12,473 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:13:12,473 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:13:12,473 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:13:12,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:13:12,474 INFO L82 PathProgramCache]: Analyzing trace with hash -1060690802, now seen corresponding path program 1 times [2018-11-10 07:13:12,474 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:13:12,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:12,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:13:12,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:12,475 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:13:12,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:13:12,528 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 07:13:12,529 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:13:12,529 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:13:12,529 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-11-10 07:13:12,529 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [27], [29], [34], [39], [42], [44], [59], [62], [64], [67], [69], [70], [71], [72], [74], [75], [76], [77], [78] [2018-11-10 07:13:12,530 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 07:13:12,530 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 07:13:12,558 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 07:13:12,558 INFO L272 AbstractInterpreter]: Visited 24 different actions 32 times. Never merged. Never widened. Never found a fixpoint. Largest state had 10 variables. [2018-11-10 07:13:12,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:13:12,561 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 07:13:12,614 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 57.45% of their original sizes. [2018-11-10 07:13:12,614 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 07:13:12,822 INFO L415 sIntCurrentIteration]: We unified 28 AI predicates to 28 [2018-11-10 07:13:12,822 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 07:13:12,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:13:12,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [8] total 20 [2018-11-10 07:13:12,822 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:13:12,823 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 07:13:12,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 07:13:12,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=143, Unknown=0, NotChecked=0, Total=182 [2018-11-10 07:13:12,824 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand 14 states. [2018-11-10 07:13:13,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:13:13,507 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2018-11-10 07:13:13,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 07:13:13,507 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2018-11-10 07:13:13,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:13:13,509 INFO L225 Difference]: With dead ends: 76 [2018-11-10 07:13:13,509 INFO L226 Difference]: Without dead ends: 74 [2018-11-10 07:13:13,509 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 36 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=318, Unknown=0, NotChecked=0, Total=420 [2018-11-10 07:13:13,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-10 07:13:13,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 57. [2018-11-10 07:13:13,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-10 07:13:13,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2018-11-10 07:13:13,522 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 29 [2018-11-10 07:13:13,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:13:13,522 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-11-10 07:13:13,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 07:13:13,523 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2018-11-10 07:13:13,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-10 07:13:13,524 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:13:13,524 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:13:13,525 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:13:13,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:13:13,525 INFO L82 PathProgramCache]: Analyzing trace with hash 578348401, now seen corresponding path program 1 times [2018-11-10 07:13:13,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:13:13,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:13,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:13:13,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:13,526 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:13:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:13:13,619 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 07:13:13,619 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:13:13,619 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:13:13,620 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-11-10 07:13:13,620 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [27], [29], [32], [52], [59], [62], [64], [67], [69], [70], [71], [72], [82], [83], [84], [85], [86], [87], [88] [2018-11-10 07:13:13,621 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 07:13:13,621 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 07:13:13,637 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 07:13:13,637 INFO L272 AbstractInterpreter]: Visited 24 different actions 36 times. Never merged. Never widened. Never found a fixpoint. Largest state had 9 variables. [2018-11-10 07:13:13,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:13:13,639 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 07:13:13,666 INFO L227 lantSequenceWeakener]: Weakened 19 states. On average, predicates are now at 69.47% of their original sizes. [2018-11-10 07:13:13,666 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 07:13:13,738 INFO L415 sIntCurrentIteration]: We unified 31 AI predicates to 31 [2018-11-10 07:13:13,738 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 07:13:13,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:13:13,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [9] total 18 [2018-11-10 07:13:13,739 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:13:13,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 07:13:13,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 07:13:13,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-10 07:13:13,739 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 11 states. [2018-11-10 07:13:14,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:13:14,157 INFO L93 Difference]: Finished difference Result 81 states and 98 transitions. [2018-11-10 07:13:14,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 07:13:14,157 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 32 [2018-11-10 07:13:14,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:13:14,158 INFO L225 Difference]: With dead ends: 81 [2018-11-10 07:13:14,158 INFO L226 Difference]: Without dead ends: 74 [2018-11-10 07:13:14,158 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 37 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2018-11-10 07:13:14,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-10 07:13:14,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 72. [2018-11-10 07:13:14,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-10 07:13:14,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 84 transitions. [2018-11-10 07:13:14,168 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 84 transitions. Word has length 32 [2018-11-10 07:13:14,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:13:14,168 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 84 transitions. [2018-11-10 07:13:14,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 07:13:14,168 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 84 transitions. [2018-11-10 07:13:14,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-10 07:13:14,169 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:13:14,169 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:13:14,169 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:13:14,170 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:13:14,170 INFO L82 PathProgramCache]: Analyzing trace with hash 434465614, now seen corresponding path program 1 times [2018-11-10 07:13:14,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:13:14,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:14,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:13:14,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:14,171 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:13:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:13:14,248 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-10 07:13:14,248 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:13:14,248 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:13:14,248 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 35 with the following transitions: [2018-11-10 07:13:14,248 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [27], [29], [34], [39], [42], [44], [59], [62], [64], [67], [69], [70], [71], [72], [74], [75], [76], [77], [78], [79], [80] [2018-11-10 07:13:14,250 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 07:13:14,250 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 07:13:14,263 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 07:13:14,263 INFO L272 AbstractInterpreter]: Visited 26 different actions 38 times. Never merged. Never widened. Never found a fixpoint. Largest state had 10 variables. [2018-11-10 07:13:14,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:13:14,264 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 07:13:14,293 INFO L227 lantSequenceWeakener]: Weakened 16 states. On average, predicates are now at 66.25% of their original sizes. [2018-11-10 07:13:14,293 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 07:13:14,421 INFO L415 sIntCurrentIteration]: We unified 33 AI predicates to 33 [2018-11-10 07:13:14,421 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 07:13:14,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:13:14,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [10] total 22 [2018-11-10 07:13:14,422 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:13:14,422 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-10 07:13:14,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-10 07:13:14,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2018-11-10 07:13:14,422 INFO L87 Difference]: Start difference. First operand 72 states and 84 transitions. Second operand 14 states. [2018-11-10 07:13:14,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:13:14,902 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2018-11-10 07:13:14,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 07:13:14,902 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-11-10 07:13:14,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:13:14,903 INFO L225 Difference]: With dead ends: 83 [2018-11-10 07:13:14,903 INFO L226 Difference]: Without dead ends: 81 [2018-11-10 07:13:14,904 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2018-11-10 07:13:14,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-10 07:13:14,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2018-11-10 07:13:14,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-10 07:13:14,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2018-11-10 07:13:14,914 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 34 [2018-11-10 07:13:14,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:13:14,915 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2018-11-10 07:13:14,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-10 07:13:14,915 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-11-10 07:13:14,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-10 07:13:14,917 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:13:14,917 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:13:14,917 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:13:14,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:13:14,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1684026049, now seen corresponding path program 1 times [2018-11-10 07:13:14,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:13:14,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:14,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:13:14,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:14,919 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:13:14,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:13:15,002 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 17 proven. 28 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2018-11-10 07:13:15,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:13:15,002 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:13:15,003 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2018-11-10 07:13:15,003 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [27], [29], [34], [39], [42], [44], [59], [62], [64], [67], [69], [70], [71], [72], [74], [75], [76], [77], [78], [79], [80], [81] [2018-11-10 07:13:15,004 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 07:13:15,004 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 07:13:15,084 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 07:13:15,084 INFO L272 AbstractInterpreter]: Visited 27 different actions 249 times. Merged at 10 different actions 70 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 10 variables. [2018-11-10 07:13:15,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:13:15,087 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 07:13:15,133 INFO L227 lantSequenceWeakener]: Weakened 28 states. On average, predicates are now at 68.81% of their original sizes. [2018-11-10 07:13:15,134 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 07:13:15,423 INFO L415 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2018-11-10 07:13:15,423 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 07:13:15,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:13:15,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [8] total 25 [2018-11-10 07:13:15,424 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:13:15,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-10 07:13:15,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-10 07:13:15,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2018-11-10 07:13:15,424 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand 19 states. [2018-11-10 07:13:16,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:13:16,290 INFO L93 Difference]: Finished difference Result 86 states and 95 transitions. [2018-11-10 07:13:16,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 07:13:16,290 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2018-11-10 07:13:16,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:13:16,292 INFO L225 Difference]: With dead ends: 86 [2018-11-10 07:13:16,292 INFO L226 Difference]: Without dead ends: 82 [2018-11-10 07:13:16,293 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 62 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2018-11-10 07:13:16,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-10 07:13:16,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-11-10 07:13:16,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-10 07:13:16,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 91 transitions. [2018-11-10 07:13:16,304 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 91 transitions. Word has length 55 [2018-11-10 07:13:16,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:13:16,305 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 91 transitions. [2018-11-10 07:13:16,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-10 07:13:16,305 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 91 transitions. [2018-11-10 07:13:16,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-10 07:13:16,306 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:13:16,306 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:13:16,306 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:13:16,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:13:16,306 INFO L82 PathProgramCache]: Analyzing trace with hash -2058374368, now seen corresponding path program 1 times [2018-11-10 07:13:16,306 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:13:16,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:16,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:13:16,307 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:16,310 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:13:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:13:16,423 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 24 proven. 23 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-10 07:13:16,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:13:16,424 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:13:16,424 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 59 with the following transitions: [2018-11-10 07:13:16,424 INFO L202 CegarAbsIntRunner]: [0], [4], [7], [13], [19], [23], [27], [29], [32], [34], [39], [42], [44], [52], [59], [62], [64], [67], [69], [70], [71], [72], [74], [75], [76], [77], [78], [79], [80], [81], [82], [83], [84], [85], [86], [87], [88] [2018-11-10 07:13:16,425 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 07:13:16,425 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 07:13:16,543 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 07:13:16,543 INFO L272 AbstractInterpreter]: Visited 36 different actions 449 times. Merged at 15 different actions 105 times. Widened at 1 different actions 3 times. Found 1 fixpoints after 1 different actions. Largest state had 11 variables. [2018-11-10 07:13:16,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:13:16,560 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 07:13:16,598 INFO L227 lantSequenceWeakener]: Weakened 36 states. On average, predicates are now at 66.39% of their original sizes. [2018-11-10 07:13:16,598 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 07:13:16,860 INFO L415 sIntCurrentIteration]: We unified 57 AI predicates to 57 [2018-11-10 07:13:16,860 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 07:13:16,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 07:13:16,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [11] total 25 [2018-11-10 07:13:16,861 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 07:13:16,861 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 07:13:16,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 07:13:16,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-11-10 07:13:16,862 INFO L87 Difference]: Start difference. First operand 82 states and 91 transitions. Second operand 16 states. [2018-11-10 07:13:17,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:13:17,569 INFO L93 Difference]: Finished difference Result 115 states and 129 transitions. [2018-11-10 07:13:17,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 07:13:17,569 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2018-11-10 07:13:17,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:13:17,570 INFO L225 Difference]: With dead ends: 115 [2018-11-10 07:13:17,570 INFO L226 Difference]: Without dead ends: 102 [2018-11-10 07:13:17,571 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=282, Unknown=0, NotChecked=0, Total=380 [2018-11-10 07:13:17,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-10 07:13:17,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-11-10 07:13:17,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-10 07:13:17,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 111 transitions. [2018-11-10 07:13:17,596 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 111 transitions. Word has length 58 [2018-11-10 07:13:17,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:13:17,597 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 111 transitions. [2018-11-10 07:13:17,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 07:13:17,597 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 111 transitions. [2018-11-10 07:13:17,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-10 07:13:17,598 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 07:13:17,598 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 07:13:17,598 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 07:13:17,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 07:13:17,598 INFO L82 PathProgramCache]: Analyzing trace with hash -2122664945, now seen corresponding path program 2 times [2018-11-10 07:13:17,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 07:13:17,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:17,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 07:13:17,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 07:13:17,600 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 07:13:17,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 07:13:17,752 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 44 proven. 48 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2018-11-10 07:13:17,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:13:17,753 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 07:13:17,753 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 07:13:17,753 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 07:13:17,753 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 07:13:17,754 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9396cba5-c36c-4ccb-b29a-9bae931bf721/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 07:13:17,759 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 07:13:17,760 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 07:13:17,787 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-10 07:13:17,787 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 07:13:17,793 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 07:13:18,081 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 68 proven. 20 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2018-11-10 07:13:18,082 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 07:13:18,347 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 68 proven. 20 refuted. 0 times theorem prover too weak. 170 trivial. 0 not checked. [2018-11-10 07:13:18,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 07:13:18,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 21 [2018-11-10 07:13:18,364 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 07:13:18,364 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-10 07:13:18,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-10 07:13:18,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-11-10 07:13:18,365 INFO L87 Difference]: Start difference. First operand 100 states and 111 transitions. Second operand 17 states. [2018-11-10 07:13:18,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 07:13:18,696 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2018-11-10 07:13:18,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 07:13:18,697 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 84 [2018-11-10 07:13:18,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 07:13:18,697 INFO L225 Difference]: With dead ends: 104 [2018-11-10 07:13:18,697 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 07:13:18,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 157 SyntacticMatches, 6 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2018-11-10 07:13:18,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 07:13:18,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 07:13:18,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 07:13:18,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 07:13:18,699 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 84 [2018-11-10 07:13:18,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 07:13:18,699 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 07:13:18,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-10 07:13:18,699 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 07:13:18,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 07:13:18,703 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 07:13:18,788 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:13:19,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 07:13:19,524 WARN L179 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 30 [2018-11-10 07:13:19,813 WARN L179 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 31 [2018-11-10 07:13:20,283 WARN L179 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 33 [2018-11-10 07:13:20,821 WARN L179 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 33 [2018-11-10 07:13:21,062 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 31 [2018-11-10 07:13:21,221 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-10 07:13:21,221 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:13:21,221 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 07:13:21,221 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 07:13:21,221 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 07:13:21,221 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 07:13:21,221 INFO L421 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse3 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse3)) (.cse2 (<= (+ main_~buflim~0 3) main_~inlen~0)) (.cse1 (<= .cse3 main_~bufferlen~0))) (or (and .cse0 (= main_~buf~0 0) (= main_~in~0 0) .cse1 .cse2 (<= 1 (+ main_~in~0 main_~buflim~0)) (<= main_~inlen~0 (+ main_~buf~0 2147483647))) (and (<= main_~in~0 main_~buf~0) .cse0 (<= (+ main_~buf~0 3) main_~bufferlen~0) (<= main_~buf~0 main_~in~0) .cse2 .cse1 (<= 2 (* 2 main_~in~0)) (<= (* 2 main_~inlen~0) 4294967294))))) [2018-11-10 07:13:21,221 INFO L421 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse3 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse3)) (.cse2 (<= (+ main_~buflim~0 3) main_~inlen~0)) (.cse1 (<= .cse3 main_~bufferlen~0))) (or (and .cse0 (= main_~buf~0 0) (= main_~in~0 0) .cse1 .cse2 (<= 1 (+ main_~in~0 main_~buflim~0)) (<= main_~inlen~0 (+ main_~buf~0 2147483647))) (and (<= main_~in~0 main_~buf~0) .cse0 (<= (+ main_~buf~0 3) main_~bufferlen~0) (<= main_~buf~0 main_~in~0) .cse2 .cse1 (<= 2 (* 2 main_~in~0)) (<= (* 2 main_~inlen~0) 4294967294))))) [2018-11-10 07:13:21,222 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 42) no Hoare annotation was computed. [2018-11-10 07:13:21,222 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2018-11-10 07:13:21,222 INFO L425 ceAbstractionStarter]: For program point L23-2(lines 23 34) no Hoare annotation was computed. [2018-11-10 07:13:21,222 INFO L425 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2018-11-10 07:13:21,222 INFO L421 ceAbstractionStarter]: At program point L23-4(lines 23 34) the Hoare annotation is: (let ((.cse0 (* 2 main_~inlen~0)) (.cse5 (+ main_~buflim~0 2))) (let ((.cse1 (<= main_~bufferlen~0 .cse5)) (.cse2 (<= .cse5 main_~bufferlen~0)) (.cse3 (<= .cse0 4294967294)) (.cse4 (<= (+ main_~buf~0 2) main_~bufferlen~0))) (or (and (<= 2 .cse0) .cse1 (= main_~in~0 0) .cse2 .cse3 .cse4 (= main_~buf~0 0) (<= (+ main_~in~0 main_~buflim~0) 2147483644)) (and (<= main_~in~0 main_~buf~0) .cse1 (<= main_~buf~0 main_~in~0) (<= (+ main_~buflim~0 3) main_~inlen~0) .cse2 (<= 2 (* 2 main_~in~0)) .cse3 .cse4)))) [2018-11-10 07:13:21,222 INFO L425 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-11-10 07:13:21,222 INFO L421 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (let ((.cse0 (+ main_~buflim~0 2))) (and (<= (* 2 main_~inlen~0) 4294967294) (<= main_~in~0 main_~buf~0) (<= main_~bufferlen~0 .cse0) (<= main_~buf~0 main_~in~0) (<= (+ main_~buflim~0 3) main_~inlen~0) (<= .cse0 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 2 (* 2 main_~in~0)))) [2018-11-10 07:13:21,222 INFO L421 ceAbstractionStarter]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse0 (+ main_~buflim~0 2))) (and (<= (* 2 main_~inlen~0) 4294967294) (<= main_~in~0 main_~buf~0) (<= main_~bufferlen~0 .cse0) (<= main_~buf~0 main_~in~0) (<= (+ main_~buflim~0 3) main_~inlen~0) (<= .cse0 main_~bufferlen~0) (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 2 (* 2 main_~in~0)))) [2018-11-10 07:13:21,222 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-10 07:13:21,222 INFO L428 ceAbstractionStarter]: At program point L41(lines 11 42) the Hoare annotation is: true [2018-11-10 07:13:21,223 INFO L421 ceAbstractionStarter]: At program point L33(lines 23 34) the Hoare annotation is: (let ((.cse4 (+ main_~buflim~0 2))) (let ((.cse0 (<= main_~bufferlen~0 .cse4)) (.cse1 (<= (+ main_~buflim~0 3) main_~inlen~0)) (.cse2 (<= .cse4 main_~bufferlen~0)) (.cse3 (<= (+ main_~buf~0 2) main_~bufferlen~0))) (or (and .cse0 (= main_~buf~0 0) (= main_~in~0 0) .cse1 .cse2 (<= main_~inlen~0 (+ main_~buf~0 2147483647)) .cse3) (and (<= main_~in~0 main_~buf~0) .cse0 (<= main_~buf~0 main_~in~0) .cse1 .cse2 (<= 2 (* 2 main_~in~0)) (<= (* 2 main_~inlen~0) 4294967294) .cse3)))) [2018-11-10 07:13:21,223 INFO L425 ceAbstractionStarter]: For program point L25(lines 25 26) no Hoare annotation was computed. [2018-11-10 07:13:21,223 INFO L425 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2018-11-10 07:13:21,223 INFO L425 ceAbstractionStarter]: For program point L17-1(lines 11 42) no Hoare annotation was computed. [2018-11-10 07:13:21,223 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 42) no Hoare annotation was computed. [2018-11-10 07:13:21,223 INFO L421 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (let ((.cse0 (* 2 main_~inlen~0)) (.cse8 (* 2 main_~in~0))) (let ((.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse4 (<= 2 .cse8)) (.cse5 (<= .cse8 4294967288)) (.cse1 (<= .cse0 4294967294)) (.cse6 (<= (+ main_~buf~0 1) main_~bufferlen~0))) (or (let ((.cse2 (+ main_~buf~0 main_~bufferlen~0))) (and (<= 2 .cse0) (= main_~buf~0 1) .cse1 (<= 3 .cse2) (<= .cse2 2147483647))) (and .cse3 .cse4 .cse5 .cse1 .cse6 (<= 2 (* 2 main_~buf~0))) (let ((.cse7 (+ main_~buflim~0 2))) (and .cse3 (<= .cse7 main_~bufferlen~0) .cse4 .cse5 .cse1 .cse6 (<= main_~bufferlen~0 .cse7) (<= 0 main_~buf~0) (<= 2 main_~bufferlen~0)))))) [2018-11-10 07:13:21,223 INFO L421 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (let ((.cse0 (* 2 main_~inlen~0)) (.cse8 (* 2 main_~in~0))) (let ((.cse3 (<= (+ main_~bufferlen~0 1) main_~inlen~0)) (.cse4 (<= 2 .cse8)) (.cse5 (<= .cse8 4294967288)) (.cse1 (<= .cse0 4294967294)) (.cse6 (<= (+ main_~buf~0 1) main_~bufferlen~0))) (or (let ((.cse2 (+ main_~buf~0 main_~bufferlen~0))) (and (<= 2 .cse0) (= main_~buf~0 1) .cse1 (<= 3 .cse2) (<= .cse2 2147483647))) (and .cse3 .cse4 .cse5 .cse1 .cse6 (<= 2 (* 2 main_~buf~0))) (let ((.cse7 (+ main_~buflim~0 2))) (and .cse3 (<= .cse7 main_~bufferlen~0) .cse4 .cse5 .cse1 .cse6 (<= main_~bufferlen~0 .cse7) (<= 0 main_~buf~0) (<= 2 main_~bufferlen~0)))))) [2018-11-10 07:13:21,223 INFO L425 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2018-11-10 07:13:21,223 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 42) the Hoare annotation is: true [2018-11-10 07:13:21,223 INFO L425 ceAbstractionStarter]: For program point L18(lines 11 42) no Hoare annotation was computed. [2018-11-10 07:13:21,223 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-10 07:13:21,224 INFO L421 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (* 2 main_~inlen~0)) (.cse5 (+ main_~buflim~0 2))) (let ((.cse1 (<= main_~bufferlen~0 .cse5)) (.cse2 (<= .cse5 main_~bufferlen~0)) (.cse3 (<= .cse0 4294967294)) (.cse4 (<= (+ main_~buf~0 2) main_~bufferlen~0))) (or (and (<= 2 .cse0) .cse1 (= main_~in~0 0) .cse2 .cse3 .cse4 (= main_~buf~0 0) (<= (+ main_~in~0 main_~buflim~0) 2147483644)) (and (<= main_~in~0 main_~buf~0) .cse1 (<= main_~buf~0 main_~in~0) (<= (+ main_~buflim~0 3) main_~inlen~0) .cse2 (<= 2 (* 2 main_~in~0)) .cse3 .cse4)))) [2018-11-10 07:13:21,224 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-10 07:13:21,224 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-10 07:13:21,224 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-10 07:13:21,224 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-10 07:13:21,224 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-10 07:13:21,224 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-10 07:13:21,233 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:13:21 BoogieIcfgContainer [2018-11-10 07:13:21,233 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 07:13:21,233 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 07:13:21,233 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 07:13:21,233 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 07:13:21,234 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 07:13:11" (3/4) ... [2018-11-10 07:13:21,237 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 07:13:21,240 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 07:13:21,241 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 07:13:21,241 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-10 07:13:21,243 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2018-11-10 07:13:21,243 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-11-10 07:13:21,244 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 07:13:21,274 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9396cba5-c36c-4ccb-b29a-9bae931bf721/bin-2019/utaipan/witness.graphml [2018-11-10 07:13:21,275 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 07:13:21,275 INFO L168 Benchmark]: Toolchain (without parser) took 10425.95 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 379.6 MB). Free memory was 958.5 MB in the beginning and 1.0 GB in the end (delta: -44.2 MB). Peak memory consumption was 335.4 MB. Max. memory is 11.5 GB. [2018-11-10 07:13:21,275 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:13:21,276 INFO L168 Benchmark]: CACSL2BoogieTranslator took 189.42 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 947.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:13:21,276 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.85 ms. Allocated memory is still 1.0 GB. Free memory is still 947.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 07:13:21,276 INFO L168 Benchmark]: Boogie Preprocessor took 15.89 ms. Allocated memory is still 1.0 GB. Free memory was 947.7 MB in the beginning and 945.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-10 07:13:21,276 INFO L168 Benchmark]: RCFGBuilder took 210.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 945.1 MB in the beginning and 1.1 GB in the end (delta: -182.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2018-11-10 07:13:21,277 INFO L168 Benchmark]: TraceAbstraction took 9952.53 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 237.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 124.2 MB). Peak memory consumption was 547.1 MB. Max. memory is 11.5 GB. [2018-11-10 07:13:21,277 INFO L168 Benchmark]: Witness Printer took 41.37 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 MB. Max. memory is 11.5 GB. [2018-11-10 07:13:21,279 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 189.42 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 947.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.85 ms. Allocated memory is still 1.0 GB. Free memory is still 947.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.89 ms. Allocated memory is still 1.0 GB. Free memory was 947.7 MB in the beginning and 945.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 210.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 945.1 MB in the beginning and 1.1 GB in the end (delta: -182.8 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9952.53 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 237.5 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 124.2 MB). Peak memory consumption was 547.1 MB. Max. memory is 11.5 GB. * Witness Printer took 41.37 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 1.0 MB). Peak memory consumption was 1.0 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((((bufferlen <= buflim + 2 && buf == 0) && in == 0) && buflim + 3 <= inlen) && buflim + 2 <= bufferlen) && inlen <= buf + 2147483647) && buf + 2 <= bufferlen) || (((((((in <= buf && bufferlen <= buflim + 2) && buf <= in) && buflim + 3 <= inlen) && buflim + 2 <= bufferlen) && 2 <= 2 * in) && 2 * inlen <= 4294967294) && buf + 2 <= bufferlen) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 36 locations, 1 error locations. SAFE Result, 9.9s OverallTime, 9 OverallIterations, 12 TraceHistogramMax, 3.9s AutomataDifference, 0.0s DeadEndRemovalTime, 2.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 314 SDtfs, 539 SDslu, 1305 SDs, 0 SdLazy, 606 SolverSat, 585 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 12 DeclaredPredicates, 459 GetRequests, 318 SyntacticMatches, 6 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 523 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=100occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.4s AbstIntTime, 6 AbstIntIterations, 6 AbstIntStrong, 0.9108223490510488 AbsIntWeakeningRatio, 0.5201793721973094 AbsIntAvgWeakeningVarsNumRemoved, 10.506726457399104 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 28 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 50 PreInvPairs, 83 NumberOfFragments, 636 HoareAnnotationTreeSize, 50 FomulaSimplifications, 9449 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 15 FomulaSimplificationsInter, 3955 FormulaSimplificationTreeSizeReductionInter, 2.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 427 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 500 ConstructedInterpolants, 0 QuantifiedInterpolants, 141603 SizeOfPredicates, 8 NumberOfNonLiveVariables, 129 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 844/1002 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...