./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/email_spec11_product03_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/product-lines/email_spec11_product03_true-unreach-call_true-termination.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 cdb705451c6fea738760a6b9963fc72ac4c0d764 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 14:41:23,627 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:41:23,629 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:41:23,642 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:41:23,642 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:41:23,643 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:41:23,645 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:41:23,647 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:41:23,649 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:41:23,650 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:41:23,650 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:41:23,651 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:41:23,652 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:41:23,653 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:41:23,654 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:41:23,655 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:41:23,656 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:41:23,658 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:41:23,660 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:41:23,662 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:41:23,663 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:41:23,664 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:41:23,669 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:41:23,670 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:41:23,670 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:41:23,671 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:41:23,672 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:41:23,673 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:41:23,674 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:41:23,675 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:41:23,675 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:41:23,676 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:41:23,677 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:41:23,677 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:41:23,678 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:41:23,678 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:41:23,679 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:41:23,694 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:41:23,694 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:41:23,695 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:41:23,696 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:41:23,696 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:41:23,696 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:41:23,697 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:41:23,697 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:41:23,697 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:41:23,697 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:41:23,697 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:41:23,697 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:41:23,698 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:41:23,698 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:41:23,698 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:41:23,698 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:41:23,698 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:41:23,698 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:41:23,699 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:41:23,700 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:41:23,700 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:41:23,701 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:41:23,701 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:41:23,701 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:41:23,701 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:41:23,701 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:41:23,701 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:41:23,702 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:41:23,703 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> cdb705451c6fea738760a6b9963fc72ac4c0d764 [2019-01-12 14:41:23,740 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:41:23,754 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:41:23,759 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:41:23,760 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:41:23,760 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:41:23,761 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/email_spec11_product03_true-unreach-call_true-termination.cil.c [2019-01-12 14:41:23,809 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f41d86806/907bb4782adc4951b6f68d48a43e7eb5/FLAG6aeb6b952 [2019-01-12 14:41:24,362 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:41:24,363 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/email_spec11_product03_true-unreach-call_true-termination.cil.c [2019-01-12 14:41:24,382 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f41d86806/907bb4782adc4951b6f68d48a43e7eb5/FLAG6aeb6b952 [2019-01-12 14:41:24,584 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f41d86806/907bb4782adc4951b6f68d48a43e7eb5 [2019-01-12 14:41:24,588 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:41:24,589 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:41:24,590 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:41:24,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:41:24,594 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:41:24,595 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:41:24" (1/1) ... [2019-01-12 14:41:24,598 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13568bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:41:24, skipping insertion in model container [2019-01-12 14:41:24,598 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:41:24" (1/1) ... [2019-01-12 14:41:24,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:41:24,691 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:41:25,337 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:41:25,368 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:41:25,548 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:41:25,609 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:41:25,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:41:25 WrapperNode [2019-01-12 14:41:25,610 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:41:25,611 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:41:25,611 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:41:25,611 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:41:25,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:41:25" (1/1) ... [2019-01-12 14:41:25,655 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:41:25" (1/1) ... [2019-01-12 14:41:25,725 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:41:25,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:41:25,725 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:41:25,726 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:41:25,736 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:41:25" (1/1) ... [2019-01-12 14:41:25,736 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:41:25" (1/1) ... [2019-01-12 14:41:25,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:41:25" (1/1) ... [2019-01-12 14:41:25,742 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:41:25" (1/1) ... [2019-01-12 14:41:25,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:41:25" (1/1) ... [2019-01-12 14:41:25,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:41:25" (1/1) ... [2019-01-12 14:41:25,773 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:41:25" (1/1) ... [2019-01-12 14:41:25,781 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:41:25,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:41:25,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:41:25,782 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:41:25,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:41:25" (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-01-12 14:41:25,843 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-01-12 14:41:25,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:41:25,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:41:25,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:41:25,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:41:27,626 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:41:27,627 INFO L286 CfgBuilder]: Removed 111 assue(true) statements. [2019-01-12 14:41:27,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:41:27 BoogieIcfgContainer [2019-01-12 14:41:27,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:41:27,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:41:27,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:41:27,632 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:41:27,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:41:24" (1/3) ... [2019-01-12 14:41:27,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@687db954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:41:27, skipping insertion in model container [2019-01-12 14:41:27,634 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:41:25" (2/3) ... [2019-01-12 14:41:27,634 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@687db954 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:41:27, skipping insertion in model container [2019-01-12 14:41:27,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:41:27" (3/3) ... [2019-01-12 14:41:27,638 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec11_product03_true-unreach-call_true-termination.cil.c [2019-01-12 14:41:27,648 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:41:27,656 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-12 14:41:27,674 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-12 14:41:27,705 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:41:27,705 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:41:27,706 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:41:27,706 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:41:27,706 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:41:27,706 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:41:27,706 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:41:27,707 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:41:27,707 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:41:27,726 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states. [2019-01-12 14:41:27,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-12 14:41:27,735 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:41:27,737 INFO L402 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-01-12 14:41:27,740 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:41:27,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:41:27,746 INFO L82 PathProgramCache]: Analyzing trace with hash 1526697543, now seen corresponding path program 1 times [2019-01-12 14:41:27,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:41:27,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:41:27,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:41:27,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:41:27,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:41:27,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:41:28,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:41:28,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:41:28,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:41:28,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:41:28,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:41:28,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:41:28,065 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 2 states. [2019-01-12 14:41:28,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:41:28,095 INFO L93 Difference]: Finished difference Result 189 states and 299 transitions. [2019-01-12 14:41:28,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:41:28,097 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 32 [2019-01-12 14:41:28,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:41:28,108 INFO L225 Difference]: With dead ends: 189 [2019-01-12 14:41:28,108 INFO L226 Difference]: Without dead ends: 107 [2019-01-12 14:41:28,111 INFO L631 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-01-12 14:41:28,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-12 14:41:28,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-01-12 14:41:28,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-12 14:41:28,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 170 transitions. [2019-01-12 14:41:28,159 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 170 transitions. Word has length 32 [2019-01-12 14:41:28,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:41:28,160 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 170 transitions. [2019-01-12 14:41:28,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:41:28,160 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 170 transitions. [2019-01-12 14:41:28,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-01-12 14:41:28,162 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:41:28,162 INFO L402 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-01-12 14:41:28,163 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:41:28,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:41:28,163 INFO L82 PathProgramCache]: Analyzing trace with hash -380016211, now seen corresponding path program 1 times [2019-01-12 14:41:28,163 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:41:28,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:41:28,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:41:28,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:41:28,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:41:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:41:28,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:41:28,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:41:28,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:41:28,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:41:28,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:41:28,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:41:28,390 INFO L87 Difference]: Start difference. First operand 107 states and 170 transitions. Second operand 3 states. [2019-01-12 14:41:28,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:41:28,650 INFO L93 Difference]: Finished difference Result 294 states and 468 transitions. [2019-01-12 14:41:28,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:41:28,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-01-12 14:41:28,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:41:28,654 INFO L225 Difference]: With dead ends: 294 [2019-01-12 14:41:28,654 INFO L226 Difference]: Without dead ends: 198 [2019-01-12 14:41:28,656 INFO L631 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-01-12 14:41:28,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-01-12 14:41:28,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 106. [2019-01-12 14:41:28,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-12 14:41:28,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 166 transitions. [2019-01-12 14:41:28,673 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 166 transitions. Word has length 33 [2019-01-12 14:41:28,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:41:28,673 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 166 transitions. [2019-01-12 14:41:28,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:41:28,673 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 166 transitions. [2019-01-12 14:41:28,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-12 14:41:28,675 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:41:28,675 INFO L402 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-01-12 14:41:28,676 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:41:28,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:41:28,676 INFO L82 PathProgramCache]: Analyzing trace with hash -2080487648, now seen corresponding path program 1 times [2019-01-12 14:41:28,676 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:41:28,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:41:28,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:41:28,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:41:28,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:41:28,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:41:28,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:41:28,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:41:28,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:41:28,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:41:28,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:41:28,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:41:28,836 INFO L87 Difference]: Start difference. First operand 106 states and 166 transitions. Second operand 3 states. [2019-01-12 14:41:28,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:41:28,938 INFO L93 Difference]: Finished difference Result 198 states and 312 transitions. [2019-01-12 14:41:28,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:41:28,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-01-12 14:41:28,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:41:28,943 INFO L225 Difference]: With dead ends: 198 [2019-01-12 14:41:28,943 INFO L226 Difference]: Without dead ends: 107 [2019-01-12 14:41:28,944 INFO L631 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-01-12 14:41:28,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-12 14:41:28,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-01-12 14:41:28,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-12 14:41:28,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 163 transitions. [2019-01-12 14:41:28,961 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 163 transitions. Word has length 34 [2019-01-12 14:41:28,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:41:28,961 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 163 transitions. [2019-01-12 14:41:28,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:41:28,962 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 163 transitions. [2019-01-12 14:41:28,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-12 14:41:28,964 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:41:28,964 INFO L402 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-01-12 14:41:28,965 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:41:28,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:41:28,966 INFO L82 PathProgramCache]: Analyzing trace with hash 77051259, now seen corresponding path program 1 times [2019-01-12 14:41:28,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:41:28,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:41:28,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:41:28,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:41:28,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:41:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:41:29,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:41:29,081 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:41:29,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:41:29,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:41:29,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:41:29,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:41:29,082 INFO L87 Difference]: Start difference. First operand 106 states and 163 transitions. Second operand 3 states. [2019-01-12 14:41:29,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:41:29,127 INFO L93 Difference]: Finished difference Result 169 states and 255 transitions. [2019-01-12 14:41:29,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:41:29,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-01-12 14:41:29,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:41:29,129 INFO L225 Difference]: With dead ends: 169 [2019-01-12 14:41:29,129 INFO L226 Difference]: Without dead ends: 109 [2019-01-12 14:41:29,130 INFO L631 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-01-12 14:41:29,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-12 14:41:29,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2019-01-12 14:41:29,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-12 14:41:29,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 165 transitions. [2019-01-12 14:41:29,141 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 165 transitions. Word has length 36 [2019-01-12 14:41:29,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:41:29,141 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 165 transitions. [2019-01-12 14:41:29,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:41:29,141 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 165 transitions. [2019-01-12 14:41:29,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-12 14:41:29,143 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:41:29,143 INFO L402 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-01-12 14:41:29,143 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:41:29,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:41:29,144 INFO L82 PathProgramCache]: Analyzing trace with hash -382569238, now seen corresponding path program 1 times [2019-01-12 14:41:29,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:41:29,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:41:29,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:41:29,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:41:29,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:41:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:41:29,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:41:29,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:41:29,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 14:41:29,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 14:41:29,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 14:41:29,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:41:29,673 INFO L87 Difference]: Start difference. First operand 108 states and 165 transitions. Second operand 10 states. [2019-01-12 14:41:30,216 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-12 14:41:30,606 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-12 14:41:31,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:41:31,534 INFO L93 Difference]: Finished difference Result 383 states and 530 transitions. [2019-01-12 14:41:31,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-12 14:41:31,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 41 [2019-01-12 14:41:31,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:41:31,541 INFO L225 Difference]: With dead ends: 383 [2019-01-12 14:41:31,542 INFO L226 Difference]: Without dead ends: 345 [2019-01-12 14:41:31,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2019-01-12 14:41:31,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2019-01-12 14:41:31,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 128. [2019-01-12 14:41:31,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-01-12 14:41:31,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 191 transitions. [2019-01-12 14:41:31,588 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 191 transitions. Word has length 41 [2019-01-12 14:41:31,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:41:31,589 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 191 transitions. [2019-01-12 14:41:31,589 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 14:41:31,589 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 191 transitions. [2019-01-12 14:41:31,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-12 14:41:31,591 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:41:31,591 INFO L402 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-01-12 14:41:31,591 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:41:31,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:41:31,592 INFO L82 PathProgramCache]: Analyzing trace with hash -432538479, now seen corresponding path program 1 times [2019-01-12 14:41:31,592 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:41:31,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:41:31,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:41:31,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:41:31,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:41:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:41:32,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-01-12 14:41:32,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:41:32,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 14:41:32,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:41:32,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:41:32,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:41:32,040 INFO L87 Difference]: Start difference. First operand 128 states and 191 transitions. Second operand 6 states. [2019-01-12 14:41:32,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:41:32,170 INFO L93 Difference]: Finished difference Result 202 states and 289 transitions. [2019-01-12 14:41:32,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:41:32,171 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-01-12 14:41:32,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:41:32,172 INFO L225 Difference]: With dead ends: 202 [2019-01-12 14:41:32,172 INFO L226 Difference]: Without dead ends: 138 [2019-01-12 14:41:32,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:41:32,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-12 14:41:32,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 124. [2019-01-12 14:41:32,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-01-12 14:41:32,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 184 transitions. [2019-01-12 14:41:32,199 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 184 transitions. Word has length 42 [2019-01-12 14:41:32,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:41:32,199 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 184 transitions. [2019-01-12 14:41:32,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:41:32,199 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 184 transitions. [2019-01-12 14:41:32,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-12 14:41:32,206 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:41:32,206 INFO L402 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-01-12 14:41:32,206 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:41:32,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:41:32,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1755201452, now seen corresponding path program 1 times [2019-01-12 14:41:32,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:41:32,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:41:32,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:41:32,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:41:32,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:41:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:41:32,480 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:41:32,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:41:32,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:41:32,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:41:32,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:41:32,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:41:32,481 INFO L87 Difference]: Start difference. First operand 124 states and 184 transitions. Second operand 5 states. [2019-01-12 14:41:32,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:41:32,726 INFO L93 Difference]: Finished difference Result 336 states and 494 transitions. [2019-01-12 14:41:32,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:41:32,727 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-01-12 14:41:32,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:41:32,730 INFO L225 Difference]: With dead ends: 336 [2019-01-12 14:41:32,730 INFO L226 Difference]: Without dead ends: 281 [2019-01-12 14:41:32,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:41:32,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-01-12 14:41:32,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 222. [2019-01-12 14:41:32,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2019-01-12 14:41:32,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 339 transitions. [2019-01-12 14:41:32,756 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 339 transitions. Word has length 42 [2019-01-12 14:41:32,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:41:32,757 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 339 transitions. [2019-01-12 14:41:32,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:41:32,757 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 339 transitions. [2019-01-12 14:41:32,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-12 14:41:32,758 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:41:32,759 INFO L402 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-01-12 14:41:32,759 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:41:32,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:41:32,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1213981371, now seen corresponding path program 1 times [2019-01-12 14:41:32,759 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:41:32,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:41:32,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:41:32,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:41:32,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:41:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:41:33,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:41:33,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:41:33,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-12 14:41:33,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 14:41:33,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 14:41:33,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:41:33,332 INFO L87 Difference]: Start difference. First operand 222 states and 339 transitions. Second operand 9 states. [2019-01-12 14:41:34,162 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-12 14:41:34,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:41:34,636 INFO L93 Difference]: Finished difference Result 640 states and 894 transitions. [2019-01-12 14:41:34,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-01-12 14:41:34,638 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2019-01-12 14:41:34,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:41:34,642 INFO L225 Difference]: With dead ends: 640 [2019-01-12 14:41:34,642 INFO L226 Difference]: Without dead ends: 533 [2019-01-12 14:41:34,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2019-01-12 14:41:34,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2019-01-12 14:41:34,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 293. [2019-01-12 14:41:34,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2019-01-12 14:41:34,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 437 transitions. [2019-01-12 14:41:34,680 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 437 transitions. Word has length 43 [2019-01-12 14:41:34,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:41:34,680 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 437 transitions. [2019-01-12 14:41:34,680 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 14:41:34,680 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 437 transitions. [2019-01-12 14:41:34,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-01-12 14:41:34,682 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:41:34,682 INFO L402 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-01-12 14:41:34,682 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:41:34,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:41:34,683 INFO L82 PathProgramCache]: Analyzing trace with hash 405877855, now seen corresponding path program 1 times [2019-01-12 14:41:34,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:41:34,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:41:34,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:41:34,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:41:34,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:41:34,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:41:34,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:41:34,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:41:34,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:41:34,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:41:34,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:41:34,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:41:34,842 INFO L87 Difference]: Start difference. First operand 293 states and 437 transitions. Second operand 4 states. [2019-01-12 14:41:34,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:41:34,981 INFO L93 Difference]: Finished difference Result 364 states and 527 transitions. [2019-01-12 14:41:34,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 14:41:34,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-01-12 14:41:34,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:41:34,983 INFO L225 Difference]: With dead ends: 364 [2019-01-12 14:41:34,983 INFO L226 Difference]: Without dead ends: 229 [2019-01-12 14:41:34,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:41:34,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-01-12 14:41:35,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 197. [2019-01-12 14:41:35,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2019-01-12 14:41:35,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 293 transitions. [2019-01-12 14:41:35,006 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 293 transitions. Word has length 44 [2019-01-12 14:41:35,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:41:35,006 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 293 transitions. [2019-01-12 14:41:35,006 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:41:35,006 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 293 transitions. [2019-01-12 14:41:35,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-12 14:41:35,007 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:41:35,007 INFO L402 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, 1] [2019-01-12 14:41:35,008 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:41:35,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:41:35,008 INFO L82 PathProgramCache]: Analyzing trace with hash 495067749, now seen corresponding path program 1 times [2019-01-12 14:41:35,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:41:35,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:41:35,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:41:35,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:41:35,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:41:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:41:35,096 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:41:35,097 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:41:35,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:41:35,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:41:35,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:41:35,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:41:35,098 INFO L87 Difference]: Start difference. First operand 197 states and 293 transitions. Second operand 3 states. [2019-01-12 14:41:35,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:41:35,188 INFO L93 Difference]: Finished difference Result 551 states and 831 transitions. [2019-01-12 14:41:35,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:41:35,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-01-12 14:41:35,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:41:35,191 INFO L225 Difference]: With dead ends: 551 [2019-01-12 14:41:35,191 INFO L226 Difference]: Without dead ends: 373 [2019-01-12 14:41:35,192 INFO L631 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-01-12 14:41:35,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2019-01-12 14:41:35,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 253. [2019-01-12 14:41:35,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-01-12 14:41:35,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 397 transitions. [2019-01-12 14:41:35,221 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 397 transitions. Word has length 46 [2019-01-12 14:41:35,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:41:35,226 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 397 transitions. [2019-01-12 14:41:35,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:41:35,227 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 397 transitions. [2019-01-12 14:41:35,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-12 14:41:35,228 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:41:35,228 INFO L402 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, 1, 1] [2019-01-12 14:41:35,228 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:41:35,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:41:35,228 INFO L82 PathProgramCache]: Analyzing trace with hash -2020018879, now seen corresponding path program 1 times [2019-01-12 14:41:35,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:41:35,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:41:35,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:41:35,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:41:35,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:41:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:41:35,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:41:35,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:41:35,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:41:35,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:41:35,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:41:35,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:41:35,376 INFO L87 Difference]: Start difference. First operand 253 states and 397 transitions. Second operand 4 states. [2019-01-12 14:41:35,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:41:35,475 INFO L93 Difference]: Finished difference Result 281 states and 435 transitions. [2019-01-12 14:41:35,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 14:41:35,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-01-12 14:41:35,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:41:35,479 INFO L225 Difference]: With dead ends: 281 [2019-01-12 14:41:35,480 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 14:41:35,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:41:35,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 14:41:35,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 14:41:35,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 14:41:35,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 14:41:35,481 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 47 [2019-01-12 14:41:35,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:41:35,485 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 14:41:35,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:41:35,485 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 14:41:35,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 14:41:35,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 14:41:35,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:35,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:35,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:35,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:35,619 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:35,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:35,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:35,692 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:35,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:35,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:35,754 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:35,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:35,851 WARN L181 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 96 [2019-01-12 14:41:35,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:35,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:35,871 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:35,887 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:35,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:35,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:35,928 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:35,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:35,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:35,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,011 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,036 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,042 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,058 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,113 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,176 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,182 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,184 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,197 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,209 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 52 [2019-01-12 14:41:36,233 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,242 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,245 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,248 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,285 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,288 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,290 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,292 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,319 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,322 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,341 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,364 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,374 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 67 [2019-01-12 14:41:36,386 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,391 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,401 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,408 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,409 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,457 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,459 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,461 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:41:36,822 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2019-01-12 14:41:37,024 WARN L181 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2019-01-12 14:41:37,213 WARN L181 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2019-01-12 14:41:37,679 WARN L181 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 18 [2019-01-12 14:41:38,225 WARN L181 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 20 [2019-01-12 14:41:38,914 WARN L181 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 26 [2019-01-12 14:41:39,565 WARN L181 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 16 [2019-01-12 14:41:39,785 WARN L181 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 35 [2019-01-12 14:41:39,950 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 35 [2019-01-12 14:41:40,088 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-01-12 14:41:40,265 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 34 [2019-01-12 14:41:40,469 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 35 [2019-01-12 14:41:40,706 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2019-01-12 14:41:40,938 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 14 [2019-01-12 14:41:41,131 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 32 [2019-01-12 14:41:41,300 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 26 [2019-01-12 14:41:41,499 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 19 [2019-01-12 14:41:41,669 WARN L181 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 35 [2019-01-12 14:41:41,835 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 238) no Hoare annotation was computed. [2019-01-12 14:41:41,835 INFO L448 ceAbstractionStarter]: For program point L1986(lines 1986 1994) no Hoare annotation was computed. [2019-01-12 14:41:41,835 INFO L448 ceAbstractionStarter]: For program point L500(lines 500 511) no Hoare annotation was computed. [2019-01-12 14:41:41,835 INFO L448 ceAbstractionStarter]: For program point L500-1(lines 500 511) no Hoare annotation was computed. [2019-01-12 14:41:41,835 INFO L448 ceAbstractionStarter]: For program point L2449-1(lines 2449 2455) no Hoare annotation was computed. [2019-01-12 14:41:41,835 INFO L448 ceAbstractionStarter]: For program point L2449(lines 2449 2455) no Hoare annotation was computed. [2019-01-12 14:41:41,836 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 339) no Hoare annotation was computed. [2019-01-12 14:41:41,836 INFO L448 ceAbstractionStarter]: For program point L302(lines 302 306) no Hoare annotation was computed. [2019-01-12 14:41:41,836 INFO L448 ceAbstractionStarter]: For program point L269(lines 269 273) no Hoare annotation was computed. [2019-01-12 14:41:41,836 INFO L448 ceAbstractionStarter]: For program point L897(lines 897 903) no Hoare annotation was computed. [2019-01-12 14:41:41,836 INFO L444 ceAbstractionStarter]: At program point L897-1(lines 1 2544) the Hoare annotation is: (let ((.cse3 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= 2 ~rjh~0)) (.cse4 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse2 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse6 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (and .cse0 .cse1 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse2 (= ULTIMATE.start_getClientAutoResponse_~handle 2) .cse3 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse4 .cse5) .cse6) (and .cse3 .cse0 (= 1 |ULTIMATE.start_isReadable_#res|) (= ULTIMATE.start_setEmailTo_~handle 1) .cse1 .cse4 (= ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~9 1) .cse5 .cse2 .cse6))) [2019-01-12 14:41:41,837 INFO L448 ceAbstractionStarter]: For program point L897-2(lines 897 903) no Hoare annotation was computed. [2019-01-12 14:41:41,837 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 178) no Hoare annotation was computed. [2019-01-12 14:41:41,837 INFO L451 ceAbstractionStarter]: At program point L171-1(lines 171 178) the Hoare annotation is: true [2019-01-12 14:41:41,837 INFO L444 ceAbstractionStarter]: At program point L2517-1(lines 2512 2520) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 1 |ULTIMATE.start_isReadable_#res|) (= 2 ~rjh~0) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:41:41,837 INFO L444 ceAbstractionStarter]: At program point L2517(lines 2512 2520) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) (= 1 |ULTIMATE.start_createEmail_#res|) (= ULTIMATE.start_getClientAutoResponse_~handle 2) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_outgoing_~msg) (= 1 |ULTIMATE.start_isReadable_#res|) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ULTIMATE.start_setEmailTo_~handle 1) (= ULTIMATE.start_getEmailTo_~handle 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:41:41,837 INFO L448 ceAbstractionStarter]: For program point L1989(lines 1989 1993) no Hoare annotation was computed. [2019-01-12 14:41:41,837 INFO L444 ceAbstractionStarter]: At program point L1989-2(lines 1 2544) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:41:41,837 INFO L448 ceAbstractionStarter]: For program point L537(lines 537 548) no Hoare annotation was computed. [2019-01-12 14:41:41,838 INFO L448 ceAbstractionStarter]: For program point L504(lines 504 510) no Hoare annotation was computed. [2019-01-12 14:41:41,838 INFO L448 ceAbstractionStarter]: For program point L537-1(lines 537 548) no Hoare annotation was computed. [2019-01-12 14:41:41,838 INFO L448 ceAbstractionStarter]: For program point L504-1(lines 504 510) no Hoare annotation was computed. [2019-01-12 14:41:41,838 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 374) no Hoare annotation was computed. [2019-01-12 14:41:41,838 INFO L444 ceAbstractionStarter]: At program point L2454(lines 2437 2460) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ~__ste_email_to0~0) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_createEmail_~to) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:41:41,838 INFO L444 ceAbstractionStarter]: At program point L2454-1(lines 2437 2460) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= 2 ~rjh~0)) (.cse3 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse2 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse5 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 .cse1 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse2 (= ULTIMATE.start_getClientAutoResponse_~handle 2) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse3 .cse4 .cse5) (and .cse0 (= 1 |ULTIMATE.start_isReadable_#res|) (= ULTIMATE.start_setEmailTo_~handle 1) .cse1 .cse3 (= ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~9 1) .cse4 .cse2 .cse5))) [2019-01-12 14:41:41,838 INFO L444 ceAbstractionStarter]: At program point L968(lines 963 971) the Hoare annotation is: (let ((.cse3 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= 2 ~rjh~0)) (.cse4 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse2 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse6 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (and .cse0 .cse1 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse2 (= ULTIMATE.start_getClientAutoResponse_~handle 2) .cse3 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse4 .cse5) .cse6) (and .cse3 .cse0 (= 1 |ULTIMATE.start_isReadable_#res|) (= ULTIMATE.start_setEmailTo_~handle 1) .cse1 .cse4 (= ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~9 1) .cse5 .cse2 .cse6))) [2019-01-12 14:41:41,838 INFO L448 ceAbstractionStarter]: For program point L1959(lines 1959 1975) no Hoare annotation was computed. [2019-01-12 14:41:41,839 INFO L448 ceAbstractionStarter]: For program point L1959-1(lines 1959 1975) no Hoare annotation was computed. [2019-01-12 14:41:41,839 INFO L444 ceAbstractionStarter]: At program point L407(lines 1 2544) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (not (= ~rjh~0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:41:41,839 INFO L444 ceAbstractionStarter]: At program point L341(lines 331 366) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:41:41,839 INFO L444 ceAbstractionStarter]: At program point L308(lines 298 369) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:41:41,839 INFO L444 ceAbstractionStarter]: At program point L275(lines 265 372) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:41:41,839 INFO L448 ceAbstractionStarter]: For program point L541(lines 541 547) no Hoare annotation was computed. [2019-01-12 14:41:41,839 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 541 547) no Hoare annotation was computed. [2019-01-12 14:41:41,839 INFO L444 ceAbstractionStarter]: At program point L376(lines 231 377) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:41:41,839 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 248) no Hoare annotation was computed. [2019-01-12 14:41:41,840 INFO L448 ceAbstractionStarter]: For program point L1004(lines 1004 1010) no Hoare annotation was computed. [2019-01-12 14:41:41,840 INFO L448 ceAbstractionStarter]: For program point L1004-2(lines 1004 1010) no Hoare annotation was computed. [2019-01-12 14:41:41,840 INFO L444 ceAbstractionStarter]: At program point L509(lines 496 514) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) (= 1 |ULTIMATE.start_createEmail_#res|) (= ULTIMATE.start_getClientAutoResponse_~handle 2) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_outgoing_~msg) (= 1 |ULTIMATE.start_isReadable_#res|) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ULTIMATE.start_setEmailTo_~handle 1) (= ULTIMATE.start_getEmailTo_~handle 1) (= ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~9 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:41:41,840 INFO L451 ceAbstractionStarter]: At program point L509-1(lines 496 514) the Hoare annotation is: true [2019-01-12 14:41:41,840 INFO L451 ceAbstractionStarter]: At program point L179(lines 161 181) the Hoare annotation is: true [2019-01-12 14:41:41,840 INFO L448 ceAbstractionStarter]: For program point L1963(lines 1963 1974) no Hoare annotation was computed. [2019-01-12 14:41:41,840 INFO L448 ceAbstractionStarter]: For program point L1963-1(lines 1963 1974) no Hoare annotation was computed. [2019-01-12 14:41:41,840 INFO L448 ceAbstractionStarter]: For program point L346(lines 346 350) no Hoare annotation was computed. [2019-01-12 14:41:41,840 INFO L448 ceAbstractionStarter]: For program point L313(lines 313 317) no Hoare annotation was computed. [2019-01-12 14:41:41,840 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 284) no Hoare annotation was computed. [2019-01-12 14:41:41,841 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 123) no Hoare annotation was computed. [2019-01-12 14:41:41,841 INFO L444 ceAbstractionStarter]: At program point L876(lines 1 2544) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ULTIMATE.start_incoming_~client) (= ULTIMATE.start_getEmailTo_~handle 1) (= 2 ~__ste_email_to0~0) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_createEmail_~to) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:41:41,841 INFO L444 ceAbstractionStarter]: At program point L876-1(lines 1 2544) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:41:41,841 INFO L444 ceAbstractionStarter]: At program point L546(lines 533 551) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ULTIMATE.start_setEmailTo_~handle 1) (= ULTIMATE.start_getEmailTo_~handle 1) (= 2 ~__ste_email_to0~0) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_createEmail_~to) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:41:41,841 INFO L444 ceAbstractionStarter]: At program point L546-1(lines 533 551) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 2 ULTIMATE.start_createEmail_~to) (= 1 |ULTIMATE.start_createEmail_#res|) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:41:41,841 INFO L448 ceAbstractionStarter]: For program point L1967(lines 1967 1973) no Hoare annotation was computed. [2019-01-12 14:41:41,841 INFO L448 ceAbstractionStarter]: For program point L1967-1(lines 1967 1973) no Hoare annotation was computed. [2019-01-12 14:41:41,841 INFO L444 ceAbstractionStarter]: At program point L415(lines 410 418) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (not (= ~rjh~0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:41:41,842 INFO L444 ceAbstractionStarter]: At program point L250(lines 240 374) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:41:41,842 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 14:41:41,842 INFO L448 ceAbstractionStarter]: For program point L2465(lines 2465 2477) no Hoare annotation was computed. [2019-01-12 14:41:41,842 INFO L448 ceAbstractionStarter]: For program point L2465-2(lines 2465 2477) no Hoare annotation was computed. [2019-01-12 14:41:41,842 INFO L448 ceAbstractionStarter]: For program point L2465-4(lines 2465 2477) no Hoare annotation was computed. [2019-01-12 14:41:41,842 INFO L444 ceAbstractionStarter]: At program point L352(lines 342 365) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:41:41,842 INFO L444 ceAbstractionStarter]: At program point L319(lines 309 368) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:41:41,842 INFO L444 ceAbstractionStarter]: At program point L286(lines 276 371) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:41:41,842 INFO L444 ceAbstractionStarter]: At program point L1972(lines 1955 1978) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) (= 1 |ULTIMATE.start_createEmail_#res|) (= ULTIMATE.start_getClientAutoResponse_~handle 2) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_outgoing_~msg) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ULTIMATE.start_setEmailTo_~handle 1) (= ULTIMATE.start_getEmailTo_~handle 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:41:41,843 INFO L444 ceAbstractionStarter]: At program point L1972-1(lines 1955 1978) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse2 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (= 0 ~__ste_client_autoResponse1~0) .cse0 (not (= ULTIMATE.start_createEmail_~to 1)) (not (= ~rjh~0 1)) (= 0 |ULTIMATE.start_getClientAutoResponse_#res|) .cse1 .cse2) (and (= 2 ~rjh~0) (and .cse0 .cse1 .cse2) (= 2 ULTIMATE.start_createEmail_~to)))) [2019-01-12 14:41:41,843 INFO L448 ceAbstractionStarter]: For program point L519(lines 519 527) no Hoare annotation was computed. [2019-01-12 14:41:41,843 INFO L448 ceAbstractionStarter]: For program point L2468(lines 2468 2476) no Hoare annotation was computed. [2019-01-12 14:41:41,843 INFO L448 ceAbstractionStarter]: For program point L519-2(lines 519 527) no Hoare annotation was computed. [2019-01-12 14:41:41,843 INFO L448 ceAbstractionStarter]: For program point L2468-2(lines 2468 2476) no Hoare annotation was computed. [2019-01-12 14:41:41,843 INFO L448 ceAbstractionStarter]: For program point L519-4(lines 519 527) no Hoare annotation was computed. [2019-01-12 14:41:41,843 INFO L448 ceAbstractionStarter]: For program point L2468-4(lines 2468 2476) no Hoare annotation was computed. [2019-01-12 14:41:41,843 INFO L448 ceAbstractionStarter]: For program point L255(lines 255 262) no Hoare annotation was computed. [2019-01-12 14:41:41,843 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 14:41:41,843 INFO L444 ceAbstractionStarter]: At program point L950(lines 945 953) the Hoare annotation is: (let ((.cse3 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= 2 ~rjh~0)) (.cse4 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse2 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse6 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (and .cse0 .cse1 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse2 (= ULTIMATE.start_getClientAutoResponse_~handle 2) .cse3 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse4 .cse5) .cse6) (and .cse3 .cse0 (= 1 |ULTIMATE.start_isReadable_#res|) (= ULTIMATE.start_setEmailTo_~handle 1) .cse1 .cse4 (= ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~9 1) .cse5 .cse2 .cse6))) [2019-01-12 14:41:41,843 INFO L444 ceAbstractionStarter]: At program point L158(lines 138 160) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:41:41,844 INFO L448 ceAbstractionStarter]: For program point L522(lines 522 526) no Hoare annotation was computed. [2019-01-12 14:41:41,844 INFO L444 ceAbstractionStarter]: At program point L522-2(lines 515 530) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 2 ULTIMATE.start_createEmail_~to) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:41:41,844 INFO L448 ceAbstractionStarter]: For program point L522-3(lines 522 526) no Hoare annotation was computed. [2019-01-12 14:41:41,844 INFO L448 ceAbstractionStarter]: For program point L2471(lines 2471 2475) no Hoare annotation was computed. [2019-01-12 14:41:41,844 INFO L448 ceAbstractionStarter]: For program point L2471-3(lines 2471 2475) no Hoare annotation was computed. [2019-01-12 14:41:41,844 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 361) no Hoare annotation was computed. [2019-01-12 14:41:41,844 INFO L444 ceAbstractionStarter]: At program point L522-5(lines 515 530) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing_~msg) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ~__ste_email_to0~0) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_createEmail_~to) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:41:41,844 INFO L444 ceAbstractionStarter]: At program point L2471-2(lines 1 2544) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (not (= ~rjh~0 1)) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:41:41,844 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 328) no Hoare annotation was computed. [2019-01-12 14:41:41,844 INFO L444 ceAbstractionStarter]: At program point L357-1(lines 232 375) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:41:41,845 INFO L448 ceAbstractionStarter]: For program point L522-6(lines 522 526) no Hoare annotation was computed. [2019-01-12 14:41:41,845 INFO L444 ceAbstractionStarter]: At program point L2471-5(lines 1 2544) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (= ULTIMATE.start_setClientId_~handle 2) (= ULTIMATE.start_setClientId_~handle ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:41:41,845 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 295) no Hoare annotation was computed. [2019-01-12 14:41:41,845 INFO L444 ceAbstractionStarter]: At program point L522-8(lines 515 530) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= 2 ~rjh~0)) (.cse3 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse2 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse5 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 .cse1 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse2 (= ULTIMATE.start_getClientAutoResponse_~handle 2) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse3 .cse4 .cse5) (and .cse0 (= 1 |ULTIMATE.start_isReadable_#res|) (= ULTIMATE.start_setEmailTo_~handle 1) .cse1 .cse3 (= ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~9 1) .cse4 .cse2 .cse5))) [2019-01-12 14:41:41,845 INFO L448 ceAbstractionStarter]: For program point L2471-6(lines 2471 2475) no Hoare annotation was computed. [2019-01-12 14:41:41,845 INFO L444 ceAbstractionStarter]: At program point L2471-8(lines 1 2544) the Hoare annotation is: (and (= 0 ~__ste_client_autoResponse1~0) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:41:41,845 INFO L448 ceAbstractionStarter]: For program point L556(lines 556 564) no Hoare annotation was computed. [2019-01-12 14:41:41,845 INFO L448 ceAbstractionStarter]: For program point L556-2(lines 556 564) no Hoare annotation was computed. [2019-01-12 14:41:41,845 INFO L448 ceAbstractionStarter]: For program point L556-4(lines 556 564) no Hoare annotation was computed. [2019-01-12 14:41:41,845 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 14:41:41,846 INFO L448 ceAbstractionStarter]: For program point L1019(line 1019) no Hoare annotation was computed. [2019-01-12 14:41:41,846 INFO L448 ceAbstractionStarter]: For program point L1019-1(line 1019) no Hoare annotation was computed. [2019-01-12 14:41:41,846 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1019) no Hoare annotation was computed. [2019-01-12 14:41:41,846 INFO L444 ceAbstractionStarter]: At program point L1020(lines 996 1013) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) (= 1 |ULTIMATE.start_createEmail_#res|) (= ULTIMATE.start_getClientAutoResponse_~handle 2) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_outgoing_~msg) (= 1 |ULTIMATE.start_isReadable_#res|) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ULTIMATE.start_setEmailTo_~handle 1) (= ULTIMATE.start_getEmailTo_~handle 1) (= ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~9 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:41:41,846 INFO L451 ceAbstractionStarter]: At program point L1020-1(lines 996 1013) the Hoare annotation is: true [2019-01-12 14:41:41,846 INFO L448 ceAbstractionStarter]: For program point L2441-1(lines 2441 2457) no Hoare annotation was computed. [2019-01-12 14:41:41,846 INFO L448 ceAbstractionStarter]: For program point L2441(lines 2441 2457) no Hoare annotation was computed. [2019-01-12 14:41:41,846 INFO L448 ceAbstractionStarter]: For program point L559(lines 559 563) no Hoare annotation was computed. [2019-01-12 14:41:41,847 INFO L444 ceAbstractionStarter]: At program point L559-2(lines 552 567) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ~rjh~0) (= 2 ~__ste_email_to0~0) (= 2 ULTIMATE.start_createEmail_~to) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:41:41,847 INFO L444 ceAbstractionStarter]: At program point L2541(lines 2530 2544) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ~rjh~0) (= 2 ~__ste_email_to0~0) (= 2 ULTIMATE.start_createEmail_~to) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:41:41,847 INFO L448 ceAbstractionStarter]: For program point L559-3(lines 559 563) no Hoare annotation was computed. [2019-01-12 14:41:41,847 INFO L444 ceAbstractionStarter]: At program point L559-5(lines 552 567) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse3 (= 2 ~rjh~0)) (.cse7 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse2 (= 1 |ULTIMATE.start_isReadable_#res|)) (.cse4 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse5 (= ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~9 1)) (.cse6 (= 2 ULTIMATE.start_createEmail_~to)) (.cse8 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 .cse1 .cse2 (= ULTIMATE.start_setEmailTo_~handle 1) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse1 .cse3 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse7 (= ULTIMATE.start_getClientAutoResponse_~handle 2) .cse0 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse2 .cse4 .cse5 .cse6 .cse8))) [2019-01-12 14:41:41,847 INFO L448 ceAbstractionStarter]: For program point L559-6(lines 559 563) no Hoare annotation was computed. [2019-01-12 14:41:41,847 INFO L451 ceAbstractionStarter]: At program point L559-8(lines 552 567) the Hoare annotation is: true [2019-01-12 14:41:41,847 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 14:41:41,847 INFO L444 ceAbstractionStarter]: At program point L330(lines 320 367) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:41:41,847 INFO L444 ceAbstractionStarter]: At program point L297(lines 287 370) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:41:41,848 INFO L444 ceAbstractionStarter]: At program point L264(lines 251 373) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:41:41,848 INFO L448 ceAbstractionStarter]: For program point L2445-1(lines 2445 2456) no Hoare annotation was computed. [2019-01-12 14:41:41,848 INFO L448 ceAbstractionStarter]: For program point L2445(lines 2445 2456) no Hoare annotation was computed. [2019-01-12 14:41:41,848 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1019) no Hoare annotation was computed. [2019-01-12 14:41:41,848 INFO L448 ceAbstractionStarter]: For program point L1983(lines 1983 1995) no Hoare annotation was computed. [2019-01-12 14:41:41,848 INFO L444 ceAbstractionStarter]: At program point L959(lines 954 962) the Hoare annotation is: (let ((.cse3 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= 2 ~rjh~0)) (.cse4 (= ULTIMATE.start_getEmailTo_~handle 1)) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse2 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse6 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (and .cse0 .cse1 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse2 (= ULTIMATE.start_getClientAutoResponse_~handle 2) .cse3 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse4 .cse5) .cse6) (and .cse3 .cse0 (= 1 |ULTIMATE.start_isReadable_#res|) (= ULTIMATE.start_setEmailTo_~handle 1) .cse1 .cse4 (= ULTIMATE.start___utac_acc__DecryptAutoResponder_spec__1_~tmp~9 1) .cse5 .cse2 .cse6))) [2019-01-12 14:41:41,848 INFO L448 ceAbstractionStarter]: For program point L233(lines 232 375) no Hoare annotation was computed. [2019-01-12 14:41:41,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:41:41 BoogieIcfgContainer [2019-01-12 14:41:41,904 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:41:41,904 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:41:41,904 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:41:41,905 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:41:41,905 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:41:27" (3/4) ... [2019-01-12 14:41:41,911 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 14:41:41,947 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 61 nodes and edges [2019-01-12 14:41:41,950 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2019-01-12 14:41:41,951 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 14:41:41,953 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 14:41:41,992 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((handle == 3 && handle == 1) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && 1 == \result) && 2 == value) && 1 == msg [2019-01-12 14:41:41,992 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((1 == msg && handle == 3) && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && 2 == value) && 1 == msg [2019-01-12 14:41:41,993 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((1 == msg && handle == 3) && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && 2 == value) && 1 == msg [2019-01-12 14:41:41,993 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 == msg && handle == 3) && 2 == rjh) && 2 == \result) && handle == 1) && handle == 1) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && 2 == value) && 1 == msg [2019-01-12 14:41:41,993 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((1 == msg && handle == 3) && 2 == rjh) && 2 == \result) && handle == 1) && 2 == client) && handle == 1) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && 2 == value) && 1 == msg [2019-01-12 14:41:41,994 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 2 == value) && 1 == msg) && 2 == \result) && handle == 1) && handle == 1) && 2 == to) && 1 == msg [2019-01-12 14:41:41,994 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 1 == msg) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) || (((((((((1 == msg && handle == 3) && 1 == \result) && handle == 1) && 2 == rjh) && handle == 1) && tmp == 1) && 2 == to) && 1 == \result) && 1 == msg) [2019-01-12 14:41:41,994 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 1 == msg) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) || (((((((((1 == msg && handle == 3) && 1 == \result) && handle == 1) && 2 == rjh) && handle == 1) && tmp == 1) && 2 == to) && 1 == \result) && 1 == msg) [2019-01-12 14:41:41,994 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 1 == msg) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) || (((((((((1 == msg && handle == 3) && 1 == \result) && handle == 1) && 2 == rjh) && handle == 1) && tmp == 1) && 2 == to) && 1 == \result) && 1 == msg) [2019-01-12 14:41:41,998 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 2 == value) && 1 == msg) && 1 == \result) && 2 == \result) && handle == 1) && handle == 1) && 2 == to) && 1 == msg [2019-01-12 14:41:41,998 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 1 == msg) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) || (((((((((1 == msg && handle == 3) && 1 == \result) && handle == 1) && 2 == rjh) && handle == 1) && tmp == 1) && 2 == to) && 1 == \result) && 1 == msg) [2019-01-12 14:41:41,998 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 2 == value) && 1 == msg) && 1 == \result) && 2 == \result) && handle == 1) && handle == 1) && tmp == 1) && 2 == to) && 1 == msg [2019-01-12 14:41:41,999 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 2 == value) && 1 == msg) && 1 == \result) && 2 == \result) && handle == 1) && handle == 1) && tmp == 1) && 2 == to) && 1 == msg [2019-01-12 14:41:41,999 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) || ((((((((handle == 3 && 1 == \result) && handle == 1) && 2 == rjh) && handle == 1) && tmp == 1) && 2 == to) && 1 == \result) && 1 == msg) [2019-01-12 14:41:41,999 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 == msg && handle == 3) && 1 == \result) && handle == 1) && 2 == rjh) && handle == 1) && tmp == 1) && 2 == to) && 1 == \result) && 1 == msg) || ((((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 1 == msg) && 2 == \result) && 1 == \result) && handle == 1) && tmp == 1) && 2 == to) && 1 == msg) [2019-01-12 14:41:42,000 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) || ((((((((handle == 3 && 1 == \result) && handle == 1) && 2 == rjh) && handle == 1) && tmp == 1) && 2 == to) && 1 == \result) && 1 == msg) [2019-01-12 14:41:42,000 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && 2 == rjh) && 2 == to) && 1 == \result) && 1 == msg [2019-01-12 14:41:42,000 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && 1 == msg [2019-01-12 14:41:42,000 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((0 == __ste_client_autoResponse1 && handle == 3) && !(to == 1)) && !(rjh == 1)) && 0 == \result) && 1 == \result) && 1 == msg) || ((2 == rjh && (handle == 3 && 1 == \result) && 1 == msg) && 2 == to) [2019-01-12 14:41:42,005 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((handle == 3 && 1 == \result) && 2 == rjh) && 1 == \result) && 2 == to) && 1 == msg [2019-01-12 14:41:42,111 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:41:42,111 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:41:42,112 INFO L168 Benchmark]: Toolchain (without parser) took 17523.83 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 338.7 MB). Free memory was 943.3 MB in the beginning and 1.3 GB in the end (delta: -351.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:41:42,114 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:41:42,114 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1020.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -178.3 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. [2019-01-12 14:41:42,114 INFO L168 Benchmark]: Boogie Procedure Inliner took 113.96 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-01-12 14:41:42,114 INFO L168 Benchmark]: Boogie Preprocessor took 55.59 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-01-12 14:41:42,115 INFO L168 Benchmark]: RCFGBuilder took 1847.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 84.3 MB). Peak memory consumption was 84.3 MB. Max. memory is 11.5 GB. [2019-01-12 14:41:42,115 INFO L168 Benchmark]: TraceAbstraction took 14274.87 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -282.7 MB). Peak memory consumption was 371.8 MB. Max. memory is 11.5 GB. [2019-01-12 14:41:42,115 INFO L168 Benchmark]: Witness Printer took 207.06 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. [2019-01-12 14:41:42,120 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1020.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -178.3 MB). Peak memory consumption was 50.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 113.96 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. * Boogie Preprocessor took 55.59 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. * RCFGBuilder took 1847.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 84.3 MB). Peak memory consumption was 84.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14274.87 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.5 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -282.7 MB). Peak memory consumption was 371.8 MB. Max. memory is 11.5 GB. * Witness Printer took 207.06 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1019]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1019]: 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: 240]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 231]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: (((((handle == 3 && handle == 1) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && 2 == value) && 1 == msg - InvariantResult [Line: 2530]: Loop Invariant Derived loop invariant: ((((((handle == 3 && handle == 1) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && 1 == \result) && 2 == value) && 1 == msg - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: (((((((((1 == msg && handle == 3) && 2 == rjh) && 2 == \result) && handle == 1) && handle == 1) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && 2 == value) && 1 == msg - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (0 == __ste_client_autoResponse1 && !(rjh == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 533]: Loop Invariant Derived loop invariant: (((handle == 3 && 2 == rjh) && 2 == to) && 1 == \result) && 1 == msg - InvariantResult [Line: 945]: Loop Invariant Derived loop invariant: ((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 1 == msg) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) || (((((((((1 == msg && handle == 3) && 1 == \result) && handle == 1) && 2 == rjh) && handle == 1) && tmp == 1) && 2 == to) && 1 == \result) && 1 == msg) - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 342]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 1 == msg) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) || (((((((((1 == msg && handle == 3) && 1 == \result) && handle == 1) && 2 == rjh) && handle == 1) && tmp == 1) && 2 == to) && 1 == \result) && 1 == msg) - InvariantResult [Line: 331]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 320]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2512]: Loop Invariant Derived loop invariant: ((((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 2 == value) && 1 == msg) && 1 == \result) && 2 == \result) && handle == 1) && handle == 1) && 2 == to) && 1 == msg - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: (((((((((1 == msg && handle == 3) && 1 == \result) && handle == 1) && 2 == rjh) && handle == 1) && tmp == 1) && 2 == to) && 1 == \result) && 1 == msg) || ((((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 1 == msg) && 2 == \result) && 1 == \result) && handle == 1) && tmp == 1) && 2 == to) && 1 == msg) - InvariantResult [Line: 309]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 954]: Loop Invariant Derived loop invariant: ((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 1 == msg) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) || (((((((((1 == msg && handle == 3) && 1 == \result) && handle == 1) && 2 == rjh) && handle == 1) && tmp == 1) && 2 == to) && 1 == \result) && 1 == msg) - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 996]: Loop Invariant Derived loop invariant: (((((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 2 == value) && 1 == msg) && 1 == \result) && 2 == \result) && handle == 1) && handle == 1) && tmp == 1) && 2 == to) && 1 == msg - InvariantResult [Line: 996]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 232]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((0 == __ste_client_autoResponse1 && handle == 2) && handle == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: (((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) || ((((((((handle == 3 && 1 == \result) && handle == 1) && 2 == rjh) && handle == 1) && tmp == 1) && 2 == to) && 1 == \result) && 1 == msg) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((1 == msg && handle == 3) && 2 == rjh) && 2 == \result) && handle == 1) && 2 == client) && handle == 1) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && 2 == value) && 1 == msg - InvariantResult [Line: 2437]: Loop Invariant Derived loop invariant: (((((((1 == msg && handle == 3) && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && 2 == value) && 1 == msg - InvariantResult [Line: 251]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && 1 == msg - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((0 == __ste_client_autoResponse1 && handle == 3) && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 265]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((0 == __ste_client_autoResponse1 && handle == 3) && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 276]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 287]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2437]: Loop Invariant Derived loop invariant: (((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) || ((((((((handle == 3 && 1 == \result) && handle == 1) && 2 == rjh) && handle == 1) && tmp == 1) && 2 == to) && 1 == \result) && 1 == msg) - InvariantResult [Line: 410]: Loop Invariant Derived loop invariant: (0 == __ste_client_autoResponse1 && !(rjh == 1)) && !(__ste_email_to0 == 1) - InvariantResult [Line: 298]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1955]: Loop Invariant Derived loop invariant: ((((((0 == __ste_client_autoResponse1 && handle == 3) && !(to == 1)) && !(rjh == 1)) && 0 == \result) && 1 == \result) && 1 == msg) || ((2 == rjh && (handle == 3 && 1 == \result) && 1 == msg) && 2 == to) - InvariantResult [Line: 1955]: Loop Invariant Derived loop invariant: (((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 2 == value) && 1 == msg) && 2 == \result) && handle == 1) && handle == 1) && 2 == to) && 1 == msg - InvariantResult [Line: 2512]: Loop Invariant Derived loop invariant: ((((handle == 3 && 1 == \result) && 2 == rjh) && 1 == \result) && 2 == to) && 1 == msg - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: (((handle == 3 && 2 == rjh) && 2 == to) && !(__ste_email_to0 == 1)) && 1 == msg - InvariantResult [Line: 963]: Loop Invariant Derived loop invariant: ((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 1 == msg) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) || (((((((((1 == msg && handle == 3) && 1 == \result) && handle == 1) && 2 == rjh) && handle == 1) && tmp == 1) && 2 == to) && 1 == \result) && 1 == msg) - InvariantResult [Line: 496]: Loop Invariant Derived loop invariant: (((((((((((((handle == 3 && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && handle == 2) && 2 == value) && 1 == msg) && 1 == \result) && 2 == \result) && handle == 1) && handle == 1) && tmp == 1) && 2 == to) && 1 == msg - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 496]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 515]: Loop Invariant Derived loop invariant: (((((((1 == msg && handle == 3) && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && 2 == value) && 1 == msg - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (0 == __ste_client_autoResponse1 && !(rjh == 1)) && !(__ste_email_to0 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 118 locations, 2 error locations. SAFE Result, 14.1s OverallTime, 11 OverallIterations, 2 TraceHistogramMax, 4.3s AutomataDifference, 0.0s DeadEndRemovalTime, 6.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 2010 SDtfs, 3203 SDslu, 3642 SDs, 0 SdLazy, 378 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 301 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=293occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 776 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 46 LocationsWithAnnotation, 46 PreInvPairs, 172 NumberOfFragments, 1150 HoareAnnotationTreeSize, 46 FomulaSimplifications, 302804 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 46 FomulaSimplificationsInter, 15746 FormulaSimplificationTreeSizeReductionInter, 5.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 440 NumberOfCodeBlocks, 440 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 429 ConstructedInterpolants, 0 QuantifiedInterpolants, 27983 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 14/14 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...