./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/email_spec0_product05_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa 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_spec0_product05_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 287a23d08eab86c6fb35463a3e779b64ab9bd712 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 09:30:44,568 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 09:30:44,569 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 09:30:44,583 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 09:30:44,583 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 09:30:44,585 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 09:30:44,586 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 09:30:44,588 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 09:30:44,590 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 09:30:44,591 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 09:30:44,592 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 09:30:44,593 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 09:30:44,594 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 09:30:44,595 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 09:30:44,596 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 09:30:44,597 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 09:30:44,598 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 09:30:44,601 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 09:30:44,603 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 09:30:44,606 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 09:30:44,607 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 09:30:44,608 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 09:30:44,611 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 09:30:44,612 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 09:30:44,612 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 09:30:44,613 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 09:30:44,614 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 09:30:44,616 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 09:30:44,617 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 09:30:44,619 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 09:30:44,619 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 09:30:44,620 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 09:30:44,620 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 09:30:44,620 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 09:30:44,622 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 09:30:44,623 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 09:30:44,623 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 09:30:44,644 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 09:30:44,647 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 09:30:44,650 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 09:30:44,651 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 09:30:44,652 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 09:30:44,652 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 09:30:44,652 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 09:30:44,652 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 09:30:44,652 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 09:30:44,653 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 09:30:44,653 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 09:30:44,653 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 09:30:44,653 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 09:30:44,653 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 09:30:44,653 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 09:30:44,656 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 09:30:44,656 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 09:30:44,656 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 09:30:44,657 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 09:30:44,658 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 09:30:44,659 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 09:30:44,659 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 09:30:44,659 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 09:30:44,659 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 09:30:44,660 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 09:30:44,660 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 09:30:44,660 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 09:30:44,660 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 09:30:44,660 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 -> 287a23d08eab86c6fb35463a3e779b64ab9bd712 [2018-12-31 09:30:44,724 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 09:30:44,742 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 09:30:44,748 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 09:30:44,750 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 09:30:44,750 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 09:30:44,751 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/email_spec0_product05_true-unreach-call_true-termination.cil.c [2018-12-31 09:30:44,818 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d63e8cce9/342ce058b73f485b9cbe09c6481b4623/FLAG73fa8a12e [2018-12-31 09:30:45,330 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 09:30:45,331 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/email_spec0_product05_true-unreach-call_true-termination.cil.c [2018-12-31 09:30:45,356 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d63e8cce9/342ce058b73f485b9cbe09c6481b4623/FLAG73fa8a12e [2018-12-31 09:30:45,682 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d63e8cce9/342ce058b73f485b9cbe09c6481b4623 [2018-12-31 09:30:45,686 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 09:30:45,688 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 09:30:45,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 09:30:45,692 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 09:30:45,698 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 09:30:45,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:30:45" (1/1) ... [2018-12-31 09:30:45,703 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65f79300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:30:45, skipping insertion in model container [2018-12-31 09:30:45,703 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 09:30:45" (1/1) ... [2018-12-31 09:30:45,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 09:30:45,808 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 09:30:46,495 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:30:46,520 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 09:30:46,761 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 09:30:46,827 INFO L195 MainTranslator]: Completed translation [2018-12-31 09:30:46,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:30:46 WrapperNode [2018-12-31 09:30:46,828 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 09:30:46,829 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 09:30:46,829 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 09:30:46,829 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 09:30:46,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:30:46" (1/1) ... [2018-12-31 09:30:46,874 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:30:46" (1/1) ... [2018-12-31 09:30:46,960 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 09:30:46,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 09:30:46,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 09:30:46,961 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 09:30:46,973 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:30:46" (1/1) ... [2018-12-31 09:30:46,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:30:46" (1/1) ... [2018-12-31 09:30:46,982 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:30:46" (1/1) ... [2018-12-31 09:30:46,982 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:30:46" (1/1) ... [2018-12-31 09:30:47,011 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:30:46" (1/1) ... [2018-12-31 09:30:47,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:30:46" (1/1) ... [2018-12-31 09:30:47,037 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:30:46" (1/1) ... [2018-12-31 09:30:47,044 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 09:30:47,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 09:30:47,054 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 09:30:47,054 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 09:30:47,055 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:30:46" (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 [2018-12-31 09:30:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2018-12-31 09:30:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 09:30:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-31 09:30:47,133 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 09:30:47,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 09:30:49,157 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 09:30:49,157 INFO L280 CfgBuilder]: Removed 127 assue(true) statements. [2018-12-31 09:30:49,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:30:49 BoogieIcfgContainer [2018-12-31 09:30:49,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 09:30:49,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 09:30:49,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 09:30:49,164 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 09:30:49,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 09:30:45" (1/3) ... [2018-12-31 09:30:49,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388e61b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:30:49, skipping insertion in model container [2018-12-31 09:30:49,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 09:30:46" (2/3) ... [2018-12-31 09:30:49,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@388e61b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 09:30:49, skipping insertion in model container [2018-12-31 09:30:49,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:30:49" (3/3) ... [2018-12-31 09:30:49,169 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec0_product05_true-unreach-call_true-termination.cil.c [2018-12-31 09:30:49,180 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 09:30:49,189 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2018-12-31 09:30:49,207 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2018-12-31 09:30:49,242 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 09:30:49,243 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 09:30:49,243 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 09:30:49,243 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 09:30:49,244 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 09:30:49,244 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 09:30:49,244 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 09:30:49,244 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 09:30:49,244 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 09:30:49,265 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states. [2018-12-31 09:30:49,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-31 09:30:49,274 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:30:49,275 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] [2018-12-31 09:30:49,277 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:30:49,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:30:49,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1721357046, now seen corresponding path program 1 times [2018-12-31 09:30:49,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:30:49,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:30:49,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:49,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:30:49,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:30:49,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:30:49,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:30:49,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 09:30:49,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 09:30:49,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 09:30:49,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 09:30:49,644 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 2 states. [2018-12-31 09:30:49,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:30:49,680 INFO L93 Difference]: Finished difference Result 221 states and 347 transitions. [2018-12-31 09:30:49,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 09:30:49,682 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 34 [2018-12-31 09:30:49,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:30:49,696 INFO L225 Difference]: With dead ends: 221 [2018-12-31 09:30:49,696 INFO L226 Difference]: Without dead ends: 118 [2018-12-31 09:30:49,700 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 [2018-12-31 09:30:49,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-31 09:30:49,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-12-31 09:30:49,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-12-31 09:30:49,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 187 transitions. [2018-12-31 09:30:49,753 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 187 transitions. Word has length 34 [2018-12-31 09:30:49,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:30:49,754 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 187 transitions. [2018-12-31 09:30:49,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 09:30:49,754 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 187 transitions. [2018-12-31 09:30:49,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-31 09:30:49,756 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:30:49,756 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] [2018-12-31 09:30:49,756 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:30:49,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:30:49,757 INFO L82 PathProgramCache]: Analyzing trace with hash -122239248, now seen corresponding path program 1 times [2018-12-31 09:30:49,757 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:30:49,757 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:30:49,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:49,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:30:49,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:30:49,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:30:49,943 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:30:49,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:30:49,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:30:49,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:30:49,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:30:49,946 INFO L87 Difference]: Start difference. First operand 118 states and 187 transitions. Second operand 3 states. [2018-12-31 09:30:50,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:30:50,102 INFO L93 Difference]: Finished difference Result 327 states and 519 transitions. [2018-12-31 09:30:50,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:30:50,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-31 09:30:50,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:30:50,110 INFO L225 Difference]: With dead ends: 327 [2018-12-31 09:30:50,110 INFO L226 Difference]: Without dead ends: 220 [2018-12-31 09:30:50,112 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 [2018-12-31 09:30:50,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-12-31 09:30:50,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 117. [2018-12-31 09:30:50,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-31 09:30:50,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 183 transitions. [2018-12-31 09:30:50,150 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 183 transitions. Word has length 35 [2018-12-31 09:30:50,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:30:50,151 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 183 transitions. [2018-12-31 09:30:50,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:30:50,151 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 183 transitions. [2018-12-31 09:30:50,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-31 09:30:50,156 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:30:50,157 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] [2018-12-31 09:30:50,157 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:30:50,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:30:50,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2107249571, now seen corresponding path program 1 times [2018-12-31 09:30:50,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:30:50,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:30:50,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:50,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:30:50,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:30:50,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:30:50,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:30:50,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:30:50,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:30:50,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:30:50,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:30:50,306 INFO L87 Difference]: Start difference. First operand 117 states and 183 transitions. Second operand 3 states. [2018-12-31 09:30:50,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:30:50,507 INFO L93 Difference]: Finished difference Result 220 states and 346 transitions. [2018-12-31 09:30:50,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:30:50,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-31 09:30:50,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:30:50,512 INFO L225 Difference]: With dead ends: 220 [2018-12-31 09:30:50,515 INFO L226 Difference]: Without dead ends: 118 [2018-12-31 09:30:50,516 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 [2018-12-31 09:30:50,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-12-31 09:30:50,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-12-31 09:30:50,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-12-31 09:30:50,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 180 transitions. [2018-12-31 09:30:50,540 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 180 transitions. Word has length 36 [2018-12-31 09:30:50,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:30:50,540 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 180 transitions. [2018-12-31 09:30:50,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:30:50,543 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 180 transitions. [2018-12-31 09:30:50,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-31 09:30:50,544 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:30:50,544 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, 1, 1] [2018-12-31 09:30:50,545 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:30:50,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:30:50,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1032935230, now seen corresponding path program 1 times [2018-12-31 09:30:50,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:30:50,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:30:50,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:50,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:30:50,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:50,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:30:50,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:30:50,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:30:50,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:30:50,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:30:50,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:30:50,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:30:50,654 INFO L87 Difference]: Start difference. First operand 117 states and 180 transitions. Second operand 3 states. [2018-12-31 09:30:50,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:30:50,684 INFO L93 Difference]: Finished difference Result 191 states and 289 transitions. [2018-12-31 09:30:50,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:30:50,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-12-31 09:30:50,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:30:50,691 INFO L225 Difference]: With dead ends: 191 [2018-12-31 09:30:50,691 INFO L226 Difference]: Without dead ends: 120 [2018-12-31 09:30:50,692 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 [2018-12-31 09:30:50,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-12-31 09:30:50,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2018-12-31 09:30:50,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-12-31 09:30:50,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 182 transitions. [2018-12-31 09:30:50,709 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 182 transitions. Word has length 38 [2018-12-31 09:30:50,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:30:50,710 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 182 transitions. [2018-12-31 09:30:50,710 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:30:50,710 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 182 transitions. [2018-12-31 09:30:50,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-31 09:30:50,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:30:50,715 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] [2018-12-31 09:30:50,715 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:30:50,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:30:50,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1719269101, now seen corresponding path program 1 times [2018-12-31 09:30:50,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:30:50,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:30:50,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:50,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:30:50,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:30:51,499 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 09:30:51,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:30:51,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 09:30:51,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 09:30:51,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 09:30:51,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-31 09:30:51,501 INFO L87 Difference]: Start difference. First operand 119 states and 182 transitions. Second operand 10 states. [2018-12-31 09:30:52,188 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-12-31 09:30:53,586 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-12-31 09:30:53,855 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-12-31 09:30:54,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:30:54,280 INFO L93 Difference]: Finished difference Result 562 states and 790 transitions. [2018-12-31 09:30:54,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-31 09:30:54,281 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 43 [2018-12-31 09:30:54,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:30:54,285 INFO L225 Difference]: With dead ends: 562 [2018-12-31 09:30:54,286 INFO L226 Difference]: Without dead ends: 513 [2018-12-31 09:30:54,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2018-12-31 09:30:54,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-12-31 09:30:54,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 153. [2018-12-31 09:30:54,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-12-31 09:30:54,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 229 transitions. [2018-12-31 09:30:54,329 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 229 transitions. Word has length 43 [2018-12-31 09:30:54,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:30:54,330 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 229 transitions. [2018-12-31 09:30:54,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 09:30:54,330 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 229 transitions. [2018-12-31 09:30:54,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-31 09:30:54,331 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:30:54,331 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] [2018-12-31 09:30:54,332 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:30:54,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:30:54,332 INFO L82 PathProgramCache]: Analyzing trace with hash 943468756, now seen corresponding path program 1 times [2018-12-31 09:30:54,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:30:54,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:30:54,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:54,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:30:54,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:30:54,651 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 09:30:54,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:30:54,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 09:30:54,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 09:30:54,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 09:30:54,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 09:30:54,652 INFO L87 Difference]: Start difference. First operand 153 states and 229 transitions. Second operand 6 states. [2018-12-31 09:30:54,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:30:54,871 INFO L93 Difference]: Finished difference Result 285 states and 410 transitions. [2018-12-31 09:30:54,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 09:30:54,874 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2018-12-31 09:30:54,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:30:54,876 INFO L225 Difference]: With dead ends: 285 [2018-12-31 09:30:54,876 INFO L226 Difference]: Without dead ends: 196 [2018-12-31 09:30:54,877 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 [2018-12-31 09:30:54,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-31 09:30:54,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 149. [2018-12-31 09:30:54,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-12-31 09:30:54,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 222 transitions. [2018-12-31 09:30:54,896 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 222 transitions. Word has length 44 [2018-12-31 09:30:54,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:30:54,896 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 222 transitions. [2018-12-31 09:30:54,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 09:30:54,896 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 222 transitions. [2018-12-31 09:30:54,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-31 09:30:54,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:30:54,898 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] [2018-12-31 09:30:54,899 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:30:54,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:30:54,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1174671319, now seen corresponding path program 1 times [2018-12-31 09:30:54,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:30:54,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:30:54,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:54,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:30:54,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:30:55,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 09:30:55,042 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:30:55,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:30:55,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 09:30:55,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 09:30:55,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:30:55,045 INFO L87 Difference]: Start difference. First operand 149 states and 222 transitions. Second operand 5 states. [2018-12-31 09:30:55,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:30:55,569 INFO L93 Difference]: Finished difference Result 433 states and 638 transitions. [2018-12-31 09:30:55,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 09:30:55,570 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-12-31 09:30:55,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:30:55,572 INFO L225 Difference]: With dead ends: 433 [2018-12-31 09:30:55,572 INFO L226 Difference]: Without dead ends: 351 [2018-12-31 09:30:55,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:30:55,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-12-31 09:30:55,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 271. [2018-12-31 09:30:55,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-12-31 09:30:55,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 411 transitions. [2018-12-31 09:30:55,606 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 411 transitions. Word has length 44 [2018-12-31 09:30:55,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:30:55,606 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 411 transitions. [2018-12-31 09:30:55,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 09:30:55,607 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 411 transitions. [2018-12-31 09:30:55,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-31 09:30:55,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:30:55,608 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] [2018-12-31 09:30:55,608 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:30:55,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:30:55,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1596126344, now seen corresponding path program 1 times [2018-12-31 09:30:55,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:30:55,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:30:55,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:55,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:30:55,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:55,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:30:55,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 09:30:55,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:30:55,841 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-31 09:30:55,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-31 09:30:55,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-31 09:30:55,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-12-31 09:30:55,842 INFO L87 Difference]: Start difference. First operand 271 states and 411 transitions. Second operand 9 states. [2018-12-31 09:30:56,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:30:56,830 INFO L93 Difference]: Finished difference Result 800 states and 1135 transitions. [2018-12-31 09:30:56,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-31 09:30:56,831 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-12-31 09:30:56,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:30:56,835 INFO L225 Difference]: With dead ends: 800 [2018-12-31 09:30:56,835 INFO L226 Difference]: Without dead ends: 642 [2018-12-31 09:30:56,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2018-12-31 09:30:56,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2018-12-31 09:30:56,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 350. [2018-12-31 09:30:56,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-12-31 09:30:56,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 521 transitions. [2018-12-31 09:30:56,885 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 521 transitions. Word has length 45 [2018-12-31 09:30:56,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:30:56,885 INFO L480 AbstractCegarLoop]: Abstraction has 350 states and 521 transitions. [2018-12-31 09:30:56,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-31 09:30:56,885 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 521 transitions. [2018-12-31 09:30:56,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-31 09:30:56,886 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:30:56,887 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] [2018-12-31 09:30:56,887 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:30:56,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:30:56,887 INFO L82 PathProgramCache]: Analyzing trace with hash -792285918, now seen corresponding path program 1 times [2018-12-31 09:30:56,887 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:30:56,887 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:30:56,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:56,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:30:56,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:30:56,991 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 09:30:56,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:30:56,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:30:56,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 09:30:56,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 09:30:56,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 09:30:56,992 INFO L87 Difference]: Start difference. First operand 350 states and 521 transitions. Second operand 4 states. [2018-12-31 09:30:57,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:30:57,102 INFO L93 Difference]: Finished difference Result 441 states and 637 transitions. [2018-12-31 09:30:57,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 09:30:57,103 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-31 09:30:57,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:30:57,104 INFO L225 Difference]: With dead ends: 441 [2018-12-31 09:30:57,104 INFO L226 Difference]: Without dead ends: 257 [2018-12-31 09:30:57,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 09:30:57,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-12-31 09:30:57,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 222. [2018-12-31 09:30:57,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-12-31 09:30:57,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 330 transitions. [2018-12-31 09:30:57,131 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 330 transitions. Word has length 46 [2018-12-31 09:30:57,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:30:57,132 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 330 transitions. [2018-12-31 09:30:57,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 09:30:57,132 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 330 transitions. [2018-12-31 09:30:57,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-31 09:30:57,133 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:30:57,133 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, 1, 1, 1, 1, 1] [2018-12-31 09:30:57,133 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:30:57,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:30:57,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1597021696, now seen corresponding path program 1 times [2018-12-31 09:30:57,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:30:57,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:30:57,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:57,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:30:57,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:57,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:30:57,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:30:57,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:30:57,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:30:57,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:30:57,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:30:57,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:30:57,207 INFO L87 Difference]: Start difference. First operand 222 states and 330 transitions. Second operand 3 states. [2018-12-31 09:30:57,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:30:57,314 INFO L93 Difference]: Finished difference Result 626 states and 942 transitions. [2018-12-31 09:30:57,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:30:57,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-31 09:30:57,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:30:57,319 INFO L225 Difference]: With dead ends: 626 [2018-12-31 09:30:57,319 INFO L226 Difference]: Without dead ends: 423 [2018-12-31 09:30:57,320 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 [2018-12-31 09:30:57,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-12-31 09:30:57,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 278. [2018-12-31 09:30:57,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-12-31 09:30:57,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 434 transitions. [2018-12-31 09:30:57,358 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 434 transitions. Word has length 52 [2018-12-31 09:30:57,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:30:57,360 INFO L480 AbstractCegarLoop]: Abstraction has 278 states and 434 transitions. [2018-12-31 09:30:57,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:30:57,361 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 434 transitions. [2018-12-31 09:30:57,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-31 09:30:57,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:30:57,362 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, 1, 1, 1, 1, 1, 1] [2018-12-31 09:30:57,362 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:30:57,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:30:57,363 INFO L82 PathProgramCache]: Analyzing trace with hash -186933284, now seen corresponding path program 1 times [2018-12-31 09:30:57,363 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:30:57,363 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:30:57,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:57,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:30:57,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:57,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:30:57,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:30:57,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:30:57,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:30:57,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:30:57,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:30:57,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:30:57,463 INFO L87 Difference]: Start difference. First operand 278 states and 434 transitions. Second operand 3 states. [2018-12-31 09:30:57,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:30:57,591 INFO L93 Difference]: Finished difference Result 792 states and 1250 transitions. [2018-12-31 09:30:57,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:30:57,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-12-31 09:30:57,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:30:57,597 INFO L225 Difference]: With dead ends: 792 [2018-12-31 09:30:57,598 INFO L226 Difference]: Without dead ends: 533 [2018-12-31 09:30:57,599 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 [2018-12-31 09:30:57,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2018-12-31 09:30:57,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 388. [2018-12-31 09:30:57,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2018-12-31 09:30:57,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 636 transitions. [2018-12-31 09:30:57,649 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 636 transitions. Word has length 53 [2018-12-31 09:30:57,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:30:57,651 INFO L480 AbstractCegarLoop]: Abstraction has 388 states and 636 transitions. [2018-12-31 09:30:57,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:30:57,652 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 636 transitions. [2018-12-31 09:30:57,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-31 09:30:57,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:30:57,653 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:30:57,653 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:30:57,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:30:57,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1955314594, now seen corresponding path program 1 times [2018-12-31 09:30:57,655 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:30:57,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:30:57,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:57,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:30:57,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:57,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:30:57,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:30:57,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:30:57,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:30:57,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:30:57,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:30:57,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:30:57,752 INFO L87 Difference]: Start difference. First operand 388 states and 636 transitions. Second operand 3 states. [2018-12-31 09:30:57,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:30:57,938 INFO L93 Difference]: Finished difference Result 1118 states and 1848 transitions. [2018-12-31 09:30:57,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:30:57,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-31 09:30:57,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:30:57,945 INFO L225 Difference]: With dead ends: 1118 [2018-12-31 09:30:57,945 INFO L226 Difference]: Without dead ends: 749 [2018-12-31 09:30:57,946 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 [2018-12-31 09:30:57,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 749 states. [2018-12-31 09:30:58,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 749 to 604. [2018-12-31 09:30:58,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-12-31 09:30:58,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 1028 transitions. [2018-12-31 09:30:58,009 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 1028 transitions. Word has length 54 [2018-12-31 09:30:58,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:30:58,010 INFO L480 AbstractCegarLoop]: Abstraction has 604 states and 1028 transitions. [2018-12-31 09:30:58,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:30:58,010 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 1028 transitions. [2018-12-31 09:30:58,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-31 09:30:58,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:30:58,012 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:30:58,013 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:30:58,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:30:58,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1992051330, now seen corresponding path program 1 times [2018-12-31 09:30:58,013 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:30:58,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:30:58,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:58,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:30:58,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:30:58,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:30:58,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:30:58,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:30:58,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:30:58,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:30:58,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:30:58,121 INFO L87 Difference]: Start difference. First operand 604 states and 1028 transitions. Second operand 3 states. [2018-12-31 09:30:58,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:30:58,274 INFO L93 Difference]: Finished difference Result 1758 states and 3008 transitions. [2018-12-31 09:30:58,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:30:58,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-12-31 09:30:58,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:30:58,282 INFO L225 Difference]: With dead ends: 1758 [2018-12-31 09:30:58,283 INFO L226 Difference]: Without dead ends: 1173 [2018-12-31 09:30:58,285 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 [2018-12-31 09:30:58,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2018-12-31 09:30:58,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 1028. [2018-12-31 09:30:58,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2018-12-31 09:30:58,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1788 transitions. [2018-12-31 09:30:58,371 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1788 transitions. Word has length 55 [2018-12-31 09:30:58,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:30:58,371 INFO L480 AbstractCegarLoop]: Abstraction has 1028 states and 1788 transitions. [2018-12-31 09:30:58,371 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:30:58,373 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1788 transitions. [2018-12-31 09:30:58,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-31 09:30:58,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:30:58,376 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:30:58,376 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:30:58,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:30:58,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1363693892, now seen corresponding path program 1 times [2018-12-31 09:30:58,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:30:58,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:30:58,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:58,380 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:30:58,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:58,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:30:58,476 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 09:30:58,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:30:58,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 09:30:58,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 09:30:58,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 09:30:58,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 09:30:58,478 INFO L87 Difference]: Start difference. First operand 1028 states and 1788 transitions. Second operand 3 states. [2018-12-31 09:30:58,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:30:58,688 INFO L93 Difference]: Finished difference Result 3014 states and 5256 transitions. [2018-12-31 09:30:58,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 09:30:58,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-12-31 09:30:58,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:30:58,700 INFO L225 Difference]: With dead ends: 3014 [2018-12-31 09:30:58,701 INFO L226 Difference]: Without dead ends: 2005 [2018-12-31 09:30:58,705 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 [2018-12-31 09:30:58,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2005 states. [2018-12-31 09:30:58,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2005 to 1860. [2018-12-31 09:30:58,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1860 states. [2018-12-31 09:30:58,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1860 states to 1860 states and 3260 transitions. [2018-12-31 09:30:58,841 INFO L78 Accepts]: Start accepts. Automaton has 1860 states and 3260 transitions. Word has length 56 [2018-12-31 09:30:58,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:30:58,841 INFO L480 AbstractCegarLoop]: Abstraction has 1860 states and 3260 transitions. [2018-12-31 09:30:58,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 09:30:58,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1860 states and 3260 transitions. [2018-12-31 09:30:58,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-31 09:30:58,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 09:30:58,846 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 09:30:58,846 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 09:30:58,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 09:30:58,846 INFO L82 PathProgramCache]: Analyzing trace with hash 161239840, now seen corresponding path program 1 times [2018-12-31 09:30:58,846 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 09:30:58,846 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 09:30:58,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:58,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 09:30:58,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 09:30:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 09:30:59,005 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-31 09:30:59,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 09:30:59,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 09:30:59,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 09:30:59,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 09:30:59,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 09:30:59,006 INFO L87 Difference]: Start difference. First operand 1860 states and 3260 transitions. Second operand 4 states. [2018-12-31 09:30:59,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 09:30:59,314 INFO L93 Difference]: Finished difference Result 1891 states and 3302 transitions. [2018-12-31 09:30:59,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 09:30:59,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-12-31 09:30:59,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 09:30:59,315 INFO L225 Difference]: With dead ends: 1891 [2018-12-31 09:30:59,315 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 09:30:59,318 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 [2018-12-31 09:30:59,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 09:30:59,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 09:30:59,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 09:30:59,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 09:30:59,318 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 57 [2018-12-31 09:30:59,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 09:30:59,321 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 09:30:59,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 09:30:59,321 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 09:30:59,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 09:30:59,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 09:30:59,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:30:59,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:30:59,440 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:30:59,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:30:59,569 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:30:59,570 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:30:59,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:30:59,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:30:59,644 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:30:59,649 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:30:59,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:30:59,654 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:30:59,820 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:30:59,947 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 106 [2018-12-31 09:30:59,959 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,079 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,120 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,122 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,123 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,127 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,129 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,217 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 65 [2018-12-31 09:31:00,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,379 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2018-12-31 09:31:00,385 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,416 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,422 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,436 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,439 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,441 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,453 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,455 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,517 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,522 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,707 WARN L181 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 125 [2018-12-31 09:31:00,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,722 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,742 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:00,761 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:01,293 WARN L181 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 195 DAG size of output: 167 [2018-12-31 09:31:01,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:01,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:01,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:01,366 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:01,369 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:01,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:01,491 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:01,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:01,701 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2018-12-31 09:31:01,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:01,835 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2018-12-31 09:31:01,886 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:01,954 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 106 [2018-12-31 09:31:01,961 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:01,962 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:01,968 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:02,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:02,032 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:02,080 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:02,147 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 114 [2018-12-31 09:31:02,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:02,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:02,183 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:02,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:02,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:02,228 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:02,230 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 09:31:02,453 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 11 [2018-12-31 09:31:02,843 WARN L181 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 36 [2018-12-31 09:31:03,158 WARN L181 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 20 [2018-12-31 09:31:03,732 WARN L181 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 36 [2018-12-31 09:31:03,866 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 22 [2018-12-31 09:31:04,119 WARN L181 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 36 [2018-12-31 09:31:04,612 WARN L181 SmtUtils]: Spent 478.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 31 [2018-12-31 09:31:05,009 WARN L181 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 30 [2018-12-31 09:31:05,176 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 26 [2018-12-31 09:31:05,620 WARN L181 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 24 [2018-12-31 09:31:06,239 WARN L181 SmtUtils]: Spent 616.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 34 [2018-12-31 09:31:06,822 WARN L181 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 14 [2018-12-31 09:31:07,014 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 28 [2018-12-31 09:31:07,285 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 34 [2018-12-31 09:31:08,221 WARN L181 SmtUtils]: Spent 933.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 16 [2018-12-31 09:31:08,489 WARN L181 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 34 [2018-12-31 09:31:08,682 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 34 [2018-12-31 09:31:08,855 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 19 [2018-12-31 09:31:09,195 WARN L181 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 34 [2018-12-31 09:31:09,765 WARN L181 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 34 [2018-12-31 09:31:10,256 WARN L181 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 34 [2018-12-31 09:31:10,600 WARN L181 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 31 [2018-12-31 09:31:10,873 WARN L181 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 16 [2018-12-31 09:31:11,003 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 22 [2018-12-31 09:31:11,492 WARN L181 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 34 [2018-12-31 09:31:11,791 WARN L181 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 30 [2018-12-31 09:31:11,795 INFO L448 ceAbstractionStarter]: For program point L366(lines 366 370) no Hoare annotation was computed. [2018-12-31 09:31:11,795 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 337) no Hoare annotation was computed. [2018-12-31 09:31:11,795 INFO L444 ceAbstractionStarter]: At program point L366-1(lines 241 384) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:31:11,795 INFO L448 ceAbstractionStarter]: For program point L533(lines 533 537) no Hoare annotation was computed. [2018-12-31 09:31:11,795 INFO L444 ceAbstractionStarter]: At program point L533-2(lines 526 541) 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)) [2018-12-31 09:31:11,796 INFO L448 ceAbstractionStarter]: For program point L533-3(lines 533 537) no Hoare annotation was computed. [2018-12-31 09:31:11,796 INFO L444 ceAbstractionStarter]: At program point L533-5(lines 526 541) the Hoare annotation is: (let ((.cse1 (= 1 ULTIMATE.start_getEmailTo_~handle)) (.cse2 (= ULTIMATE.start_setClientId_~handle 3)) (.cse3 (= 2 ~rjh~0)) (.cse5 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_setEmailTo_~handle 1) .cse4 .cse5 .cse6) (and .cse1 .cse2 (= ULTIMATE.start_getClientForwardReceiver_~handle 2) .cse3 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse5 .cse0 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse4 .cse6))) [2018-12-31 09:31:11,796 INFO L448 ceAbstractionStarter]: For program point L533-6(lines 533 537) no Hoare annotation was computed. [2018-12-31 09:31:11,796 INFO L444 ceAbstractionStarter]: At program point L533-8(lines 526 541) 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)) [2018-12-31 09:31:11,796 INFO L444 ceAbstractionStarter]: At program point L303(lines 293 379) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:31:11,796 INFO L444 ceAbstractionStarter]: At program point L270(lines 260 382) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:31:11,796 INFO L448 ceAbstractionStarter]: For program point L171(lines 171 178) no Hoare annotation was computed. [2018-12-31 09:31:11,796 INFO L448 ceAbstractionStarter]: For program point L2186(lines 2186 2197) no Hoare annotation was computed. [2018-12-31 09:31:11,797 INFO L451 ceAbstractionStarter]: At program point L171-1(lines 171 178) the Hoare annotation is: true [2018-12-31 09:31:11,797 INFO L448 ceAbstractionStarter]: For program point L2186-1(lines 2186 2197) no Hoare annotation was computed. [2018-12-31 09:31:11,797 INFO L448 ceAbstractionStarter]: For program point L2253(lines 2253 2265) no Hoare annotation was computed. [2018-12-31 09:31:11,797 INFO L448 ceAbstractionStarter]: For program point L2253-2(lines 2253 2265) no Hoare annotation was computed. [2018-12-31 09:31:11,797 INFO L448 ceAbstractionStarter]: For program point L2253-4(lines 2253 2265) no Hoare annotation was computed. [2018-12-31 09:31:11,797 INFO L448 ceAbstractionStarter]: For program point L437(lines 437 448) no Hoare annotation was computed. [2018-12-31 09:31:11,797 INFO L448 ceAbstractionStarter]: For program point L437-1(lines 437 448) no Hoare annotation was computed. [2018-12-31 09:31:11,797 INFO L444 ceAbstractionStarter]: At program point L339(lines 329 376) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:31:11,797 INFO L448 ceAbstractionStarter]: For program point L2256(lines 2256 2264) no Hoare annotation was computed. [2018-12-31 09:31:11,797 INFO L448 ceAbstractionStarter]: For program point L2256-2(lines 2256 2264) no Hoare annotation was computed. [2018-12-31 09:31:11,797 INFO L448 ceAbstractionStarter]: For program point L2190(lines 2190 2196) no Hoare annotation was computed. [2018-12-31 09:31:11,797 INFO L448 ceAbstractionStarter]: For program point L2256-4(lines 2256 2264) no Hoare annotation was computed. [2018-12-31 09:31:11,798 INFO L448 ceAbstractionStarter]: For program point L2190-1(lines 2190 2196) no Hoare annotation was computed. [2018-12-31 09:31:11,798 INFO L448 ceAbstractionStarter]: For program point L308(lines 308 315) no Hoare annotation was computed. [2018-12-31 09:31:11,798 INFO L444 ceAbstractionStarter]: At program point L2389(lines 2384 2392) the Hoare annotation is: (let ((.cse2 (= 2 ~rjh~0)) (.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse4 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (= 1 |ULTIMATE.start_isReadable_#res|) (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1) (and (= ULTIMATE.start_setEmailTo_~handle 1) (and .cse0 .cse1 .cse2 .cse3 .cse4) .cse5)) (and (and (= ULTIMATE.start_getClientForwardReceiver_~handle 2) .cse2 (= 2 ULTIMATE.start_incoming_~client) (and .cse0 .cse1 .cse4) (= 2 ~__ste_email_to0~0) .cse3) .cse5))) [2018-12-31 09:31:11,798 INFO L448 ceAbstractionStarter]: For program point L275(lines 275 279) no Hoare annotation was computed. [2018-12-31 09:31:11,798 INFO L448 ceAbstractionStarter]: For program point L242(lines 241 384) no Hoare annotation was computed. [2018-12-31 09:31:11,798 INFO L448 ceAbstractionStarter]: For program point L474(lines 474 485) no Hoare annotation was computed. [2018-12-31 09:31:11,798 INFO L448 ceAbstractionStarter]: For program point L441(lines 441 447) no Hoare annotation was computed. [2018-12-31 09:31:11,798 INFO L448 ceAbstractionStarter]: For program point L474-1(lines 474 485) no Hoare annotation was computed. [2018-12-31 09:31:11,798 INFO L448 ceAbstractionStarter]: For program point L441-1(lines 441 447) no Hoare annotation was computed. [2018-12-31 09:31:11,798 INFO L448 ceAbstractionStarter]: For program point L243(lines 243 247) no Hoare annotation was computed. [2018-12-31 09:31:11,799 INFO L448 ceAbstractionStarter]: For program point L2259(lines 2259 2263) no Hoare annotation was computed. [2018-12-31 09:31:11,799 INFO L448 ceAbstractionStarter]: For program point L2259-3(lines 2259 2263) no Hoare annotation was computed. [2018-12-31 09:31:11,799 INFO L444 ceAbstractionStarter]: At program point L2259-2(lines 1 2539) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= 0 ~__ste_client_forwardReceiver1~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:31:11,799 INFO L444 ceAbstractionStarter]: At program point L2259-5(lines 1 2539) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 2) (= 0 ~__ste_client_forwardReceiver1~0) (= ULTIMATE.start_setClientId_~handle ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:31:11,799 INFO L448 ceAbstractionStarter]: For program point L2259-6(lines 2259 2263) no Hoare annotation was computed. [2018-12-31 09:31:11,799 INFO L444 ceAbstractionStarter]: At program point L2259-8(lines 1 2539) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 0 ~__ste_client_forwardReceiver1~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:31:11,799 INFO L448 ceAbstractionStarter]: For program point L344(lines 344 348) no Hoare annotation was computed. [2018-12-31 09:31:11,799 INFO L451 ceAbstractionStarter]: At program point L179(lines 161 181) the Hoare annotation is: true [2018-12-31 09:31:11,799 INFO L444 ceAbstractionStarter]: At program point L2195-1(lines 2178 2201) 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 (= 2 ~rjh~0) (= 2 ULTIMATE.start_createEmail_~to) (and .cse0 .cse1 .cse2)) (and .cse0 (not (= ULTIMATE.start_createEmail_~to 1)) (not (= ~rjh~0 1)) (= 0 |ULTIMATE.start_getClientForwardReceiver_#res|) .cse1 .cse2))) [2018-12-31 09:31:11,800 INFO L444 ceAbstractionStarter]: At program point L2195(lines 2178 2201) the Hoare annotation is: (and (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_getClientForwardReceiver_~handle 2) (= 2 ~rjh~0) (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_outgoing_~msg) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ULTIMATE.start_createEmail_~to) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2018-12-31 09:31:11,800 INFO L448 ceAbstractionStarter]: For program point L511(lines 511 522) no Hoare annotation was computed. [2018-12-31 09:31:11,800 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 484) no Hoare annotation was computed. [2018-12-31 09:31:11,800 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 511 522) no Hoare annotation was computed. [2018-12-31 09:31:11,800 INFO L448 ceAbstractionStarter]: For program point L511-2(lines 511 522) no Hoare annotation was computed. [2018-12-31 09:31:11,800 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 478 484) no Hoare annotation was computed. [2018-12-31 09:31:11,800 INFO L448 ceAbstractionStarter]: For program point L511-3(lines 511 522) no Hoare annotation was computed. [2018-12-31 09:31:11,800 INFO L448 ceAbstractionStarter]: For program point L2229-1(lines 2229 2245) no Hoare annotation was computed. [2018-12-31 09:31:11,800 INFO L448 ceAbstractionStarter]: For program point L2229(lines 2229 2245) no Hoare annotation was computed. [2018-12-31 09:31:11,800 INFO L448 ceAbstractionStarter]: For program point L115(lines 115 123) no Hoare annotation was computed. [2018-12-31 09:31:11,801 INFO L444 ceAbstractionStarter]: At program point L446(lines 433 451) the Hoare annotation is: (let ((.cse0 (= 1 |ULTIMATE.start_isReadable_#res|)) (.cse1 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1)) (.cse6 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse2 (= 1 ULTIMATE.start_getEmailTo_~handle)) (.cse3 (= ULTIMATE.start_setClientId_~handle 3)) (.cse4 (= 2 ~rjh~0)) (.cse7 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse8 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 .cse1 (and .cse2 .cse3 (= ULTIMATE.start_getClientForwardReceiver_~handle 2) .cse4 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse5 .cse6 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse7 .cse8)) (and .cse0 .cse1 (and .cse6 .cse2 .cse3 .cse4 (= ULTIMATE.start_setEmailTo_~handle 1) .cse7 .cse5 .cse8)))) [2018-12-31 09:31:11,801 INFO L451 ceAbstractionStarter]: At program point L446-1(lines 433 451) the Hoare annotation is: true [2018-12-31 09:31:11,801 INFO L444 ceAbstractionStarter]: At program point L281(lines 271 381) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:31:11,801 INFO L444 ceAbstractionStarter]: At program point L2528(lines 1 2539) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= 0 ~__ste_client_forwardReceiver1~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:31:11,801 INFO L448 ceAbstractionStarter]: For program point L249(lines 249 383) no Hoare annotation was computed. [2018-12-31 09:31:11,801 INFO L448 ceAbstractionStarter]: For program point L515(lines 515 521) no Hoare annotation was computed. [2018-12-31 09:31:11,801 INFO L448 ceAbstractionStarter]: For program point L515-1(lines 515 521) no Hoare annotation was computed. [2018-12-31 09:31:11,802 INFO L448 ceAbstractionStarter]: For program point L515-2(lines 515 521) no Hoare annotation was computed. [2018-12-31 09:31:11,802 INFO L448 ceAbstractionStarter]: For program point L515-3(lines 515 521) no Hoare annotation was computed. [2018-12-31 09:31:11,802 INFO L444 ceAbstractionStarter]: At program point L2398(lines 2393 2401) the Hoare annotation is: (let ((.cse2 (= 2 ~rjh~0)) (.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse4 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (= 1 |ULTIMATE.start_isReadable_#res|) (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1) (and (= ULTIMATE.start_setEmailTo_~handle 1) (and .cse0 .cse1 .cse2 .cse3 .cse4) .cse5)) (and (and (= ULTIMATE.start_getClientForwardReceiver_~handle 2) .cse2 (= 2 ULTIMATE.start_incoming_~client) (and .cse0 .cse1 .cse4) (= 2 ~__ste_email_to0~0) .cse3) .cse5))) [2018-12-31 09:31:11,802 INFO L444 ceAbstractionStarter]: At program point L350(lines 340 375) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:31:11,802 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 09:31:11,802 INFO L444 ceAbstractionStarter]: At program point L317(lines 304 378) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:31:11,802 INFO L448 ceAbstractionStarter]: For program point L2233-1(lines 2233 2244) no Hoare annotation was computed. [2018-12-31 09:31:11,802 INFO L448 ceAbstractionStarter]: For program point L2233(lines 2233 2244) no Hoare annotation was computed. [2018-12-31 09:31:11,802 INFO L444 ceAbstractionStarter]: At program point L483(lines 470 488) the Hoare annotation is: (let ((.cse0 (= 1 |ULTIMATE.start_isReadable_#res|)) (.cse1 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1)) (.cse6 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse2 (= 1 ULTIMATE.start_getEmailTo_~handle)) (.cse3 (= ULTIMATE.start_setClientId_~handle 3)) (.cse4 (= 2 ~rjh~0)) (.cse7 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse8 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 .cse1 (and .cse2 .cse3 (= ULTIMATE.start_getClientForwardReceiver_~handle 2) .cse4 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse5 .cse6 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse7 .cse8)) (and .cse0 .cse1 (and .cse6 .cse2 .cse3 .cse4 (= ULTIMATE.start_setEmailTo_~handle 1) .cse7 .cse5 .cse8)))) [2018-12-31 09:31:11,803 INFO L451 ceAbstractionStarter]: At program point L483-1(lines 470 488) the Hoare annotation is: true [2018-12-31 09:31:11,803 INFO L444 ceAbstractionStarter]: At program point L385(lines 240 386) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:31:11,803 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 290) no Hoare annotation was computed. [2018-12-31 09:31:11,803 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 257) no Hoare annotation was computed. [2018-12-31 09:31:11,803 INFO L444 ceAbstractionStarter]: At program point L2335-1(lines 1 2539) the Hoare annotation is: (let ((.cse2 (= 2 ~rjh~0)) (.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse4 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (= 1 |ULTIMATE.start_isReadable_#res|) (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1) (and (= ULTIMATE.start_setEmailTo_~handle 1) (and .cse0 .cse1 .cse2 .cse3 .cse4) .cse5)) (and (and (= ULTIMATE.start_getClientForwardReceiver_~handle 2) .cse2 (= 2 ULTIMATE.start_incoming_~client) (and .cse0 .cse1 .cse4) (= 2 ~__ste_email_to0~0) .cse3) .cse5))) [2018-12-31 09:31:11,803 INFO L448 ceAbstractionStarter]: For program point L2335(lines 2335 2342) no Hoare annotation was computed. [2018-12-31 09:31:11,803 INFO L448 ceAbstractionStarter]: For program point L2335-2(lines 2335 2342) no Hoare annotation was computed. [2018-12-31 09:31:11,803 INFO L444 ceAbstractionStarter]: At program point L2501(lines 2490 2504) 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)) [2018-12-31 09:31:11,803 INFO L448 ceAbstractionStarter]: For program point L2237-1(lines 2237 2243) no Hoare annotation was computed. [2018-12-31 09:31:11,804 INFO L448 ceAbstractionStarter]: For program point L2237(lines 2237 2243) no Hoare annotation was computed. [2018-12-31 09:31:11,804 INFO L444 ceAbstractionStarter]: At program point L520(lines 507 525) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing_~msg) (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= 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)) [2018-12-31 09:31:11,804 INFO L444 ceAbstractionStarter]: At program point L520-1(lines 507 525) the Hoare annotation is: (let ((.cse6 (= 1 |ULTIMATE.start_isReadable_#res|)) (.cse7 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1)) (.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= 2 ~rjh~0)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse5 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (and (and .cse0 .cse1 (= ULTIMATE.start_getClientForwardReceiver_~handle 2) .cse2 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse3 .cse4) .cse5) .cse6 .cse7) (and .cse6 .cse7 (and (= ULTIMATE.start_setEmailTo_~handle 1) (and .cse0 .cse1 .cse2 .cse3 .cse4) .cse5)))) [2018-12-31 09:31:11,804 INFO L444 ceAbstractionStarter]: At program point L520-2(lines 507 525) 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)) [2018-12-31 09:31:11,804 INFO L451 ceAbstractionStarter]: At program point L520-3(lines 507 525) the Hoare annotation is: true [2018-12-31 09:31:11,804 INFO L451 ceAbstractionStarter]: At program point L2469-1(lines 2444 2471) the Hoare annotation is: true [2018-12-31 09:31:11,804 INFO L444 ceAbstractionStarter]: At program point L2469(lines 2444 2471) the Hoare annotation is: (let ((.cse6 (= 1 |ULTIMATE.start_isReadable_#res|)) (.cse7 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1)) (.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= 2 ~rjh~0)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse5 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (and (and .cse0 .cse1 (= ULTIMATE.start_getClientForwardReceiver_~handle 2) .cse2 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse3 .cse4) .cse5) .cse6 .cse7) (and .cse6 .cse7 (and (= ULTIMATE.start_setEmailTo_~handle 1) (and .cse0 .cse1 .cse2 .cse3 .cse4) .cse5)))) [2018-12-31 09:31:11,805 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 359) no Hoare annotation was computed. [2018-12-31 09:31:11,805 INFO L448 ceAbstractionStarter]: For program point L322(lines 322 326) no Hoare annotation was computed. [2018-12-31 09:31:11,805 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 09:31:11,805 INFO L448 ceAbstractionStarter]: For program point L1181(lines 1181 1187) no Hoare annotation was computed. [2018-12-31 09:31:11,805 INFO L448 ceAbstractionStarter]: For program point L1181-2(lines 1181 1187) no Hoare annotation was computed. [2018-12-31 09:31:11,805 INFO L444 ceAbstractionStarter]: At program point L2536(lines 2531 2539) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= 0 ~__ste_client_forwardReceiver1~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:31:11,805 INFO L448 ceAbstractionStarter]: For program point L2206(lines 2206 2218) no Hoare annotation was computed. [2018-12-31 09:31:11,805 INFO L444 ceAbstractionStarter]: At program point L158(lines 138 160) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 0 ~__ste_client_forwardReceiver1~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:31:11,805 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 197) no Hoare annotation was computed. [2018-12-31 09:31:11,806 INFO L444 ceAbstractionStarter]: At program point L292(lines 282 380) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:31:11,806 INFO L444 ceAbstractionStarter]: At program point L259(lines 249 383) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:31:11,806 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 09:31:11,806 INFO L444 ceAbstractionStarter]: At program point L2407(lines 2402 2410) the Hoare annotation is: (let ((.cse2 (= 2 ~rjh~0)) (.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse4 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (= 1 |ULTIMATE.start_isReadable_#res|) (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1) (and (= ULTIMATE.start_setEmailTo_~handle 1) (and .cse0 .cse1 .cse2 .cse3 .cse4) .cse5)) (and (and (= ULTIMATE.start_getClientForwardReceiver_~handle 2) .cse2 (= 2 ULTIMATE.start_incoming_~client) (and .cse0 .cse1 .cse4) (= 2 ~__ste_email_to0~0) .cse3) .cse5))) [2018-12-31 09:31:11,806 INFO L444 ceAbstractionStarter]: At program point L2242(lines 2225 2248) 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)) [2018-12-31 09:31:11,806 INFO L448 ceAbstractionStarter]: For program point L2209(lines 2209 2217) no Hoare annotation was computed. [2018-12-31 09:31:11,806 INFO L444 ceAbstractionStarter]: At program point L2242-1(lines 2225 2248) the Hoare annotation is: (let ((.cse1 (= 2 ~rjh~0)) (.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (and .cse0 (= ULTIMATE.start_setEmailTo_~handle 1) .cse1 .cse2 .cse3 .cse4) (= 1 |ULTIMATE.start_isReadable_#res|) (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1)) (and (and (= ULTIMATE.start_getClientForwardReceiver_~handle 2) .cse1 (and .cse0 .cse2) (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse3) .cse4))) [2018-12-31 09:31:11,806 INFO L448 ceAbstractionStarter]: For program point L493(lines 493 501) no Hoare annotation was computed. [2018-12-31 09:31:11,806 INFO L448 ceAbstractionStarter]: For program point L493-2(lines 493 501) no Hoare annotation was computed. [2018-12-31 09:31:11,807 INFO L444 ceAbstractionStarter]: At program point L361(lines 351 374) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:31:11,807 INFO L448 ceAbstractionStarter]: For program point L493-4(lines 493 501) no Hoare annotation was computed. [2018-12-31 09:31:11,807 INFO L444 ceAbstractionStarter]: At program point L328(lines 318 377) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:31:11,807 INFO L448 ceAbstractionStarter]: For program point L2212(lines 2212 2216) no Hoare annotation was computed. [2018-12-31 09:31:11,807 INFO L448 ceAbstractionStarter]: For program point L197(line 197) no Hoare annotation was computed. [2018-12-31 09:31:11,807 INFO L448 ceAbstractionStarter]: For program point L197-1(line 197) no Hoare annotation was computed. [2018-12-31 09:31:11,807 INFO L444 ceAbstractionStarter]: At program point L2212-2(lines 1 2539) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2018-12-31 09:31:11,807 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 09:31:11,807 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 197) no Hoare annotation was computed. [2018-12-31 09:31:11,808 INFO L444 ceAbstractionStarter]: At program point L2477-1(lines 2472 2480) the Hoare annotation is: (let ((.cse6 (= 1 |ULTIMATE.start_isReadable_#res|)) (.cse7 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1)) (.cse0 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= 2 ~rjh~0)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse5 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (and (and .cse0 .cse1 (= ULTIMATE.start_getClientForwardReceiver_~handle 2) .cse2 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse3 .cse4) .cse5) .cse6 .cse7) (and .cse6 .cse7 (and (= ULTIMATE.start_setEmailTo_~handle 1) (and .cse0 .cse1 .cse2 .cse3 .cse4) .cse5)))) [2018-12-31 09:31:11,808 INFO L444 ceAbstractionStarter]: At program point L2477(lines 2472 2480) the Hoare annotation is: (let ((.cse0 (= 1 |ULTIMATE.start_isReadable_#res|)) (.cse2 (= 1 ULTIMATE.start_getEmailTo_~handle)) (.cse3 (= ULTIMATE.start_setClientId_~handle 3)) (.cse4 (= 2 ~rjh~0)) (.cse6 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse1 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse7 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 (and .cse1 .cse2 .cse3 .cse4 (= ULTIMATE.start_setEmailTo_~handle 1) .cse5 .cse6 .cse7)) (and .cse0 (and .cse2 .cse3 (= ULTIMATE.start_getClientForwardReceiver_~handle 2) .cse4 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse6 .cse1 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse5 .cse7)))) [2018-12-31 09:31:11,808 INFO L451 ceAbstractionStarter]: At program point L2477-3(lines 2472 2480) the Hoare annotation is: true [2018-12-31 09:31:11,808 INFO L444 ceAbstractionStarter]: At program point L2477-2(lines 2472 2480) 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)) [2018-12-31 09:31:11,808 INFO L448 ceAbstractionStarter]: For program point L297(lines 297 301) no Hoare annotation was computed. [2018-12-31 09:31:11,808 INFO L444 ceAbstractionStarter]: At program point L2312(lines 1 2539) the Hoare annotation is: (and (= 1 ULTIMATE.start_outgoing_~msg) (= 1 ULTIMATE.start_getEmailTo_~handle) (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 2 |ULTIMATE.start_getEmailTo_#res|) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ULTIMATE.start_incoming_~client) (= 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)) [2018-12-31 09:31:11,808 INFO L448 ceAbstractionStarter]: For program point L264(lines 264 268) no Hoare annotation was computed. [2018-12-31 09:31:11,809 INFO L444 ceAbstractionStarter]: At program point L198(lines 1173 1190) the Hoare annotation is: (let ((.cse0 (= 1 |ULTIMATE.start_isReadable_#res|)) (.cse1 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1)) (.cse6 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse2 (= 1 ULTIMATE.start_getEmailTo_~handle)) (.cse3 (= ULTIMATE.start_setClientId_~handle 3)) (.cse4 (= 2 ~rjh~0)) (.cse7 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse8 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 .cse1 (and .cse2 .cse3 (= ULTIMATE.start_getClientForwardReceiver_~handle 2) .cse4 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse5 .cse6 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse7 .cse8)) (and .cse0 .cse1 (and .cse6 .cse2 .cse3 .cse4 (= ULTIMATE.start_setEmailTo_~handle 1) .cse7 .cse5 .cse8)))) [2018-12-31 09:31:11,809 INFO L444 ceAbstractionStarter]: At program point L2312-1(lines 1 2539) 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)) [2018-12-31 09:31:11,809 INFO L451 ceAbstractionStarter]: At program point L198-1(lines 1173 1190) the Hoare annotation is: true [2018-12-31 09:31:11,809 INFO L448 ceAbstractionStarter]: For program point L496(lines 496 500) no Hoare annotation was computed. [2018-12-31 09:31:11,809 INFO L444 ceAbstractionStarter]: At program point L496-2(lines 489 504) 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)) [2018-12-31 09:31:11,809 INFO L448 ceAbstractionStarter]: For program point L496-3(lines 496 500) no Hoare annotation was computed. [2018-12-31 09:31:11,809 INFO L444 ceAbstractionStarter]: At program point L496-5(lines 489 504) 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)) [2018-12-31 09:31:11,809 INFO L448 ceAbstractionStarter]: For program point L496-6(lines 496 500) no Hoare annotation was computed. [2018-12-31 09:31:11,809 INFO L444 ceAbstractionStarter]: At program point L496-8(lines 489 504) the Hoare annotation is: (let ((.cse1 (= 2 ~rjh~0)) (.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse3 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (and .cse0 (= ULTIMATE.start_setEmailTo_~handle 1) .cse1 .cse2 .cse3 .cse4) (= 1 |ULTIMATE.start_isReadable_#res|) (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~6 1)) (and (and (= ULTIMATE.start_getClientForwardReceiver_~handle 2) .cse1 (and .cse0 .cse2) (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse3) .cse4))) [2018-12-31 09:31:11,810 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 538) no Hoare annotation was computed. [2018-12-31 09:31:11,810 INFO L448 ceAbstractionStarter]: For program point L530-2(lines 530 538) no Hoare annotation was computed. [2018-12-31 09:31:11,810 INFO L448 ceAbstractionStarter]: For program point L530-4(lines 530 538) no Hoare annotation was computed. [2018-12-31 09:31:11,810 INFO L448 ceAbstractionStarter]: For program point L2182(lines 2182 2198) no Hoare annotation was computed. [2018-12-31 09:31:11,810 INFO L448 ceAbstractionStarter]: For program point L2182-1(lines 2182 2198) no Hoare annotation was computed. [2018-12-31 09:31:11,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 09:31:11 BoogieIcfgContainer [2018-12-31 09:31:11,867 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 09:31:11,868 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 09:31:11,868 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 09:31:11,868 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 09:31:11,869 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 09:30:49" (3/4) ... [2018-12-31 09:31:11,880 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 09:31:11,913 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 69 nodes and edges [2018-12-31 09:31:11,915 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 36 nodes and edges [2018-12-31 09:31:11,917 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-31 09:31:11,918 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-31 09:31:11,966 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 [2018-12-31 09:31:11,967 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 [2018-12-31 09:31:11,967 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 [2018-12-31 09:31:11,968 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((1 == msg && 1 == handle) && handle == 3) && 2 == rjh) && 2 == \result) && handle == 1) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && 2 == value) && 1 == msg [2018-12-31 09:31:11,968 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((1 == msg && 1 == handle) && handle == 3) && 2 == rjh) && 2 == \result) && handle == 1) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && 2 == value) && 1 == msg [2018-12-31 09:31:11,968 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((1 == handle && handle == 3) && handle == 2) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 2 == value) && 1 == msg) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg [2018-12-31 09:31:11,968 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == \result && tmp == 1) && (handle == 1 && (((1 == msg && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && 1 == msg) || ((((((handle == 2 && 2 == rjh) && 2 == client) && (1 == msg && handle == 3) && 1 == \result) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) [2018-12-31 09:31:11,971 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((1 == msg && 1 == handle) && handle == 3) && 2 == rjh) && handle == 1) && 2 == to) && 1 == \result) && 1 == msg) || ((((((((((1 == handle && handle == 3) && handle == 2) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 1 == msg) && 2 == \result) && 2 == to) && 1 == msg) [2018-12-31 09:31:11,971 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == \result && tmp == 1) && (handle == 1 && (((1 == msg && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && 1 == msg) || ((((((handle == 2 && 2 == rjh) && 2 == client) && (1 == msg && handle == 3) && 1 == \result) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) [2018-12-31 09:31:11,972 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == \result && tmp == 1) && (handle == 1 && (((1 == msg && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && 1 == msg) || ((((((handle == 2 && 2 == rjh) && 2 == client) && (1 == msg && handle == 3) && 1 == \result) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) [2018-12-31 09:31:11,972 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1 == \result && ((((((1 == msg && 1 == handle) && handle == 3) && 2 == rjh) && handle == 1) && 2 == to) && 1 == \result) && 1 == msg) || (1 == \result && (((((((((1 == handle && handle == 3) && handle == 2) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 1 == msg) && 2 == \result) && 2 == to) && 1 == msg) [2018-12-31 09:31:11,972 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == \result && tmp == 1) && (handle == 1 && (((1 == msg && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && 1 == msg) || ((((((handle == 2 && 2 == rjh) && 2 == client) && (1 == msg && handle == 3) && 1 == \result) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) [2018-12-31 09:31:11,972 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == \result && tmp == 1) && (((((((((1 == handle && handle == 3) && handle == 2) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 1 == msg) && 2 == \result) && 2 == to) && 1 == msg) || ((1 == \result && tmp == 1) && ((((((1 == msg && 1 == handle) && handle == 3) && 2 == rjh) && handle == 1) && 2 == to) && 1 == \result) && 1 == msg) [2018-12-31 09:31:11,973 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((handle == 3 && handle == 1) && 2 == rjh) && 1 == \result) && 2 == to) && 1 == msg) && 1 == \result) && tmp == 1) || ((((((handle == 2 && 2 == rjh) && handle == 3 && 1 == \result) && 2 == client) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) [2018-12-31 09:31:11,973 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == \result && tmp == 1) && (((((((((1 == handle && handle == 3) && handle == 2) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 1 == msg) && 2 == \result) && 2 == to) && 1 == msg) || ((1 == \result && tmp == 1) && ((((((1 == msg && 1 == handle) && handle == 3) && 2 == rjh) && handle == 1) && 2 == to) && 1 == \result) && 1 == msg) [2018-12-31 09:31:11,973 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((handle == 3 && handle == 1) && 2 == rjh) && 1 == \result) && 2 == to) && 1 == msg) && 1 == \result) && tmp == 1) || ((((((handle == 2 && 2 == rjh) && handle == 3 && 1 == \result) && 2 == client) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) [2018-12-31 09:31:11,978 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == \result && tmp == 1) && (((((((((1 == handle && handle == 3) && handle == 2) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 1 == msg) && 2 == \result) && 2 == to) && 1 == msg) || ((1 == \result && tmp == 1) && ((((((1 == msg && 1 == handle) && handle == 3) && 2 == rjh) && handle == 1) && 2 == to) && 1 == \result) && 1 == msg) [2018-12-31 09:31:11,978 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && 1 == msg [2018-12-31 09:31:11,978 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((1 == msg && handle == 3) && handle == 2) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to) && 1 == \result) && 1 == msg) && 1 == \result) && tmp == 1) || ((1 == \result && tmp == 1) && (handle == 1 && (((1 == msg && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && 1 == msg) [2018-12-31 09:31:11,979 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && 2 == rjh) && 2 == to) && 1 == \result) && 1 == msg [2018-12-31 09:31:11,979 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((2 == rjh && 2 == to) && (handle == 3 && 1 == \result) && 1 == msg) || (((((handle == 3 && !(to == 1)) && !(rjh == 1)) && 0 == \result) && 1 == \result) && 1 == msg) [2018-12-31 09:31:11,979 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((1 == msg && handle == 3) && handle == 2) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to) && 1 == \result) && 1 == msg) && 1 == \result) && tmp == 1) || ((1 == \result && tmp == 1) && (handle == 1 && (((1 == msg && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && 1 == msg) [2018-12-31 09:31:11,979 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((1 == msg && handle == 3) && handle == 2) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to) && 1 == \result) && 1 == msg) && 1 == \result) && tmp == 1) || ((1 == \result && tmp == 1) && (handle == 1 && (((1 == msg && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && 1 == msg) [2018-12-31 09:31:11,979 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && 1 == msg [2018-12-31 09:31:11,983 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((handle == 3 && 1 == \result) && 2 == rjh) && 1 == \result) && 2 == to) && 1 == msg [2018-12-31 09:31:12,138 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 09:31:12,138 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 09:31:12,139 INFO L168 Benchmark]: Toolchain (without parser) took 26452.01 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 508.6 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -178.8 MB). Peak memory consumption was 329.8 MB. Max. memory is 11.5 GB. [2018-12-31 09:31:12,141 INFO L168 Benchmark]: CDTParser took 0.17 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. [2018-12-31 09:31:12,141 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1136.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -142.6 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. [2018-12-31 09:31:12,141 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.74 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. [2018-12-31 09:31:12,142 INFO L168 Benchmark]: Boogie Preprocessor took 90.60 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. [2018-12-31 09:31:12,142 INFO L168 Benchmark]: RCFGBuilder took 2106.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 986.7 MB in the end (delta: 90.0 MB). Peak memory consumption was 90.0 MB. Max. memory is 11.5 GB. [2018-12-31 09:31:12,142 INFO L168 Benchmark]: TraceAbstraction took 22706.47 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 385.4 MB). Free memory was 986.7 MB in the beginning and 1.1 GB in the end (delta: -153.6 MB). Peak memory consumption was 472.1 MB. Max. memory is 11.5 GB. [2018-12-31 09:31:12,145 INFO L168 Benchmark]: Witness Printer took 270.67 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. [2018-12-31 09:31:12,149 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.17 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 1136.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -142.6 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 131.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 90.60 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 2106.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 986.7 MB in the end (delta: 90.0 MB). Peak memory consumption was 90.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22706.47 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 385.4 MB). Free memory was 986.7 MB in the beginning and 1.1 GB in the end (delta: -153.6 MB). Peak memory consumption was 472.1 MB. Max. memory is 11.5 GB. * Witness Printer took 270.67 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 197]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 197]: 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: 293]: 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: 161]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 171]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 433]: Loop Invariant Derived loop invariant: ((1 == \result && tmp == 1) && (((((((((1 == handle && handle == 3) && handle == 2) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 1 == msg) && 2 == \result) && 2 == to) && 1 == msg) || ((1 == \result && tmp == 1) && ((((((1 == msg && 1 == handle) && handle == 3) && 2 == rjh) && handle == 1) && 2 == to) && 1 == \result) && 1 == msg) - InvariantResult [Line: 433]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 249]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 260]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2490]: 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: 271]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 282]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1173]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 470]: Loop Invariant Derived loop invariant: ((1 == \result && tmp == 1) && (((((((((1 == handle && handle == 3) && handle == 2) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 1 == msg) && 2 == \result) && 2 == to) && 1 == msg) || ((1 == \result && tmp == 1) && ((((((1 == msg && 1 == handle) && handle == 3) && 2 == rjh) && handle == 1) && 2 == to) && 1 == \result) && 1 == msg) - InvariantResult [Line: 2444]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2225]: 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: 1173]: Loop Invariant Derived loop invariant: ((1 == \result && tmp == 1) && (((((((((1 == handle && handle == 3) && handle == 2) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 1 == msg) && 2 == \result) && 2 == to) && 1 == msg) || ((1 == \result && tmp == 1) && ((((((1 == msg && 1 == handle) && handle == 3) && 2 == rjh) && handle == 1) && 2 == to) && 1 == \result) && 1 == msg) - InvariantResult [Line: 241]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 470]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2225]: Loop Invariant Derived loop invariant: (((((((handle == 3 && handle == 1) && 2 == rjh) && 1 == \result) && 2 == to) && 1 == msg) && 1 == \result) && tmp == 1) || ((((((handle == 2 && 2 == rjh) && handle == 3 && 1 == \result) && 2 == client) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) - InvariantResult [Line: 138]: Loop Invariant Derived loop invariant: ((handle == 3 && 2 == rjh) && 0 == __ste_client_forwardReceiver1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2178]: Loop Invariant Derived loop invariant: (((((((((((1 == handle && handle == 3) && handle == 2) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 2 == value) && 1 == msg) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg - InvariantResult [Line: 507]: Loop Invariant Derived loop invariant: (((((((((1 == msg && 1 == handle) && handle == 3) && 2 == rjh) && 2 == \result) && handle == 1) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && 2 == value) && 1 == msg - InvariantResult [Line: 2178]: Loop Invariant Derived loop invariant: ((2 == rjh && 2 == to) && (handle == 3 && 1 == \result) && 1 == msg) || (((((handle == 3 && !(to == 1)) && !(rjh == 1)) && 0 == \result) && 1 == \result) && 1 == msg) - InvariantResult [Line: 2402]: Loop Invariant Derived loop invariant: ((1 == \result && tmp == 1) && (handle == 1 && (((1 == msg && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && 1 == msg) || ((((((handle == 2 && 2 == rjh) && 2 == client) && (1 == msg && handle == 3) && 1 == \result) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((handle == 3 && 2 == rjh) && 2 == to) && 1 == \result) && 1 == msg - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((((((1 == msg && 1 == handle) && handle == 3) && 2 == rjh) && 2 == \result) && handle == 1) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && 2 == value) && 1 == msg - InvariantResult [Line: 507]: Loop Invariant Derived loop invariant: ((((((((((1 == msg && handle == 3) && handle == 2) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to) && 1 == \result) && 1 == msg) && 1 == \result) && tmp == 1) || ((1 == \result && tmp == 1) && (handle == 1 && (((1 == msg && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && 1 == msg) - InvariantResult [Line: 507]: Loop Invariant Derived loop invariant: (((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && 1 == msg - InvariantResult [Line: 507]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2444]: Loop Invariant Derived loop invariant: ((((((((((1 == msg && handle == 3) && handle == 2) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to) && 1 == \result) && 1 == msg) && 1 == \result) && tmp == 1) || ((1 == \result && tmp == 1) && (handle == 1 && (((1 == msg && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && 1 == msg) - InvariantResult [Line: 2472]: Loop Invariant Derived loop invariant: (1 == \result && ((((((1 == msg && 1 == handle) && handle == 3) && 2 == rjh) && handle == 1) && 2 == to) && 1 == \result) && 1 == msg) || (1 == \result && (((((((((1 == handle && handle == 3) && handle == 2) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 1 == msg) && 2 == \result) && 2 == to) && 1 == msg) - InvariantResult [Line: 2472]: Loop Invariant Derived loop invariant: ((((handle == 3 && 1 == \result) && 2 == rjh) && 1 == \result) && 2 == to) && 1 == msg - InvariantResult [Line: 240]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2472]: Loop Invariant Derived loop invariant: ((((((((((1 == msg && handle == 3) && handle == 2) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to) && 1 == \result) && 1 == msg) && 1 == \result) && tmp == 1) || ((1 == \result && tmp == 1) && (handle == 1 && (((1 == msg && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && 1 == msg) - InvariantResult [Line: 2472]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(rjh == 1) && 0 == __ste_client_forwardReceiver1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2384]: Loop Invariant Derived loop invariant: ((1 == \result && tmp == 1) && (handle == 1 && (((1 == msg && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && 1 == msg) || ((((((handle == 2 && 2 == rjh) && 2 == client) && (1 == msg && handle == 3) && 1 == \result) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((1 == \result && tmp == 1) && (handle == 1 && (((1 == msg && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && 1 == msg) || ((((((handle == 2 && 2 == rjh) && 2 == client) && (1 == msg && handle == 3) && 1 == \result) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((((((handle == 3 && handle == 1) && 2 == rjh) && 1 == \result) && 2 == to) && 1 == msg) && 1 == \result) && tmp == 1) || ((((((handle == 2 && 2 == rjh) && handle == 3 && 1 == \result) && 2 == client) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) - InvariantResult [Line: 2531]: Loop Invariant Derived loop invariant: (!(rjh == 1) && 0 == __ste_client_forwardReceiver1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((handle == 2 && 0 == __ste_client_forwardReceiver1) && handle == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((handle == 3 && 2 == rjh) && 2 == to) && !(__ste_email_to0 == 1)) && 1 == msg - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: (((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && 1 == msg - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((handle == 3 && 2 == rjh) && 0 == __ste_client_forwardReceiver1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 489]: 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: 2393]: Loop Invariant Derived loop invariant: ((1 == \result && tmp == 1) && (handle == 1 && (((1 == msg && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && 1 == msg) || ((((((handle == 2 && 2 == rjh) && 2 == client) && (1 == msg && handle == 3) && 1 == \result) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 340]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: (((((handle == 3 && handle == 1) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && 2 == value) && 1 == msg - InvariantResult [Line: 329]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 318]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 304]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(rjh == 1) && 0 == __ste_client_forwardReceiver1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 526]: Loop Invariant Derived loop invariant: (((((((1 == msg && 1 == handle) && handle == 3) && 2 == rjh) && handle == 1) && 2 == to) && 1 == \result) && 1 == msg) || ((((((((((1 == handle && handle == 3) && handle == 2) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 1 == msg) && 2 == \result) && 2 == to) && 1 == msg) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 134 locations, 2 error locations. SAFE Result, 22.5s OverallTime, 15 OverallIterations, 2 TraceHistogramMax, 6.2s AutomataDifference, 0.0s DeadEndRemovalTime, 12.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 2997 SDtfs, 4251 SDslu, 5307 SDs, 0 SdLazy, 496 SolverSat, 83 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 299 ImplicationChecksByTransitivity, 3.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1860occurred in iteration=14, 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.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 1644 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 54 LocationsWithAnnotation, 54 PreInvPairs, 917 NumberOfFragments, 1476 HoareAnnotationTreeSize, 54 FomulaSimplifications, 8587723 FormulaSimplificationTreeSizeReduction, 2.9s HoareSimplificationTime, 54 FomulaSimplificationsInter, 988640 FormulaSimplificationTreeSizeReductionInter, 9.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 692 NumberOfCodeBlocks, 692 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 677 ConstructedInterpolants, 0 QuantifiedInterpolants, 46893 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 22/22 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...