./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec11_product10.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec11_product10.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f4763c2b4c908cc214cd1281e5c0202db2011511 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 00:13:02,694 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 00:13:02,697 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 00:13:02,718 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 00:13:02,719 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 00:13:02,720 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 00:13:02,721 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 00:13:02,724 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 00:13:02,728 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 00:13:02,730 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 00:13:02,731 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 00:13:02,732 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 00:13:02,732 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 00:13:02,734 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 00:13:02,735 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 00:13:02,736 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 00:13:02,737 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 00:13:02,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 00:13:02,740 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 00:13:02,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 00:13:02,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 00:13:02,746 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 00:13:02,747 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 00:13:02,748 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 00:13:02,751 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 00:13:02,751 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 00:13:02,751 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 00:13:02,752 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 00:13:02,753 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 00:13:02,754 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 00:13:02,754 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 00:13:02,755 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 00:13:02,756 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 00:13:02,757 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 00:13:02,758 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 00:13:02,758 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 00:13:02,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 00:13:02,760 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 00:13:02,760 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 00:13:02,761 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 00:13:02,762 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 00:13:02,763 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 00:13:02,778 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 00:13:02,778 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 00:13:02,780 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 00:13:02,780 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 00:13:02,780 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 00:13:02,781 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 00:13:02,781 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 00:13:02,781 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 00:13:02,781 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 00:13:02,782 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 00:13:02,782 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 00:13:02,782 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 00:13:02,782 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 00:13:02,783 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 00:13:02,783 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 00:13:02,783 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 00:13:02,784 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 00:13:02,784 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 00:13:02,784 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 00:13:02,784 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 00:13:02,785 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 00:13:02,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:13:02,785 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 00:13:02,786 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 00:13:02,786 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 00:13:02,786 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 00:13:02,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 00:13:02,787 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 00:13:02,787 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 -> f4763c2b4c908cc214cd1281e5c0202db2011511 [2019-11-28 00:13:03,110 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 00:13:03,124 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 00:13:03,127 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 00:13:03,129 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 00:13:03,129 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 00:13:03,130 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec11_product10.cil.c [2019-11-28 00:13:03,192 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99cdd6249/e4d87d50af394ff5857250721f1ae714/FLAG0e16343b1 [2019-11-28 00:13:03,802 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 00:13:03,803 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_product10.cil.c [2019-11-28 00:13:03,836 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99cdd6249/e4d87d50af394ff5857250721f1ae714/FLAG0e16343b1 [2019-11-28 00:13:04,027 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/99cdd6249/e4d87d50af394ff5857250721f1ae714 [2019-11-28 00:13:04,032 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 00:13:04,034 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 00:13:04,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 00:13:04,038 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 00:13:04,041 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 00:13:04,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:13:04" (1/1) ... [2019-11-28 00:13:04,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b836fe5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:04, skipping insertion in model container [2019-11-28 00:13:04,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 12:13:04" (1/1) ... [2019-11-28 00:13:04,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 00:13:04,125 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 00:13:04,851 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:13:04,874 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 00:13:04,996 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 00:13:05,095 INFO L208 MainTranslator]: Completed translation [2019-11-28 00:13:05,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:05 WrapperNode [2019-11-28 00:13:05,097 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 00:13:05,098 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 00:13:05,099 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 00:13:05,099 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 00:13:05,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:05" (1/1) ... [2019-11-28 00:13:05,169 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:05" (1/1) ... [2019-11-28 00:13:05,244 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 00:13:05,244 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 00:13:05,245 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 00:13:05,245 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 00:13:05,256 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:05" (1/1) ... [2019-11-28 00:13:05,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:05" (1/1) ... [2019-11-28 00:13:05,266 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:05" (1/1) ... [2019-11-28 00:13:05,266 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:05" (1/1) ... [2019-11-28 00:13:05,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:05" (1/1) ... [2019-11-28 00:13:05,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:05" (1/1) ... [2019-11-28 00:13:05,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:05" (1/1) ... [2019-11-28 00:13:05,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 00:13:05,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 00:13:05,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 00:13:05,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 00:13:05,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 00:13:05,417 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-11-28 00:13:05,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 00:13:05,417 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-28 00:13:05,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 00:13:05,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 00:13:06,555 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 00:13:06,555 INFO L297 CfgBuilder]: Removed 155 assume(true) statements. [2019-11-28 00:13:06,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:13:06 BoogieIcfgContainer [2019-11-28 00:13:06,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 00:13:06,558 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 00:13:06,559 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 00:13:06,563 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 00:13:06,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 12:13:04" (1/3) ... [2019-11-28 00:13:06,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514791f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:13:06, skipping insertion in model container [2019-11-28 00:13:06,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 12:13:05" (2/3) ... [2019-11-28 00:13:06,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@514791f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 12:13:06, skipping insertion in model container [2019-11-28 00:13:06,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:13:06" (3/3) ... [2019-11-28 00:13:06,573 INFO L109 eAbstractionObserver]: Analyzing ICFG email_spec11_product10.cil.c [2019-11-28 00:13:06,583 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 00:13:06,591 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-28 00:13:06,604 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-28 00:13:06,637 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 00:13:06,638 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 00:13:06,638 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 00:13:06,638 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 00:13:06,638 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 00:13:06,638 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 00:13:06,639 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 00:13:06,639 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 00:13:06,668 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2019-11-28 00:13:06,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-28 00:13:06,682 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:13:06,683 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:13:06,684 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:13:06,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:13:06,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1164700804, now seen corresponding path program 1 times [2019-11-28 00:13:06,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:13:06,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571977790] [2019-11-28 00:13:06,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:13:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:13:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:13:07,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571977790] [2019-11-28 00:13:07,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:13:07,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 00:13:07,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475982221] [2019-11-28 00:13:07,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 00:13:07,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:13:07,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 00:13:07,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:13:07,184 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 2 states. [2019-11-28 00:13:07,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:13:07,259 INFO L93 Difference]: Finished difference Result 273 states and 434 transitions. [2019-11-28 00:13:07,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 00:13:07,262 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-11-28 00:13:07,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:13:07,280 INFO L225 Difference]: With dead ends: 273 [2019-11-28 00:13:07,280 INFO L226 Difference]: Without dead ends: 131 [2019-11-28 00:13:07,285 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 00:13:07,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-28 00:13:07,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2019-11-28 00:13:07,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2019-11-28 00:13:07,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 209 transitions. [2019-11-28 00:13:07,339 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 209 transitions. Word has length 32 [2019-11-28 00:13:07,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:13:07,339 INFO L462 AbstractCegarLoop]: Abstraction has 131 states and 209 transitions. [2019-11-28 00:13:07,340 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 00:13:07,340 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 209 transitions. [2019-11-28 00:13:07,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-28 00:13:07,342 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:13:07,342 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:13:07,342 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:13:07,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:13:07,343 INFO L82 PathProgramCache]: Analyzing trace with hash 649551968, now seen corresponding path program 1 times [2019-11-28 00:13:07,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:13:07,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017076390] [2019-11-28 00:13:07,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:13:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:13:07,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:13:07,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017076390] [2019-11-28 00:13:07,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:13:07,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:13:07,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705709344] [2019-11-28 00:13:07,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:13:07,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:13:07,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:13:07,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:13:07,466 INFO L87 Difference]: Start difference. First operand 131 states and 209 transitions. Second operand 3 states. [2019-11-28 00:13:07,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:13:07,537 INFO L93 Difference]: Finished difference Result 366 states and 585 transitions. [2019-11-28 00:13:07,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:13:07,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-28 00:13:07,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:13:07,541 INFO L225 Difference]: With dead ends: 366 [2019-11-28 00:13:07,541 INFO L226 Difference]: Without dead ends: 246 [2019-11-28 00:13:07,543 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:13:07,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-11-28 00:13:07,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 130. [2019-11-28 00:13:07,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-28 00:13:07,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 205 transitions. [2019-11-28 00:13:07,558 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 205 transitions. Word has length 33 [2019-11-28 00:13:07,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:13:07,559 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 205 transitions. [2019-11-28 00:13:07,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:13:07,559 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 205 transitions. [2019-11-28 00:13:07,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-28 00:13:07,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:13:07,561 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:13:07,562 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:13:07,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:13:07,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1050919469, now seen corresponding path program 1 times [2019-11-28 00:13:07,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:13:07,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509870251] [2019-11-28 00:13:07,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:13:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:13:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:13:07,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509870251] [2019-11-28 00:13:07,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:13:07,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:13:07,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045226575] [2019-11-28 00:13:07,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:13:07,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:13:07,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:13:07,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:13:07,669 INFO L87 Difference]: Start difference. First operand 130 states and 205 transitions. Second operand 3 states. [2019-11-28 00:13:07,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:13:07,711 INFO L93 Difference]: Finished difference Result 246 states and 390 transitions. [2019-11-28 00:13:07,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:13:07,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-28 00:13:07,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:13:07,713 INFO L225 Difference]: With dead ends: 246 [2019-11-28 00:13:07,714 INFO L226 Difference]: Without dead ends: 131 [2019-11-28 00:13:07,715 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:13:07,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-28 00:13:07,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2019-11-28 00:13:07,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-11-28 00:13:07,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 202 transitions. [2019-11-28 00:13:07,726 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 202 transitions. Word has length 34 [2019-11-28 00:13:07,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:13:07,727 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 202 transitions. [2019-11-28 00:13:07,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:13:07,727 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 202 transitions. [2019-11-28 00:13:07,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 00:13:07,729 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:13:07,729 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:13:07,729 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:13:07,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:13:07,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1106619438, now seen corresponding path program 1 times [2019-11-28 00:13:07,730 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:13:07,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679065790] [2019-11-28 00:13:07,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:13:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:13:07,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 00:13:07,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679065790] [2019-11-28 00:13:07,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:13:07,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 00:13:07,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047776701] [2019-11-28 00:13:07,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 00:13:07,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:13:07,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 00:13:07,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:13:07,810 INFO L87 Difference]: Start difference. First operand 130 states and 202 transitions. Second operand 3 states. [2019-11-28 00:13:07,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:13:07,827 INFO L93 Difference]: Finished difference Result 213 states and 326 transitions. [2019-11-28 00:13:07,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 00:13:07,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-28 00:13:07,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:13:07,830 INFO L225 Difference]: With dead ends: 213 [2019-11-28 00:13:07,830 INFO L226 Difference]: Without dead ends: 133 [2019-11-28 00:13:07,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 00:13:07,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-11-28 00:13:07,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-11-28 00:13:07,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-28 00:13:07,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 204 transitions. [2019-11-28 00:13:07,842 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 204 transitions. Word has length 36 [2019-11-28 00:13:07,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:13:07,842 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 204 transitions. [2019-11-28 00:13:07,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 00:13:07,843 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 204 transitions. [2019-11-28 00:13:07,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 00:13:07,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:13:07,845 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:13:07,845 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:13:07,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:13:07,845 INFO L82 PathProgramCache]: Analyzing trace with hash 646998941, now seen corresponding path program 1 times [2019-11-28 00:13:07,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:13:07,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014206411] [2019-11-28 00:13:07,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:13:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:13:08,039 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:13:08,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014206411] [2019-11-28 00:13:08,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:13:08,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 00:13:08,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384538175] [2019-11-28 00:13:08,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 00:13:08,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:13:08,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 00:13:08,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:13:08,041 INFO L87 Difference]: Start difference. First operand 132 states and 204 transitions. Second operand 10 states. [2019-11-28 00:13:08,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:13:08,931 INFO L93 Difference]: Finished difference Result 635 states and 911 transitions. [2019-11-28 00:13:08,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-28 00:13:08,932 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2019-11-28 00:13:08,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:13:08,937 INFO L225 Difference]: With dead ends: 635 [2019-11-28 00:13:08,937 INFO L226 Difference]: Without dead ends: 577 [2019-11-28 00:13:08,940 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2019-11-28 00:13:08,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-11-28 00:13:08,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 172. [2019-11-28 00:13:08,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2019-11-28 00:13:08,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 262 transitions. [2019-11-28 00:13:08,972 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 262 transitions. Word has length 41 [2019-11-28 00:13:08,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:13:08,974 INFO L462 AbstractCegarLoop]: Abstraction has 172 states and 262 transitions. [2019-11-28 00:13:08,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 00:13:08,975 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 262 transitions. [2019-11-28 00:13:08,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 00:13:08,977 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:13:08,978 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:13:08,978 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:13:08,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:13:08,979 INFO L82 PathProgramCache]: Analyzing trace with hash 96641044, now seen corresponding path program 1 times [2019-11-28 00:13:08,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:13:08,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40682040] [2019-11-28 00:13:08,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:13:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:13:09,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:13:09,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40682040] [2019-11-28 00:13:09,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:13:09,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:13:09,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249460669] [2019-11-28 00:13:09,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:13:09,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:13:09,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:13:09,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:13:09,073 INFO L87 Difference]: Start difference. First operand 172 states and 262 transitions. Second operand 5 states. [2019-11-28 00:13:09,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:13:09,190 INFO L93 Difference]: Finished difference Result 607 states and 921 transitions. [2019-11-28 00:13:09,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:13:09,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-11-28 00:13:09,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:13:09,193 INFO L225 Difference]: With dead ends: 607 [2019-11-28 00:13:09,194 INFO L226 Difference]: Without dead ends: 512 [2019-11-28 00:13:09,194 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:13:09,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2019-11-28 00:13:09,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 318. [2019-11-28 00:13:09,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-11-28 00:13:09,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 495 transitions. [2019-11-28 00:13:09,219 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 495 transitions. Word has length 42 [2019-11-28 00:13:09,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:13:09,219 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 495 transitions. [2019-11-28 00:13:09,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:13:09,220 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 495 transitions. [2019-11-28 00:13:09,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 00:13:09,221 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:13:09,221 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:13:09,221 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:13:09,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:13:09,222 INFO L82 PathProgramCache]: Analyzing trace with hash 1419304017, now seen corresponding path program 1 times [2019-11-28 00:13:09,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:13:09,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488958180] [2019-11-28 00:13:09,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:13:09,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:13:09,352 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:13:09,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488958180] [2019-11-28 00:13:09,353 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:13:09,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:13:09,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329500726] [2019-11-28 00:13:09,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:13:09,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:13:09,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:13:09,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:13:09,360 INFO L87 Difference]: Start difference. First operand 318 states and 495 transitions. Second operand 5 states. [2019-11-28 00:13:09,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:13:09,555 INFO L93 Difference]: Finished difference Result 905 states and 1328 transitions. [2019-11-28 00:13:09,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:13:09,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-11-28 00:13:09,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:13:09,561 INFO L225 Difference]: With dead ends: 905 [2019-11-28 00:13:09,561 INFO L226 Difference]: Without dead ends: 704 [2019-11-28 00:13:09,563 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:13:09,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2019-11-28 00:13:09,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 330. [2019-11-28 00:13:09,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2019-11-28 00:13:09,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 507 transitions. [2019-11-28 00:13:09,601 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 507 transitions. Word has length 42 [2019-11-28 00:13:09,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:13:09,603 INFO L462 AbstractCegarLoop]: Abstraction has 330 states and 507 transitions. [2019-11-28 00:13:09,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:13:09,603 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 507 transitions. [2019-11-28 00:13:09,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 00:13:09,605 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:13:09,605 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:13:09,606 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:13:09,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:13:09,606 INFO L82 PathProgramCache]: Analyzing trace with hash 358561176, now seen corresponding path program 1 times [2019-11-28 00:13:09,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:13:09,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136906100] [2019-11-28 00:13:09,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:13:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:13:09,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:13:09,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136906100] [2019-11-28 00:13:09,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:13:09,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-28 00:13:09,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281425990] [2019-11-28 00:13:09,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 00:13:09,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:13:09,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 00:13:09,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-28 00:13:09,742 INFO L87 Difference]: Start difference. First operand 330 states and 507 transitions. Second operand 9 states. [2019-11-28 00:13:10,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:13:10,551 INFO L93 Difference]: Finished difference Result 1536 states and 2203 transitions. [2019-11-28 00:13:10,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-11-28 00:13:10,551 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2019-11-28 00:13:10,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:13:10,559 INFO L225 Difference]: With dead ends: 1536 [2019-11-28 00:13:10,560 INFO L226 Difference]: Without dead ends: 1316 [2019-11-28 00:13:10,561 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=248, Invalid=564, Unknown=0, NotChecked=0, Total=812 [2019-11-28 00:13:10,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2019-11-28 00:13:10,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 476. [2019-11-28 00:13:10,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-11-28 00:13:10,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 719 transitions. [2019-11-28 00:13:10,629 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 719 transitions. Word has length 43 [2019-11-28 00:13:10,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:13:10,630 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 719 transitions. [2019-11-28 00:13:10,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 00:13:10,630 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 719 transitions. [2019-11-28 00:13:10,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 00:13:10,632 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:13:10,632 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:13:10,632 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:13:10,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:13:10,633 INFO L82 PathProgramCache]: Analyzing trace with hash -263872284, now seen corresponding path program 1 times [2019-11-28 00:13:10,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:13:10,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582075074] [2019-11-28 00:13:10,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:13:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:13:10,721 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:13:10,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582075074] [2019-11-28 00:13:10,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:13:10,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 00:13:10,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251745679] [2019-11-28 00:13:10,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 00:13:10,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:13:10,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 00:13:10,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 00:13:10,729 INFO L87 Difference]: Start difference. First operand 476 states and 719 transitions. Second operand 6 states. [2019-11-28 00:13:10,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:13:10,908 INFO L93 Difference]: Finished difference Result 900 states and 1331 transitions. [2019-11-28 00:13:10,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 00:13:10,909 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-11-28 00:13:10,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:13:10,913 INFO L225 Difference]: With dead ends: 900 [2019-11-28 00:13:10,913 INFO L226 Difference]: Without dead ends: 515 [2019-11-28 00:13:10,915 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-28 00:13:10,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2019-11-28 00:13:10,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 476. [2019-11-28 00:13:10,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-11-28 00:13:10,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 713 transitions. [2019-11-28 00:13:10,977 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 713 transitions. Word has length 43 [2019-11-28 00:13:10,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:13:10,977 INFO L462 AbstractCegarLoop]: Abstraction has 476 states and 713 transitions. [2019-11-28 00:13:10,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 00:13:10,978 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 713 transitions. [2019-11-28 00:13:10,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 00:13:10,980 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:13:10,980 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:13:10,985 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:13:10,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:13:10,986 INFO L82 PathProgramCache]: Analyzing trace with hash -5706846, now seen corresponding path program 1 times [2019-11-28 00:13:10,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:13:10,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476487996] [2019-11-28 00:13:10,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:13:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:13:11,075 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:13:11,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476487996] [2019-11-28 00:13:11,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:13:11,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:13:11,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803669507] [2019-11-28 00:13:11,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:13:11,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:13:11,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:13:11,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:13:11,079 INFO L87 Difference]: Start difference. First operand 476 states and 713 transitions. Second operand 5 states. [2019-11-28 00:13:11,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:13:11,250 INFO L93 Difference]: Finished difference Result 926 states and 1347 transitions. [2019-11-28 00:13:11,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:13:11,250 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-11-28 00:13:11,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:13:11,255 INFO L225 Difference]: With dead ends: 926 [2019-11-28 00:13:11,256 INFO L226 Difference]: Without dead ends: 619 [2019-11-28 00:13:11,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:13:11,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-11-28 00:13:11,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 478. [2019-11-28 00:13:11,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 478 states. [2019-11-28 00:13:11,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 712 transitions. [2019-11-28 00:13:11,315 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 712 transitions. Word has length 43 [2019-11-28 00:13:11,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:13:11,316 INFO L462 AbstractCegarLoop]: Abstraction has 478 states and 712 transitions. [2019-11-28 00:13:11,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:13:11,316 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 712 transitions. [2019-11-28 00:13:11,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 00:13:11,318 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:13:11,318 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:13:11,319 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:13:11,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:13:11,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1910056575, now seen corresponding path program 1 times [2019-11-28 00:13:11,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:13:11,320 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038540343] [2019-11-28 00:13:11,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:13:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:13:11,373 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:13:11,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038540343] [2019-11-28 00:13:11,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:13:11,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 00:13:11,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077412232] [2019-11-28 00:13:11,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 00:13:11,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:13:11,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 00:13:11,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 00:13:11,378 INFO L87 Difference]: Start difference. First operand 478 states and 712 transitions. Second operand 4 states. [2019-11-28 00:13:11,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:13:11,452 INFO L93 Difference]: Finished difference Result 712 states and 1038 transitions. [2019-11-28 00:13:11,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 00:13:11,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-11-28 00:13:11,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:13:11,455 INFO L225 Difference]: With dead ends: 712 [2019-11-28 00:13:11,455 INFO L226 Difference]: Without dead ends: 473 [2019-11-28 00:13:11,456 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:13:11,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-11-28 00:13:11,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 342. [2019-11-28 00:13:11,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2019-11-28 00:13:11,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 508 transitions. [2019-11-28 00:13:11,492 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 508 transitions. Word has length 44 [2019-11-28 00:13:11,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:13:11,492 INFO L462 AbstractCegarLoop]: Abstraction has 342 states and 508 transitions. [2019-11-28 00:13:11,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 00:13:11,492 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 508 transitions. [2019-11-28 00:13:11,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 00:13:11,493 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:13:11,493 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:13:11,494 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:13:11,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:13:11,494 INFO L82 PathProgramCache]: Analyzing trace with hash 874589663, now seen corresponding path program 1 times [2019-11-28 00:13:11,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:13:11,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638776356] [2019-11-28 00:13:11,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:13:11,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:13:11,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:13:11,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638776356] [2019-11-28 00:13:11,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:13:11,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 00:13:11,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156013972] [2019-11-28 00:13:11,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 00:13:11,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:13:11,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 00:13:11,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 00:13:11,570 INFO L87 Difference]: Start difference. First operand 342 states and 508 transitions. Second operand 5 states. [2019-11-28 00:13:11,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:13:11,792 INFO L93 Difference]: Finished difference Result 854 states and 1222 transitions. [2019-11-28 00:13:11,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 00:13:11,793 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-28 00:13:11,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:13:11,798 INFO L225 Difference]: With dead ends: 854 [2019-11-28 00:13:11,798 INFO L226 Difference]: Without dead ends: 651 [2019-11-28 00:13:11,799 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 00:13:11,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2019-11-28 00:13:11,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 340. [2019-11-28 00:13:11,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-11-28 00:13:11,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 502 transitions. [2019-11-28 00:13:11,855 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 502 transitions. Word has length 45 [2019-11-28 00:13:11,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:13:11,856 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 502 transitions. [2019-11-28 00:13:11,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 00:13:11,856 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 502 transitions. [2019-11-28 00:13:11,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-28 00:13:11,857 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 00:13:11,858 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 00:13:11,858 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 00:13:11,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 00:13:11,859 INFO L82 PathProgramCache]: Analyzing trace with hash 931847965, now seen corresponding path program 1 times [2019-11-28 00:13:11,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 00:13:11,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469165707] [2019-11-28 00:13:11,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 00:13:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 00:13:12,003 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 00:13:12,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469165707] [2019-11-28 00:13:12,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 00:13:12,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 00:13:12,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560684803] [2019-11-28 00:13:12,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 00:13:12,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 00:13:12,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 00:13:12,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 00:13:12,006 INFO L87 Difference]: Start difference. First operand 340 states and 502 transitions. Second operand 7 states. [2019-11-28 00:13:12,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 00:13:12,600 INFO L93 Difference]: Finished difference Result 1069 states and 1503 transitions. [2019-11-28 00:13:12,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-28 00:13:12,601 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2019-11-28 00:13:12,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 00:13:12,601 INFO L225 Difference]: With dead ends: 1069 [2019-11-28 00:13:12,602 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 00:13:12,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=299, Unknown=0, NotChecked=0, Total=420 [2019-11-28 00:13:12,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 00:13:12,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 00:13:12,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 00:13:12,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 00:13:12,605 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2019-11-28 00:13:12,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 00:13:12,605 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 00:13:12,605 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 00:13:12,606 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 00:13:12,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 00:13:12,608 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 00:13:12,813 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 111 [2019-11-28 00:13:13,506 WARN L192 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 156 [2019-11-28 00:13:14,049 WARN L192 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 195 [2019-11-28 00:13:14,506 WARN L192 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 156 [2019-11-28 00:13:14,912 WARN L192 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 166 [2019-11-28 00:13:15,124 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 103 [2019-11-28 00:13:15,564 WARN L192 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 156 [2019-11-28 00:13:15,910 WARN L192 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 255 DAG size of output: 189 [2019-11-28 00:13:16,276 WARN L192 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 192 DAG size of output: 143 [2019-11-28 00:13:17,182 WARN L192 SmtUtils]: Spent 903.00 ms on a formula simplification. DAG size of input: 383 DAG size of output: 337 [2019-11-28 00:13:17,398 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 148 [2019-11-28 00:13:17,601 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 156 [2019-11-28 00:13:17,788 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 148 [2019-11-28 00:13:18,309 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 22 [2019-11-28 00:13:18,530 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 37 [2019-11-28 00:13:19,403 WARN L192 SmtUtils]: Spent 870.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 28 [2019-11-28 00:13:20,615 WARN L192 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 191 DAG size of output: 32 [2019-11-28 00:13:21,588 WARN L192 SmtUtils]: Spent 857.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 28 [2019-11-28 00:13:22,562 WARN L192 SmtUtils]: Spent 972.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 30 [2019-11-28 00:13:22,794 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 34 [2019-11-28 00:13:23,123 WARN L192 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 31 [2019-11-28 00:13:23,593 WARN L192 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 37 [2019-11-28 00:13:23,983 WARN L192 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 22 [2019-11-28 00:13:24,179 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 38 [2019-11-28 00:13:25,054 WARN L192 SmtUtils]: Spent 871.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 28 [2019-11-28 00:13:25,917 WARN L192 SmtUtils]: Spent 859.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 31 [2019-11-28 00:13:26,143 WARN L192 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 30 [2019-11-28 00:13:26,888 WARN L192 SmtUtils]: Spent 742.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 19 [2019-11-28 00:13:29,526 WARN L192 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 331 DAG size of output: 36 [2019-11-28 00:13:30,039 WARN L192 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 24 [2019-11-28 00:13:30,976 WARN L192 SmtUtils]: Spent 833.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 28 [2019-11-28 00:13:31,221 WARN L192 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 38 [2019-11-28 00:13:31,454 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 35 [2019-11-28 00:13:31,644 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 25 [2019-11-28 00:13:32,202 WARN L192 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 24 [2019-11-28 00:13:32,630 WARN L192 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 22 [2019-11-28 00:13:33,180 WARN L192 SmtUtils]: Spent 489.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 37 [2019-11-28 00:13:33,477 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 38 [2019-11-28 00:13:33,501 INFO L246 CegarLoopResult]: For program point L1026-1(lines 1026 1042) no Hoare annotation was computed. [2019-11-28 00:13:33,501 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 2349) no Hoare annotation was computed. [2019-11-28 00:13:33,501 INFO L246 CegarLoopResult]: For program point L1919(lines 1919 1923) no Hoare annotation was computed. [2019-11-28 00:13:33,501 INFO L246 CegarLoopResult]: For program point L1886(lines 1886 1890) no Hoare annotation was computed. [2019-11-28 00:13:33,502 INFO L242 CegarLoopResult]: At program point L1820(lines 1810 1947) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:33,502 INFO L242 CegarLoopResult]: At program point L2580(lines 1 2591) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (not (= ~rjh~0 1)) (not (= ~__ste_email_to0~0 1))) [2019-11-28 00:13:33,502 INFO L246 CegarLoopResult]: For program point L2349-1(line 2349) no Hoare annotation was computed. [2019-11-28 00:13:33,502 INFO L246 CegarLoopResult]: For program point L2349(line 2349) no Hoare annotation was computed. [2019-11-28 00:13:33,503 INFO L242 CegarLoopResult]: At program point L1722(lines 1717 1725) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse0 (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg)) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (not (= ULTIMATE.start_setEmailFrom_~handle 2))) (.cse5 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse6 (= ~rjh~0 2))) (or (and (= ~__ste_email_to0~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse0 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse2 .cse3 .cse4 .cse5 .cse6))) [2019-11-28 00:13:33,503 INFO L246 CegarLoopResult]: For program point L1491(lines 1491 1495) no Hoare annotation was computed. [2019-11-28 00:13:33,503 INFO L242 CegarLoopResult]: At program point L1491-2(lines 1 2591) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:33,504 INFO L242 CegarLoopResult]: At program point L2350(lines 2326 2343) the Hoare annotation is: (and (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (not (= 0 ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~13)) (not (= |ULTIMATE.start_isReadable_#res| 0)) (= 1 ULTIMATE.start_setEmailTo_~handle) (not (= 2 ULTIMATE.start_getEmailTo_~handle)) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= ULTIMATE.start_setEmailTo_~value 2) (= ~__ste_email_to0~0 2) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:33,504 INFO L249 CegarLoopResult]: At program point L2350-1(lines 2326 2343) the Hoare annotation is: true [2019-11-28 00:13:33,504 INFO L242 CegarLoopResult]: At program point L2450(lines 2430 2452) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:33,504 INFO L246 CegarLoopResult]: For program point L138(lines 138 146) no Hoare annotation was computed. [2019-11-28 00:13:33,504 INFO L246 CegarLoopResult]: For program point L138-2(lines 138 146) no Hoare annotation was computed. [2019-11-28 00:13:33,505 INFO L246 CegarLoopResult]: For program point L1030(lines 1030 1041) no Hoare annotation was computed. [2019-11-28 00:13:33,505 INFO L246 CegarLoopResult]: For program point L138-4(lines 138 146) no Hoare annotation was computed. [2019-11-28 00:13:33,505 INFO L246 CegarLoopResult]: For program point L1030-1(lines 1030 1041) no Hoare annotation was computed. [2019-11-28 00:13:33,505 INFO L242 CegarLoopResult]: At program point L1856(lines 1846 1944) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:33,505 INFO L246 CegarLoopResult]: For program point L1461(lines 1461 1477) no Hoare annotation was computed. [2019-11-28 00:13:33,506 INFO L246 CegarLoopResult]: For program point L1461-1(lines 1461 1477) no Hoare annotation was computed. [2019-11-28 00:13:33,506 INFO L246 CegarLoopResult]: For program point L1825(lines 1825 1832) no Hoare annotation was computed. [2019-11-28 00:13:33,506 INFO L246 CegarLoopResult]: For program point L141(lines 141 145) no Hoare annotation was computed. [2019-11-28 00:13:33,506 INFO L242 CegarLoopResult]: At program point L141-2(lines 134 149) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 2 ULTIMATE.start_createEmail_~to) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:33,506 INFO L246 CegarLoopResult]: For program point L141-3(lines 141 145) no Hoare annotation was computed. [2019-11-28 00:13:33,506 INFO L242 CegarLoopResult]: At program point L141-5(lines 134 149) the Hoare annotation is: (and (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg) (= |ULTIMATE.start_createEmail_#res| 1) (= 1 ULTIMATE.start_setEmailTo_~handle) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:33,506 INFO L246 CegarLoopResult]: For program point L141-6(lines 141 145) no Hoare annotation was computed. [2019-11-28 00:13:33,506 INFO L242 CegarLoopResult]: At program point L1925(lines 1915 1938) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:33,507 INFO L242 CegarLoopResult]: At program point L141-8(lines 134 149) the Hoare annotation is: (let ((.cse0 (= ~__ste_email_to0~0 2)) (.cse1 (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg)) (.cse2 (= ULTIMATE.start_setClientId_~handle 3)) (.cse5 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse4 (= ~rjh~0 2))) (or (and (= 1 ULTIMATE.start_outgoing_~msg) .cse0 .cse1 (= 0 ~__ste_client_autoResponse1~0) .cse2 .cse3 .cse4) (and .cse2 .cse1 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse5 .cse3 .cse6 .cse4) (and .cse0 .cse1 .cse2 .cse5 .cse3 .cse6 .cse4))) [2019-11-28 00:13:33,507 INFO L242 CegarLoopResult]: At program point L1892(lines 1882 1941) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:33,507 INFO L242 CegarLoopResult]: At program point L2553(lines 2542 2556) the Hoare annotation is: (and (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 1 ULTIMATE.start_setEmailTo_~handle) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:33,507 INFO L246 CegarLoopResult]: For program point L175(lines 175 183) no Hoare annotation was computed. [2019-11-28 00:13:33,507 INFO L246 CegarLoopResult]: For program point L175-2(lines 175 183) no Hoare annotation was computed. [2019-11-28 00:13:33,507 INFO L246 CegarLoopResult]: For program point L175-4(lines 175 183) no Hoare annotation was computed. [2019-11-28 00:13:33,507 INFO L246 CegarLoopResult]: For program point L1034(lines 1034 1040) no Hoare annotation was computed. [2019-11-28 00:13:33,508 INFO L246 CegarLoopResult]: For program point L1034-1(lines 1034 1040) no Hoare annotation was computed. [2019-11-28 00:13:33,508 INFO L246 CegarLoopResult]: For program point L175-6(lines 175 183) no Hoare annotation was computed. [2019-11-28 00:13:33,508 INFO L246 CegarLoopResult]: For program point L175-8(lines 175 183) no Hoare annotation was computed. [2019-11-28 00:13:33,508 INFO L249 CegarLoopResult]: At program point L2521-1(lines 2496 2523) the Hoare annotation is: true [2019-11-28 00:13:33,508 INFO L242 CegarLoopResult]: At program point L2521(lines 2496 2523) the Hoare annotation is: (and (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (not (= |ULTIMATE.start_isReadable_#res| 0)) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:33,508 INFO L246 CegarLoopResult]: For program point L1861(lines 1861 1865) no Hoare annotation was computed. [2019-11-28 00:13:33,508 INFO L246 CegarLoopResult]: For program point L1630(lines 1630 1636) no Hoare annotation was computed. [2019-11-28 00:13:33,508 INFO L242 CegarLoopResult]: At program point L2588(lines 2583 2591) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (not (= ~rjh~0 1)) (not (= ~__ste_email_to0~0 1))) [2019-11-28 00:13:33,508 INFO L242 CegarLoopResult]: At program point L1630-1(lines 1622 1639) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse0 (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg)) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (not (= 2 ULTIMATE.start_getEmailTo_~handle))) (.cse4 (not (= ULTIMATE.start_setEmailFrom_~handle 2))) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse7 (= ~rjh~0 2))) (or (and (= ~__ste_email_to0~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse0 (not (= 0 ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~13)) (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse2 (= 1 ULTIMATE.start_setEmailTo_~handle) .cse3 .cse4 .cse5 .cse6 .cse7))) [2019-11-28 00:13:33,509 INFO L246 CegarLoopResult]: For program point L1630-2(lines 1630 1636) no Hoare annotation was computed. [2019-11-28 00:13:33,509 INFO L249 CegarLoopResult]: At program point L1630-3(lines 1622 1639) the Hoare annotation is: true [2019-11-28 00:13:33,509 INFO L246 CegarLoopResult]: For program point L1465(lines 1465 1476) no Hoare annotation was computed. [2019-11-28 00:13:33,509 INFO L246 CegarLoopResult]: For program point L1465-1(lines 1465 1476) no Hoare annotation was computed. [2019-11-28 00:13:33,509 INFO L246 CegarLoopResult]: For program point L1532(lines 1532 1544) no Hoare annotation was computed. [2019-11-28 00:13:33,509 INFO L246 CegarLoopResult]: For program point L1532-2(lines 1532 1544) no Hoare annotation was computed. [2019-11-28 00:13:33,509 INFO L246 CegarLoopResult]: For program point L1532-4(lines 1532 1544) no Hoare annotation was computed. [2019-11-28 00:13:33,509 INFO L246 CegarLoopResult]: For program point L178(lines 178 182) no Hoare annotation was computed. [2019-11-28 00:13:33,509 INFO L242 CegarLoopResult]: At program point L178-2(lines 171 186) the Hoare annotation is: (and (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setClientId_~handle 3) (= 1 ULTIMATE.start_setEmailTo_~handle) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:33,510 INFO L246 CegarLoopResult]: For program point L178-3(lines 178 182) no Hoare annotation was computed. [2019-11-28 00:13:33,510 INFO L242 CegarLoopResult]: At program point L178-5(lines 171 186) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse0 (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg)) (.cse2 (not (= 0 ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~13))) (.cse3 (not (= |ULTIMATE.start_isReadable_#res| 0))) (.cse4 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse5 (not (= 2 ULTIMATE.start_getEmailTo_~handle))) (.cse7 (not (= ULTIMATE.start_setEmailFrom_~handle 2))) (.cse6 (= 2 ULTIMATE.start_createEmail_~to)) (.cse8 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse9 (= ~rjh~0 2))) (or (and (= ~__ste_email_to0~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse1 .cse0 .cse2 .cse3 .cse4 (= 1 ULTIMATE.start_setEmailTo_~handle) .cse5 .cse7 .cse6 .cse8 .cse9))) [2019-11-28 00:13:33,510 INFO L246 CegarLoopResult]: For program point L178-6(lines 178 182) no Hoare annotation was computed. [2019-11-28 00:13:33,510 INFO L242 CegarLoopResult]: At program point L178-8(lines 171 186) the Hoare annotation is: (and (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (not (= 2 ULTIMATE.start_getEmailTo_~handle)) (= 2 ULTIMATE.start_createEmail_~to) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:33,510 INFO L246 CegarLoopResult]: For program point L178-9(lines 178 182) no Hoare annotation was computed. [2019-11-28 00:13:33,511 INFO L249 CegarLoopResult]: At program point L178-11(lines 171 186) the Hoare annotation is: true [2019-11-28 00:13:33,511 INFO L246 CegarLoopResult]: For program point L178-12(lines 178 182) no Hoare annotation was computed. [2019-11-28 00:13:33,511 INFO L249 CegarLoopResult]: At program point L178-14(lines 171 186) the Hoare annotation is: true [2019-11-28 00:13:33,511 INFO L246 CegarLoopResult]: For program point L1930(lines 1930 1934) no Hoare annotation was computed. [2019-11-28 00:13:33,511 INFO L246 CegarLoopResult]: For program point L1897(lines 1897 1901) no Hoare annotation was computed. [2019-11-28 00:13:33,511 INFO L242 CegarLoopResult]: At program point L1930-1(lines 1802 1948) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:33,512 INFO L242 CegarLoopResult]: At program point L1039(lines 1022 1045) the Hoare annotation is: (and (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 1 ULTIMATE.start_setEmailTo_~handle) (not (= 2 ULTIMATE.start_getEmailTo_~handle)) (= 2 ULTIMATE.start_createEmail_~to) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:33,512 INFO L242 CegarLoopResult]: At program point L1039-1(lines 1022 1045) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3))) (or (and (= 0 ~__ste_client_autoResponse1~0) .cse0 (not (= ~rjh~0 1)) (= 0 |ULTIMATE.start_getClientAutoResponse_#res|) (not (= 1 ULTIMATE.start_createEmail_~to))) (and (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg) .cse0 (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)))) [2019-11-28 00:13:33,512 INFO L246 CegarLoopResult]: For program point L1535(lines 1535 1543) no Hoare annotation was computed. [2019-11-28 00:13:33,512 INFO L246 CegarLoopResult]: For program point L1535-2(lines 1535 1543) no Hoare annotation was computed. [2019-11-28 00:13:33,513 INFO L246 CegarLoopResult]: For program point L1469(lines 1469 1475) no Hoare annotation was computed. [2019-11-28 00:13:33,513 INFO L246 CegarLoopResult]: For program point L1469-1(lines 1469 1475) no Hoare annotation was computed. [2019-11-28 00:13:33,513 INFO L246 CegarLoopResult]: For program point L1535-4(lines 1535 1543) no Hoare annotation was computed. [2019-11-28 00:13:33,513 INFO L246 CegarLoopResult]: For program point L82(lines 82 93) no Hoare annotation was computed. [2019-11-28 00:13:33,513 INFO L246 CegarLoopResult]: For program point L82-1(lines 82 93) no Hoare annotation was computed. [2019-11-28 00:13:33,513 INFO L242 CegarLoopResult]: At program point L1867(lines 1857 1943) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:33,514 INFO L242 CegarLoopResult]: At program point L1834(lines 1821 1946) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:33,514 INFO L246 CegarLoopResult]: For program point L1538(lines 1538 1542) no Hoare annotation was computed. [2019-11-28 00:13:33,514 INFO L242 CegarLoopResult]: At program point L2529-1(lines 2524 2532) the Hoare annotation is: (and (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (not (= |ULTIMATE.start_isReadable_#res| 0)) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:33,514 INFO L242 CegarLoopResult]: At program point L1538-2(lines 1 2591) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (not (= ~rjh~0 1)) (not (= ~__ste_email_to0~0 1))) [2019-11-28 00:13:33,514 INFO L242 CegarLoopResult]: At program point L2529(lines 2524 2532) the Hoare annotation is: (and (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (not (= |ULTIMATE.start_isReadable_#res| 0)) (= |ULTIMATE.start_createEmail_#res| 1) (= 1 ULTIMATE.start_setEmailTo_~handle) (not (= 2 ULTIMATE.start_getEmailTo_~handle)) (= 2 ULTIMATE.start_createEmail_~to) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:33,514 INFO L246 CegarLoopResult]: For program point L1538-3(lines 1538 1542) no Hoare annotation was computed. [2019-11-28 00:13:33,515 INFO L249 CegarLoopResult]: At program point L2529-3(lines 2524 2532) the Hoare annotation is: true [2019-11-28 00:13:33,515 INFO L249 CegarLoopResult]: At program point L2463-1(lines 2463 2470) the Hoare annotation is: true [2019-11-28 00:13:33,515 INFO L246 CegarLoopResult]: For program point L2463(lines 2463 2470) no Hoare annotation was computed. [2019-11-28 00:13:33,515 INFO L242 CegarLoopResult]: At program point L2529-2(lines 2524 2532) the Hoare annotation is: (and (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (not (= |ULTIMATE.start_isReadable_#res| 0)) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:33,515 INFO L242 CegarLoopResult]: At program point L1538-5(lines 1 2591) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (= ~rjh~0 ULTIMATE.start_setClientId_~handle) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:33,515 INFO L246 CegarLoopResult]: For program point L1538-6(lines 1538 1542) no Hoare annotation was computed. [2019-11-28 00:13:33,515 INFO L242 CegarLoopResult]: At program point L1538-8(lines 1 2591) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:33,516 INFO L246 CegarLoopResult]: For program point L1803(lines 1802 1948) no Hoare annotation was computed. [2019-11-28 00:13:33,516 INFO L242 CegarLoopResult]: At program point L1704(lines 1699 1707) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse0 (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg)) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (not (= ULTIMATE.start_setEmailFrom_~handle 2))) (.cse5 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse6 (= ~rjh~0 2))) (or (and (= ~__ste_email_to0~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse0 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse2 .cse3 .cse4 .cse5 .cse6))) [2019-11-28 00:13:33,516 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 00:13:33,516 INFO L246 CegarLoopResult]: For program point L119(lines 119 130) no Hoare annotation was computed. [2019-11-28 00:13:33,516 INFO L246 CegarLoopResult]: For program point L86(lines 86 92) no Hoare annotation was computed. [2019-11-28 00:13:33,516 INFO L246 CegarLoopResult]: For program point L119-1(lines 119 130) no Hoare annotation was computed. [2019-11-28 00:13:33,516 INFO L246 CegarLoopResult]: For program point L119-2(lines 119 130) no Hoare annotation was computed. [2019-11-28 00:13:33,516 INFO L246 CegarLoopResult]: For program point L86-1(lines 86 92) no Hoare annotation was computed. [2019-11-28 00:13:33,516 INFO L246 CegarLoopResult]: For program point L119-3(lines 119 130) no Hoare annotation was computed. [2019-11-28 00:13:33,517 INFO L242 CegarLoopResult]: At program point L1903(lines 1893 1940) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:33,517 INFO L246 CegarLoopResult]: For program point L1804(lines 1804 1808) no Hoare annotation was computed. [2019-11-28 00:13:33,517 INFO L242 CegarLoopResult]: At program point L1474(lines 1457 1480) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse0 (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg)) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (not (= 2 ULTIMATE.start_getEmailTo_~handle))) (.cse4 (not (= ULTIMATE.start_setEmailFrom_~handle 2))) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse7 (= ~rjh~0 2))) (or (and (= ~__ste_email_to0~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and .cse1 .cse0 (not (= 0 ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~13)) (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse2 (= 1 ULTIMATE.start_setEmailTo_~handle) .cse3 .cse4 .cse5 .cse6 .cse7))) [2019-11-28 00:13:33,517 INFO L249 CegarLoopResult]: At program point L1474-1(lines 1457 1480) the Hoare annotation is: true [2019-11-28 00:13:33,517 INFO L246 CegarLoopResult]: For program point L1508(lines 1508 1524) no Hoare annotation was computed. [2019-11-28 00:13:33,517 INFO L246 CegarLoopResult]: For program point L1508-1(lines 1508 1524) no Hoare annotation was computed. [2019-11-28 00:13:33,517 INFO L246 CegarLoopResult]: For program point L2334(lines 2334 2340) no Hoare annotation was computed. [2019-11-28 00:13:33,517 INFO L246 CegarLoopResult]: For program point L2334-2(lines 2334 2340) no Hoare annotation was computed. [2019-11-28 00:13:33,517 INFO L246 CegarLoopResult]: For program point L1872(lines 1872 1879) no Hoare annotation was computed. [2019-11-28 00:13:33,517 INFO L246 CegarLoopResult]: For program point L1839(lines 1839 1843) no Hoare annotation was computed. [2019-11-28 00:13:33,518 INFO L242 CegarLoopResult]: At program point L1609(lines 1 2591) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg)) (.cse2 (= 1 ULTIMATE.start_setEmailTo_~handle)) (.cse3 (not (= 2 ULTIMATE.start_getEmailTo_~handle))) (.cse4 (not (= ULTIMATE.start_setEmailFrom_~handle 2))) (.cse5 (= ULTIMATE.start_setEmailTo_~value 2)) (.cse6 (= ~__ste_email_to0~0 2)) (.cse7 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse8 (= 2 ULTIMATE.start_createEmail_~to)) (.cse9 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse10 (= ~rjh~0 2))) (or (and .cse0 .cse1 .cse2 .cse3 (= 2 ULTIMATE.start_incoming__wrappee__AutoResponder_~client) .cse4 .cse5 .cse6 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse7 .cse8 .cse9 .cse10) (and (= 0 ULTIMATE.start_incoming__wrappee__AutoResponder_~client) .cse0 .cse1 (= 0 |ULTIMATE.start_getEmailTo_#res|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-11-28 00:13:33,518 INFO L242 CegarLoopResult]: At program point L1609-1(lines 1 2591) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg)) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= 2 ULTIMATE.start_createEmail_~to)) (.cse3 (= ~rjh~0 2))) (or (and .cse0 .cse1 (= |ULTIMATE.start_createEmail_#res| 1) .cse2 (= 1 ULTIMATE.start_createEmail_~msg~0) .cse3) (and (= ~__ste_email_to0~0 2) .cse0 (= 0 ~__ste_client_autoResponse1~0) .cse1 (= 2 |ULTIMATE.start_getEmailTo_#res|) (= 2 ULTIMATE.start_incoming__wrappee__AutoResponder_~client) .cse2 .cse3))) [2019-11-28 00:13:33,518 INFO L246 CegarLoopResult]: For program point L156(lines 156 167) no Hoare annotation was computed. [2019-11-28 00:13:33,518 INFO L246 CegarLoopResult]: For program point L123(lines 123 129) no Hoare annotation was computed. [2019-11-28 00:13:33,518 INFO L246 CegarLoopResult]: For program point L156-1(lines 156 167) no Hoare annotation was computed. [2019-11-28 00:13:33,519 INFO L246 CegarLoopResult]: For program point L123-1(lines 123 129) no Hoare annotation was computed. [2019-11-28 00:13:33,519 INFO L246 CegarLoopResult]: For program point L156-2(lines 156 167) no Hoare annotation was computed. [2019-11-28 00:13:33,519 INFO L246 CegarLoopResult]: For program point L123-2(lines 123 129) no Hoare annotation was computed. [2019-11-28 00:13:33,519 INFO L246 CegarLoopResult]: For program point L156-3(lines 156 167) no Hoare annotation was computed. [2019-11-28 00:13:33,519 INFO L246 CegarLoopResult]: For program point L123-3(lines 123 129) no Hoare annotation was computed. [2019-11-28 00:13:33,519 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 00:13:33,520 INFO L242 CegarLoopResult]: At program point L91(lines 78 96) the Hoare annotation is: (and (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (not (= 2 ULTIMATE.start_getEmailTo_~handle)) (= 2 ULTIMATE.start_createEmail_~to) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:33,520 INFO L249 CegarLoopResult]: At program point L91-1(lines 78 96) the Hoare annotation is: true [2019-11-28 00:13:33,520 INFO L246 CegarLoopResult]: For program point L1908(lines 1908 1912) no Hoare annotation was computed. [2019-11-28 00:13:33,520 INFO L246 CegarLoopResult]: For program point L1512(lines 1512 1523) no Hoare annotation was computed. [2019-11-28 00:13:33,520 INFO L246 CegarLoopResult]: For program point L1512-1(lines 1512 1523) no Hoare annotation was computed. [2019-11-28 00:13:33,520 INFO L246 CegarLoopResult]: For program point L1050(lines 1050 1062) no Hoare annotation was computed. [2019-11-28 00:13:33,521 INFO L246 CegarLoopResult]: For program point L1810(lines 1810 1947) no Hoare annotation was computed. [2019-11-28 00:13:33,521 INFO L249 CegarLoopResult]: At program point L2471(lines 2453 2473) the Hoare annotation is: true [2019-11-28 00:13:33,521 INFO L246 CegarLoopResult]: For program point L160(lines 160 166) no Hoare annotation was computed. [2019-11-28 00:13:33,521 INFO L246 CegarLoopResult]: For program point L160-1(lines 160 166) no Hoare annotation was computed. [2019-11-28 00:13:33,521 INFO L246 CegarLoopResult]: For program point L160-2(lines 160 166) no Hoare annotation was computed. [2019-11-28 00:13:33,521 INFO L246 CegarLoopResult]: For program point L160-3(lines 160 166) no Hoare annotation was computed. [2019-11-28 00:13:33,522 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 00:13:33,522 INFO L242 CegarLoopResult]: At program point L1845(lines 1835 1945) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:33,522 INFO L242 CegarLoopResult]: At program point L1713(lines 1708 1716) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse0 (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg)) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (not (= ULTIMATE.start_setEmailFrom_~handle 2))) (.cse5 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse6 (= ~rjh~0 2))) (or (and (= ~__ste_email_to0~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse0 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse2 .cse3 .cse4 .cse5 .cse6))) [2019-11-28 00:13:33,522 INFO L246 CegarLoopResult]: For program point L2407(lines 2407 2415) no Hoare annotation was computed. [2019-11-28 00:13:33,523 INFO L242 CegarLoopResult]: At program point L128(lines 115 133) the Hoare annotation is: (and (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (not (= 0 ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~13)) (not (= |ULTIMATE.start_isReadable_#res| 0)) (= 1 ULTIMATE.start_setEmailTo_~handle) (not (= 2 ULTIMATE.start_getEmailTo_~handle)) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= ULTIMATE.start_setEmailTo_~value 2) (= ~__ste_email_to0~0 2) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:33,523 INFO L242 CegarLoopResult]: At program point L128-1(lines 115 133) the Hoare annotation is: (and (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (not (= 2 ULTIMATE.start_getEmailTo_~handle)) (= 2 ULTIMATE.start_createEmail_~to) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:33,523 INFO L249 CegarLoopResult]: At program point L128-2(lines 115 133) the Hoare annotation is: true [2019-11-28 00:13:33,523 INFO L246 CegarLoopResult]: For program point L1053(lines 1053 1061) no Hoare annotation was computed. [2019-11-28 00:13:33,523 INFO L249 CegarLoopResult]: At program point L128-3(lines 115 133) the Hoare annotation is: true [2019-11-28 00:13:33,523 INFO L246 CegarLoopResult]: For program point L1516(lines 1516 1522) no Hoare annotation was computed. [2019-11-28 00:13:33,524 INFO L246 CegarLoopResult]: For program point L1516-1(lines 1516 1522) no Hoare annotation was computed. [2019-11-28 00:13:33,524 INFO L246 CegarLoopResult]: For program point L1814(lines 1814 1818) no Hoare annotation was computed. [2019-11-28 00:13:33,524 INFO L242 CegarLoopResult]: At program point L1914(lines 1904 1939) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:33,524 INFO L242 CegarLoopResult]: At program point L1881(lines 1868 1942) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:33,524 INFO L246 CegarLoopResult]: For program point L1650(lines 1650 1657) no Hoare annotation was computed. [2019-11-28 00:13:33,524 INFO L242 CegarLoopResult]: At program point L1650-1(lines 1 2591) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse0 (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg)) (.cse2 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (not (= ULTIMATE.start_setEmailFrom_~handle 2))) (.cse5 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse6 (= ~rjh~0 2))) (or (and (= ~__ste_email_to0~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse0 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse2 .cse3 .cse4 .cse5 .cse6))) [2019-11-28 00:13:33,524 INFO L246 CegarLoopResult]: For program point L1650-2(lines 1650 1657) no Hoare annotation was computed. [2019-11-28 00:13:33,525 INFO L246 CegarLoopResult]: For program point L1485(lines 1485 1497) no Hoare annotation was computed. [2019-11-28 00:13:33,525 INFO L246 CegarLoopResult]: For program point L1056(lines 1056 1060) no Hoare annotation was computed. [2019-11-28 00:13:33,525 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-28 00:13:33,525 INFO L242 CegarLoopResult]: At program point L1056-2(lines 1 2591) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:33,525 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2349) no Hoare annotation was computed. [2019-11-28 00:13:33,525 INFO L242 CegarLoopResult]: At program point L165(lines 152 170) the Hoare annotation is: (let ((.cse0 (= ~__ste_email_to0~0 2)) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg)) (.cse3 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse4 (= 1 ULTIMATE.start_setEmailTo_~handle)) (.cse5 (not (= 2 ULTIMATE.start_getEmailTo_~handle))) (.cse6 (not (= ULTIMATE.start_setEmailFrom_~handle 2))) (.cse7 (= 2 ULTIMATE.start_createEmail_~to)) (.cse8 (= ULTIMATE.start_setEmailTo_~value 2)) (.cse9 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse10 (= ~rjh~0 2))) (or (and .cse0 .cse1 .cse2 (= 0 |ULTIMATE.start_getEmailTo_#res|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) [2019-11-28 00:13:33,526 INFO L242 CegarLoopResult]: At program point L165-1(lines 152 170) the Hoare annotation is: (and (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 2 ULTIMATE.start_createEmail_~to) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:33,526 INFO L242 CegarLoopResult]: At program point L165-2(lines 152 170) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg)) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= 2 ULTIMATE.start_createEmail_~to)) (.cse3 (= ~rjh~0 2))) (or (and .cse0 .cse1 (= |ULTIMATE.start_createEmail_#res| 1) .cse2 (= 1 ULTIMATE.start_createEmail_~msg~0) .cse3) (and (= ~__ste_email_to0~0 2) .cse0 (= 0 ~__ste_client_autoResponse1~0) .cse1 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse2 .cse3))) [2019-11-28 00:13:33,526 INFO L249 CegarLoopResult]: At program point L165-3(lines 152 170) the Hoare annotation is: true [2019-11-28 00:13:33,526 INFO L242 CegarLoopResult]: At program point L1949(lines 1801 1950) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ~__ste_email_to0~0 1)) (= ~rjh~0 2)) [2019-11-28 00:13:33,526 INFO L246 CegarLoopResult]: For program point L1850(lines 1850 1854) no Hoare annotation was computed. [2019-11-28 00:13:33,526 INFO L242 CegarLoopResult]: At program point L1521(lines 1504 1527) the Hoare annotation is: (and (= ~__ste_email_to0~0 2) (= ULTIMATE.start_setClientId_~handle 3) (= |ULTIMATE.start_createEmail_#res| 1) (= 1 ULTIMATE.start_setEmailTo_~handle) (not (= 2 ULTIMATE.start_outgoing_~msg)) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_setEmailTo_~value 2) (= 1 ULTIMATE.start_createEmail_~msg~0) (= ~rjh~0 2)) [2019-11-28 00:13:33,526 INFO L246 CegarLoopResult]: For program point L1488(lines 1488 1496) no Hoare annotation was computed. [2019-11-28 00:13:33,527 INFO L242 CegarLoopResult]: At program point L1521-1(lines 1504 1527) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= |ULTIMATE.start_createEmail_#res| 1)) (.cse2 (= 2 ULTIMATE.start_createEmail_~to)) (.cse3 (not (= ULTIMATE.start_setEmailFrom_~handle 2))) (.cse4 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse5 (= ~rjh~0 2))) (or (and (= ~__ste_email_to0~0 2) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 (not (= |ULTIMATE.start_isReadable_#res| 0)) .cse1 .cse2 .cse3 .cse4 .cse5))) [2019-11-28 00:13:33,527 INFO L246 CegarLoopResult]: For program point L1026(lines 1026 1042) no Hoare annotation was computed. [2019-11-28 00:13:33,571 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 12:13:33 BoogieIcfgContainer [2019-11-28 00:13:33,572 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 00:13:33,572 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 00:13:33,572 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 00:13:33,573 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 00:13:33,573 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 12:13:06" (3/4) ... [2019-11-28 00:13:33,577 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 00:13:33,608 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 82 nodes and edges [2019-11-28 00:13:33,610 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 48 nodes and edges [2019-11-28 00:13:33,612 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 00:13:33,614 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 00:13:33,616 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 00:13:33,618 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-28 00:13:33,651 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((__ste_email_to0 == 2 && handle == 3) && \result == 1) && 1 == handle) && !(handle == 2)) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 [2019-11-28 00:13:33,651 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((__ste_email_to0 == 2 && handle == 3) && \result == 1) && 1 == handle) && !(2 == msg)) && !(handle == 2)) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 [2019-11-28 00:13:33,652 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((__ste_email_to0 == 2 && handle == 3) && handle == msg) && \result == 1) && 1 == handle) && !(handle == 2)) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 [2019-11-28 00:13:33,652 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((__ste_email_to0 == 2 && handle == 3) && handle == msg) && 0 == \result) && \result == 1) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && 2 == to) && value == 2) && 1 == msg) && rjh == 2) || (((((((((((__ste_email_to0 == 2 && handle == 3) && handle == msg) && 2 == \result) && \result == 1) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && 2 == to) && value == 2) && 1 == msg) && rjh == 2) [2019-11-28 00:13:33,653 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((handle == 3 && handle == msg) && 1 == handle) && !(2 == handle)) && 2 == client) && !(handle == 2)) && value == 2) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) || ((((((((((((0 == client && handle == 3) && handle == msg) && 0 == \result) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && value == 2) && __ste_email_to0 == 2) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) [2019-11-28 00:13:33,653 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((__ste_email_to0 == 2 && handle == msg) && handle == 3) && \result == 1) && 1 == handle) && !(2 == handle)) && 2 == to) && !(handle == 2)) && value == 2) && 1 == msg) && rjh == 2 [2019-11-28 00:13:33,654 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((__ste_email_to0 == 2 && handle == msg) && handle == 3) && \result == 1) && !(2 == handle)) && !(handle == 2)) && 2 == to) && 1 == msg) && rjh == 2) || ((((((((((handle == 3 && handle == msg) && !(0 == tmp)) && !(\result == 0)) && \result == 1) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && 2 == to) && 1 == msg) && rjh == 2) [2019-11-28 00:13:33,654 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((__ste_email_to0 == 2 && handle == msg) && handle == 3) && \result == 1) && !(2 == handle)) && !(handle == 2)) && 2 == to) && 1 == msg) && rjh == 2) || ((((((((((handle == 3 && handle == msg) && !(0 == tmp)) && !(\result == 0)) && \result == 1) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && 2 == to) && 1 == msg) && rjh == 2) [2019-11-28 00:13:33,654 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((__ste_email_to0 == 2 && handle == msg) && handle == 3) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) || (((((((handle == 3 && handle == msg) && !(\result == 0)) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) [2019-11-28 00:13:33,655 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((handle == msg && handle == 3) && \result == 1) && !(2 == handle)) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2 [2019-11-28 00:13:33,655 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((__ste_email_to0 == 2 && handle == msg) && handle == 3) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) || (((((((handle == 3 && handle == msg) && !(\result == 0)) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) [2019-11-28 00:13:33,655 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((__ste_email_to0 == 2 && handle == msg) && handle == 3) && !(\result == 0)) && \result == 1) && 1 == handle) && !(2 == handle)) && 2 == to) && !(handle == 2)) && value == 2) && 1 == msg) && rjh == 2 [2019-11-28 00:13:33,656 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((handle == msg && handle == 3) && !(0 == tmp)) && !(\result == 0)) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && value == 2) && __ste_email_to0 == 2) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-11-28 00:13:33,656 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((__ste_email_to0 == 2 && handle == msg) && handle == 3) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) || (((((((handle == 3 && handle == msg) && !(\result == 0)) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) [2019-11-28 00:13:33,656 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((handle == msg && handle == 3) && !(0 == tmp)) && !(\result == 0)) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && value == 2) && __ste_email_to0 == 2) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-11-28 00:13:33,657 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((__ste_email_to0 == 2 && handle == msg) && handle == 3) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) || (((((((handle == 3 && handle == msg) && !(\result == 0)) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) [2019-11-28 00:13:33,657 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((handle == msg && handle == 3) && \result == 1) && !(2 == handle)) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2 [2019-11-28 00:13:33,657 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((__ste_email_to0 == 2 && handle == msg) && handle == 3) && !(0 == tmp)) && !(\result == 0)) && \result == 1) && !(2 == handle)) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) || ((((((((((handle == 3 && handle == msg) && !(0 == tmp)) && !(\result == 0)) && \result == 1) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && 2 == to) && 1 == msg) && rjh == 2) [2019-11-28 00:13:33,658 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((__ste_email_to0 == 2 && handle == 3) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) || ((((((handle == 3 && !(\result == 0)) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) [2019-11-28 00:13:33,658 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((handle == msg && handle == 3) && \result == 1) && !(2 == handle)) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2 [2019-11-28 00:13:33,659 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((1 == msg && __ste_email_to0 == 2) && handle == msg) && 0 == __ste_client_autoResponse1) && handle == 3) && 2 == to) && rjh == 2) || ((((((handle == 3 && handle == msg) && !(\result == 0)) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2)) || ((((((__ste_email_to0 == 2 && handle == msg) && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) [2019-11-28 00:13:33,659 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((handle == msg && handle == 3) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2 [2019-11-28 00:13:33,659 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((handle == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) || ((((((__ste_email_to0 == 2 && handle == msg) && 0 == __ste_client_autoResponse1) && handle == 3) && 2 == \result) && 2 == to) && rjh == 2) [2019-11-28 00:13:33,659 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((handle == msg && handle == 3) && !(\result == 0)) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2 [2019-11-28 00:13:33,660 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((handle == msg && handle == 3) && !(\result == 0)) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2 [2019-11-28 00:13:33,660 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((handle == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) || (((((((__ste_email_to0 == 2 && handle == msg) && 0 == __ste_client_autoResponse1) && handle == 3) && 2 == \result) && 2 == client) && 2 == to) && rjh == 2) [2019-11-28 00:13:33,660 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((0 == __ste_client_autoResponse1 && handle == 3) && !(rjh == 1)) && 0 == \result) && !(1 == to)) || (((((handle == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) [2019-11-28 00:13:33,661 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((handle == msg && handle == 3) && !(\result == 0)) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 [2019-11-28 00:13:33,789 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 00:13:33,789 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 00:13:33,791 INFO L168 Benchmark]: Toolchain (without parser) took 29757.21 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 794.3 MB). Free memory was 956.3 MB in the beginning and 1.6 GB in the end (delta: -677.7 MB). Peak memory consumption was 116.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:13:33,791 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:13:33,792 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1060.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -143.4 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:13:33,792 INFO L168 Benchmark]: Boogie Procedure Inliner took 145.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 00:13:33,792 INFO L168 Benchmark]: Boogie Preprocessor took 100.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 00:13:33,793 INFO L168 Benchmark]: RCFGBuilder took 1212.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 982.5 MB in the end (delta: 110.7 MB). Peak memory consumption was 110.7 MB. Max. memory is 11.5 GB. [2019-11-28 00:13:33,793 INFO L168 Benchmark]: TraceAbstraction took 27013.44 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 649.1 MB). Free memory was 982.5 MB in the beginning and 1.7 GB in the end (delta: -689.7 MB). Peak memory consumption was 798.9 MB. Max. memory is 11.5 GB. [2019-11-28 00:13:33,793 INFO L168 Benchmark]: Witness Printer took 217.30 ms. Allocated memory is still 1.8 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 38.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. [2019-11-28 00:13:33,797 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1060.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -143.4 MB). Peak memory consumption was 31.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 145.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 100.41 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1212.16 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 982.5 MB in the end (delta: 110.7 MB). Peak memory consumption was 110.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 27013.44 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 649.1 MB). Free memory was 982.5 MB in the beginning and 1.7 GB in the end (delta: -689.7 MB). Peak memory consumption was 798.9 MB. Max. memory is 11.5 GB. * Witness Printer took 217.30 ms. Allocated memory is still 1.8 GB. Free memory was 1.7 GB in the beginning and 1.6 GB in the end (delta: 38.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2349]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 2349]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: ((((((handle == msg && handle == 3) && \result == 1) && !(2 == handle)) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2 - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((((handle == 3 && handle == msg) && 1 == handle) && !(2 == handle)) && 2 == client) && !(handle == 2)) && value == 2) && __ste_email_to0 == 2) && 2 == \result) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) || ((((((((((((0 == client && handle == 3) && handle == msg) && 0 == \result) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && value == 2) && __ste_email_to0 == 2) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) - InvariantResult [Line: 2430]: Loop Invariant Derived loop invariant: ((0 == __ste_client_autoResponse1 && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1699]: Loop Invariant Derived loop invariant: (((((((__ste_email_to0 == 2 && handle == msg) && handle == 3) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) || (((((((handle == 3 && handle == msg) && !(\result == 0)) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((handle == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) || (((((((__ste_email_to0 == 2 && handle == msg) && 0 == __ste_client_autoResponse1) && handle == 3) && 2 == \result) && 2 == client) && 2 == to) && rjh == 2) - InvariantResult [Line: 1801]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1504]: Loop Invariant Derived loop invariant: ((((((((__ste_email_to0 == 2 && handle == 3) && \result == 1) && 1 == handle) && !(2 == msg)) && !(handle == 2)) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1717]: Loop Invariant Derived loop invariant: (((((((__ste_email_to0 == 2 && handle == msg) && handle == 3) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) || (((((((handle == 3 && handle == msg) && !(\result == 0)) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) - InvariantResult [Line: 1504]: Loop Invariant Derived loop invariant: ((((((__ste_email_to0 == 2 && handle == 3) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) || ((((((handle == 3 && !(\result == 0)) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) - InvariantResult [Line: 2542]: Loop Invariant Derived loop invariant: (((((((__ste_email_to0 == 2 && handle == 3) && \result == 1) && 1 == handle) && !(handle == 2)) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((((((((__ste_email_to0 == 2 && handle == 3) && handle == msg) && 0 == \result) && \result == 1) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && 2 == to) && value == 2) && 1 == msg) && rjh == 2) || (((((((((((__ste_email_to0 == 2 && handle == 3) && handle == msg) && 2 == \result) && \result == 1) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && 2 == to) && value == 2) && 1 == msg) && rjh == 2) - InvariantResult [Line: 1022]: Loop Invariant Derived loop invariant: ((((0 == __ste_client_autoResponse1 && handle == 3) && !(rjh == 1)) && 0 == \result) && !(1 == to)) || (((((handle == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) - InvariantResult [Line: 1457]: Loop Invariant Derived loop invariant: ((((((((__ste_email_to0 == 2 && handle == msg) && handle == 3) && \result == 1) && !(2 == handle)) && !(handle == 2)) && 2 == to) && 1 == msg) && rjh == 2) || ((((((((((handle == 3 && handle == msg) && !(0 == tmp)) && !(\result == 0)) && \result == 1) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && 2 == to) && 1 == msg) && rjh == 2) - InvariantResult [Line: 1457]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((((((handle == msg && handle == 3) && \result == 1) && !(2 == handle)) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2 - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: (((((((((((handle == msg && handle == 3) && !(0 == tmp)) && !(\result == 0)) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && value == 2) && __ste_email_to0 == 2) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((__ste_email_to0 == 2 && handle == msg) && handle == 3) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) || (((((((handle == 3 && handle == msg) && !(\result == 0)) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((handle == msg && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) || ((((((__ste_email_to0 == 2 && handle == msg) && 0 == __ste_client_autoResponse1) && handle == 3) && 2 == \result) && 2 == to) && rjh == 2) - InvariantResult [Line: 1022]: Loop Invariant Derived loop invariant: (((((((((__ste_email_to0 == 2 && handle == msg) && handle == 3) && \result == 1) && 1 == handle) && !(2 == handle)) && 2 == to) && !(handle == 2)) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 152]: Loop Invariant Derived loop invariant: (((((handle == msg && handle == 3) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1882]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: (((((((1 == msg && __ste_email_to0 == 2) && handle == msg) && 0 == __ste_client_autoResponse1) && handle == 3) && 2 == to) && rjh == 2) || ((((((handle == 3 && handle == msg) && !(\result == 0)) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2)) || ((((((__ste_email_to0 == 2 && handle == msg) && handle == 3) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2) - InvariantResult [Line: 2496]: Loop Invariant Derived loop invariant: ((((((handle == msg && handle == 3) && !(\result == 0)) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1868]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2496]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((((((__ste_email_to0 == 2 && handle == 3) && handle == msg) && \result == 1) && 1 == handle) && !(handle == 2)) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 2463]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2524]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (0 == __ste_client_autoResponse1 && !(rjh == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((0 == __ste_client_autoResponse1 && rjh == handle) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1708]: Loop Invariant Derived loop invariant: (((((((__ste_email_to0 == 2 && handle == msg) && handle == 3) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) || (((((((handle == 3 && handle == msg) && !(\result == 0)) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) - InvariantResult [Line: 1904]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1893]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((0 == __ste_client_autoResponse1 && handle == 3) && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1915]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2326]: Loop Invariant Derived loop invariant: (((((((((((handle == msg && handle == 3) && !(0 == tmp)) && !(\result == 0)) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && value == 2) && __ste_email_to0 == 2) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((((__ste_email_to0 == 2 && handle == 3) && 1 == handle) && !(handle == 2)) && 2 == to) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 2326]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1857]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2524]: Loop Invariant Derived loop invariant: ((((((((((__ste_email_to0 == 2 && handle == msg) && handle == 3) && !(\result == 0)) && \result == 1) && 1 == handle) && !(2 == handle)) && 2 == to) && !(handle == 2)) && value == 2) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1821]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2524]: Loop Invariant Derived loop invariant: (((((handle == msg && handle == 3) && !(\result == 0)) && \result == 1) && 2 == to) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (0 == __ste_client_autoResponse1 && !(rjh == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1846]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1835]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2524]: Loop Invariant Derived loop invariant: ((((((handle == msg && handle == 3) && !(\result == 0)) && \result == 1) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((((handle == msg && handle == 3) && \result == 1) && !(2 == handle)) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1802]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 2453]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 134]: Loop Invariant Derived loop invariant: ((((handle == 3 && !(handle == 2)) && 2 == to) && !(__ste_email_to0 == 1)) && 1 == msg) && rjh == 2 - InvariantResult [Line: 1622]: Loop Invariant Derived loop invariant: ((((((((__ste_email_to0 == 2 && handle == msg) && handle == 3) && \result == 1) && !(2 == handle)) && !(handle == 2)) && 2 == to) && 1 == msg) && rjh == 2) || ((((((((((handle == 3 && handle == msg) && !(0 == tmp)) && !(\result == 0)) && \result == 1) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && 2 == to) && 1 == msg) && rjh == 2) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 1810]: Loop Invariant Derived loop invariant: (handle == 3 && !(__ste_email_to0 == 1)) && rjh == 2 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: ((((((((((__ste_email_to0 == 2 && handle == msg) && handle == 3) && !(0 == tmp)) && !(\result == 0)) && \result == 1) && !(2 == handle)) && 2 == to) && !(handle == 2)) && 1 == msg) && rjh == 2) || ((((((((((handle == 3 && handle == msg) && !(0 == tmp)) && !(\result == 0)) && \result == 1) && 1 == handle) && !(2 == handle)) && !(handle == 2)) && 2 == to) && 1 == msg) && rjh == 2) - InvariantResult [Line: 1622]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2583]: Loop Invariant Derived loop invariant: (0 == __ste_client_autoResponse1 && !(rjh == 1)) && !(__ste_email_to0 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 162 locations, 2 error locations. Result: SAFE, OverallTime: 5.9s, OverallIterations: 13, TraceHistogramMax: 2, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 20.8s, HoareTripleCheckerStatistics: 3040 SDtfs, 6547 SDslu, 7485 SDs, 0 SdLazy, 777 SolverSat, 150 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=478occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 2553 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 63 LocationsWithAnnotation, 63 PreInvPairs, 615 NumberOfFragments, 1567 HoareAnnotationTreeSize, 63 FomulaSimplifications, 58224177 FormulaSimplificationTreeSizeReduction, 5.3s HoareSimplificationTime, 63 FomulaSimplificationsInter, 4341183 FormulaSimplificationTreeSizeReductionInter, 15.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 523 NumberOfCodeBlocks, 523 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 510 ConstructedInterpolants, 0 QuantifiedInterpolants, 32562 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 18/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...