./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/product-lines/email_spec0_product10_true-unreach-call_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/product-lines/email_spec0_product10_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 34ea1153081835871d2d8c4250456d7ca577de25 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 14:36:22,089 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 14:36:22,091 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 14:36:22,108 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 14:36:22,108 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 14:36:22,110 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 14:36:22,111 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 14:36:22,114 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 14:36:22,116 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 14:36:22,118 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 14:36:22,121 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 14:36:22,122 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 14:36:22,123 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 14:36:22,124 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 14:36:22,127 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 14:36:22,128 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 14:36:22,129 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 14:36:22,140 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 14:36:22,142 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 14:36:22,145 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 14:36:22,148 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 14:36:22,153 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 14:36:22,155 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 14:36:22,155 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 14:36:22,155 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 14:36:22,157 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 14:36:22,158 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 14:36:22,159 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 14:36:22,161 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 14:36:22,162 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 14:36:22,163 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 14:36:22,163 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 14:36:22,163 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 14:36:22,163 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 14:36:22,166 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 14:36:22,167 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 14:36:22,167 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 14:36:22,196 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 14:36:22,197 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 14:36:22,198 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 14:36:22,198 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 14:36:22,198 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 14:36:22,198 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 14:36:22,202 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 14:36:22,202 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 14:36:22,202 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 14:36:22,202 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 14:36:22,202 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 14:36:22,203 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 14:36:22,203 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 14:36:22,203 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 14:36:22,203 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 14:36:22,203 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 14:36:22,203 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 14:36:22,204 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 14:36:22,205 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 14:36:22,205 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 14:36:22,205 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 14:36:22,205 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:36:22,206 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 14:36:22,206 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 14:36:22,206 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 14:36:22,206 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 14:36:22,206 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 14:36:22,207 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 14:36:22,207 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 -> 34ea1153081835871d2d8c4250456d7ca577de25 [2019-01-12 14:36:22,272 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 14:36:22,289 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 14:36:22,296 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 14:36:22,297 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 14:36:22,298 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 14:36:22,298 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/product-lines/email_spec0_product10_true-unreach-call_true-termination.cil.c [2019-01-12 14:36:22,357 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3aa183e2/8de1d626badd4158979bbb51c31f3559/FLAG5215a7f29 [2019-01-12 14:36:22,885 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 14:36:22,885 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/product-lines/email_spec0_product10_true-unreach-call_true-termination.cil.c [2019-01-12 14:36:22,905 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3aa183e2/8de1d626badd4158979bbb51c31f3559/FLAG5215a7f29 [2019-01-12 14:36:23,120 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d3aa183e2/8de1d626badd4158979bbb51c31f3559 [2019-01-12 14:36:23,123 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 14:36:23,124 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 14:36:23,125 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 14:36:23,125 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 14:36:23,129 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 14:36:23,129 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:36:23" (1/1) ... [2019-01-12 14:36:23,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d680728 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:36:23, skipping insertion in model container [2019-01-12 14:36:23,132 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 02:36:23" (1/1) ... [2019-01-12 14:36:23,140 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 14:36:23,220 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 14:36:23,862 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:36:23,978 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 14:36:24,092 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 14:36:24,171 INFO L195 MainTranslator]: Completed translation [2019-01-12 14:36:24,171 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:36:24 WrapperNode [2019-01-12 14:36:24,172 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 14:36:24,172 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 14:36:24,172 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 14:36:24,173 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 14:36:24,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:36:24" (1/1) ... [2019-01-12 14:36:24,210 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:36:24" (1/1) ... [2019-01-12 14:36:24,285 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 14:36:24,286 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 14:36:24,286 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 14:36:24,286 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 14:36:24,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:36:24" (1/1) ... [2019-01-12 14:36:24,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:36:24" (1/1) ... [2019-01-12 14:36:24,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:36:24" (1/1) ... [2019-01-12 14:36:24,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:36:24" (1/1) ... [2019-01-12 14:36:24,324 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:36:24" (1/1) ... [2019-01-12 14:36:24,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:36:24" (1/1) ... [2019-01-12 14:36:24,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:36:24" (1/1) ... [2019-01-12 14:36:24,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 14:36:24,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 14:36:24,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 14:36:24,379 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 14:36:24,381 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:36:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 14:36:24,450 INFO L130 BoogieDeclarations]: Found specification of procedure puts [2019-01-12 14:36:24,451 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-12 14:36:24,451 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-01-12 14:36:24,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 14:36:24,454 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 14:36:26,411 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 14:36:26,413 INFO L286 CfgBuilder]: Removed 155 assue(true) statements. [2019-01-12 14:36:26,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:36:26 BoogieIcfgContainer [2019-01-12 14:36:26,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 14:36:26,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 14:36:26,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 14:36:26,421 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 14:36:26,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 02:36:23" (1/3) ... [2019-01-12 14:36:26,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae37ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:36:26, skipping insertion in model container [2019-01-12 14:36:26,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 02:36:24" (2/3) ... [2019-01-12 14:36:26,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ae37ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 02:36:26, skipping insertion in model container [2019-01-12 14:36:26,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:36:26" (3/3) ... [2019-01-12 14:36:26,428 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec0_product10_true-unreach-call_true-termination.cil.c [2019-01-12 14:36:26,440 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 14:36:26,454 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-01-12 14:36:26,475 INFO L257 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-01-12 14:36:26,522 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 14:36:26,522 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 14:36:26,523 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 14:36:26,524 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 14:36:26,524 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 14:36:26,524 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 14:36:26,524 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 14:36:26,525 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 14:36:26,525 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 14:36:26,546 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states. [2019-01-12 14:36:26,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-01-12 14:36:26,556 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:26,557 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] [2019-01-12 14:36:26,559 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:26,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:26,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1170669752, now seen corresponding path program 1 times [2019-01-12 14:36:26,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:26,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:26,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:26,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:26,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:26,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:36:26,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:26,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 14:36:26,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-12 14:36:26,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-12 14:36:26,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:36:26,941 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 2 states. [2019-01-12 14:36:26,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:26,980 INFO L93 Difference]: Finished difference Result 273 states and 434 transitions. [2019-01-12 14:36:26,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-12 14:36:26,982 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 38 [2019-01-12 14:36:26,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:27,001 INFO L225 Difference]: With dead ends: 273 [2019-01-12 14:36:27,001 INFO L226 Difference]: Without dead ends: 146 [2019-01-12 14:36:27,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-12 14:36:27,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-01-12 14:36:27,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2019-01-12 14:36:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-12 14:36:27,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 234 transitions. [2019-01-12 14:36:27,062 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 234 transitions. Word has length 38 [2019-01-12 14:36:27,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:27,063 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 234 transitions. [2019-01-12 14:36:27,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-12 14:36:27,063 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 234 transitions. [2019-01-12 14:36:27,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-12 14:36:27,065 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:27,065 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, 1] [2019-01-12 14:36:27,066 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:27,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:27,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1521803372, now seen corresponding path program 1 times [2019-01-12 14:36:27,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:27,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:27,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:27,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:27,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:27,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:36:27,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:27,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:36:27,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:36:27,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:36:27,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:36:27,289 INFO L87 Difference]: Start difference. First operand 146 states and 234 transitions. Second operand 3 states. [2019-01-12 14:36:27,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:27,497 INFO L93 Difference]: Finished difference Result 411 states and 660 transitions. [2019-01-12 14:36:27,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:36:27,498 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-01-12 14:36:27,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:27,501 INFO L225 Difference]: With dead ends: 411 [2019-01-12 14:36:27,502 INFO L226 Difference]: Without dead ends: 276 [2019-01-12 14:36:27,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:36:27,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2019-01-12 14:36:27,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 145. [2019-01-12 14:36:27,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-01-12 14:36:27,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 230 transitions. [2019-01-12 14:36:27,524 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 230 transitions. Word has length 39 [2019-01-12 14:36:27,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:27,525 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 230 transitions. [2019-01-12 14:36:27,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:36:27,526 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 230 transitions. [2019-01-12 14:36:27,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-01-12 14:36:27,527 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:27,528 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, 1, 1] [2019-01-12 14:36:27,529 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:27,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:27,529 INFO L82 PathProgramCache]: Analyzing trace with hash 964876999, now seen corresponding path program 1 times [2019-01-12 14:36:27,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:27,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:27,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:27,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:27,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:27,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:27,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:36:27,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:27,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:36:27,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:36:27,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:36:27,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:36:27,646 INFO L87 Difference]: Start difference. First operand 145 states and 230 transitions. Second operand 3 states. [2019-01-12 14:36:27,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:27,747 INFO L93 Difference]: Finished difference Result 276 states and 440 transitions. [2019-01-12 14:36:27,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:36:27,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-01-12 14:36:27,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:27,753 INFO L225 Difference]: With dead ends: 276 [2019-01-12 14:36:27,753 INFO L226 Difference]: Without dead ends: 146 [2019-01-12 14:36:27,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:36:27,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-01-12 14:36:27,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2019-01-12 14:36:27,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-01-12 14:36:27,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 227 transitions. [2019-01-12 14:36:27,782 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 227 transitions. Word has length 40 [2019-01-12 14:36:27,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:27,782 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 227 transitions. [2019-01-12 14:36:27,782 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:36:27,783 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 227 transitions. [2019-01-12 14:36:27,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-01-12 14:36:27,785 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:27,785 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, 1, 1, 1, 1] [2019-01-12 14:36:27,786 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:27,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:27,788 INFO L82 PathProgramCache]: Analyzing trace with hash -559359774, now seen corresponding path program 1 times [2019-01-12 14:36:27,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:27,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:27,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:27,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:27,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:27,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:27,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:36:27,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:27,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:36:27,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:36:27,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:36:27,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:36:27,904 INFO L87 Difference]: Start difference. First operand 145 states and 227 transitions. Second operand 3 states. [2019-01-12 14:36:27,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:27,947 INFO L93 Difference]: Finished difference Result 243 states and 376 transitions. [2019-01-12 14:36:27,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:36:27,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-01-12 14:36:27,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:27,952 INFO L225 Difference]: With dead ends: 243 [2019-01-12 14:36:27,952 INFO L226 Difference]: Without dead ends: 148 [2019-01-12 14:36:27,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:36:27,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-01-12 14:36:27,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2019-01-12 14:36:27,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2019-01-12 14:36:27,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 229 transitions. [2019-01-12 14:36:27,964 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 229 transitions. Word has length 42 [2019-01-12 14:36:27,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:27,964 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 229 transitions. [2019-01-12 14:36:27,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:36:27,965 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 229 transitions. [2019-01-12 14:36:27,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-12 14:36:27,966 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:27,967 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 14:36:27,967 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:27,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:27,969 INFO L82 PathProgramCache]: Analyzing trace with hash 499910929, now seen corresponding path program 1 times [2019-01-12 14:36:27,969 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:27,969 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:27,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:27,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:27,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:28,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:36:28,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:28,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 14:36:28,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 14:36:28,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 14:36:28,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:36:28,524 INFO L87 Difference]: Start difference. First operand 147 states and 229 transitions. Second operand 10 states. [2019-01-12 14:36:29,538 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-12 14:36:30,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:30,926 INFO L93 Difference]: Finished difference Result 770 states and 1137 transitions. [2019-01-12 14:36:30,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-12 14:36:30,926 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2019-01-12 14:36:30,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:30,931 INFO L225 Difference]: With dead ends: 770 [2019-01-12 14:36:30,931 INFO L226 Difference]: Without dead ends: 697 [2019-01-12 14:36:30,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2019-01-12 14:36:30,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2019-01-12 14:36:30,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 190. [2019-01-12 14:36:30,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-01-12 14:36:30,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 291 transitions. [2019-01-12 14:36:30,988 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 291 transitions. Word has length 47 [2019-01-12 14:36:30,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:30,988 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 291 transitions. [2019-01-12 14:36:30,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 14:36:30,989 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 291 transitions. [2019-01-12 14:36:30,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-12 14:36:30,997 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:30,997 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] [2019-01-12 14:36:30,997 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:30,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:30,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1433614264, now seen corresponding path program 1 times [2019-01-12 14:36:30,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:30,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:30,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:30,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:30,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:31,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:36:31,314 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:31,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-01-12 14:36:31,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 14:36:31,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 14:36:31,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:36:31,316 INFO L87 Difference]: Start difference. First operand 190 states and 291 transitions. Second operand 10 states. [2019-01-12 14:36:32,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:32,858 INFO L93 Difference]: Finished difference Result 805 states and 1181 transitions. [2019-01-12 14:36:32,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-12 14:36:32,859 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2019-01-12 14:36:32,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:32,865 INFO L225 Difference]: With dead ends: 805 [2019-01-12 14:36:32,865 INFO L226 Difference]: Without dead ends: 709 [2019-01-12 14:36:32,866 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=290, Invalid=766, Unknown=0, NotChecked=0, Total=1056 [2019-01-12 14:36:32,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 709 states. [2019-01-12 14:36:32,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 709 to 217. [2019-01-12 14:36:32,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-01-12 14:36:32,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 332 transitions. [2019-01-12 14:36:32,897 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 332 transitions. Word has length 48 [2019-01-12 14:36:32,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:32,897 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 332 transitions. [2019-01-12 14:36:32,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 14:36:32,897 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 332 transitions. [2019-01-12 14:36:32,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-12 14:36:32,898 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:32,899 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] [2019-01-12 14:36:32,899 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:32,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:32,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1851645243, now seen corresponding path program 1 times [2019-01-12 14:36:32,899 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:32,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:32,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:32,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:32,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:33,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:36:33,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:33,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:36:33,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:36:33,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:36:33,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:36:33,196 INFO L87 Difference]: Start difference. First operand 217 states and 332 transitions. Second operand 5 states. [2019-01-12 14:36:33,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:33,712 INFO L93 Difference]: Finished difference Result 626 states and 921 transitions. [2019-01-12 14:36:33,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:36:33,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-01-12 14:36:33,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:33,725 INFO L225 Difference]: With dead ends: 626 [2019-01-12 14:36:33,725 INFO L226 Difference]: Without dead ends: 477 [2019-01-12 14:36:33,726 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:36:33,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-01-12 14:36:33,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 223. [2019-01-12 14:36:33,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-01-12 14:36:33,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 338 transitions. [2019-01-12 14:36:33,758 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 338 transitions. Word has length 48 [2019-01-12 14:36:33,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:33,758 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 338 transitions. [2019-01-12 14:36:33,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:36:33,763 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 338 transitions. [2019-01-12 14:36:33,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 14:36:33,764 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:33,764 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] [2019-01-12 14:36:33,765 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:33,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:33,767 INFO L82 PathProgramCache]: Analyzing trace with hash -2075432413, now seen corresponding path program 1 times [2019-01-12 14:36:33,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:33,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:33,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:33,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:33,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:34,018 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:36:34,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:34,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:36:34,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:36:34,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:36:34,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:36:34,020 INFO L87 Difference]: Start difference. First operand 223 states and 338 transitions. Second operand 5 states. [2019-01-12 14:36:34,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:34,636 INFO L93 Difference]: Finished difference Result 731 states and 1093 transitions. [2019-01-12 14:36:34,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 14:36:34,637 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-01-12 14:36:34,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:34,642 INFO L225 Difference]: With dead ends: 731 [2019-01-12 14:36:34,642 INFO L226 Difference]: Without dead ends: 619 [2019-01-12 14:36:34,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:36:34,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2019-01-12 14:36:34,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 423. [2019-01-12 14:36:34,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-01-12 14:36:34,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 647 transitions. [2019-01-12 14:36:34,720 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 647 transitions. Word has length 49 [2019-01-12 14:36:34,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:34,721 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 647 transitions. [2019-01-12 14:36:34,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:36:34,722 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 647 transitions. [2019-01-12 14:36:34,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 14:36:34,723 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:34,723 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] [2019-01-12 14:36:34,723 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:34,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:34,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1642065176, now seen corresponding path program 1 times [2019-01-12 14:36:34,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:34,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:34,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:34,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:34,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:34,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:34,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:36:34,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:34,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 14:36:34,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:36:34,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:36:34,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:36:34,990 INFO L87 Difference]: Start difference. First operand 423 states and 647 transitions. Second operand 6 states. [2019-01-12 14:36:35,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:35,171 INFO L93 Difference]: Finished difference Result 837 states and 1260 transitions. [2019-01-12 14:36:35,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 14:36:35,172 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-01-12 14:36:35,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:35,175 INFO L225 Difference]: With dead ends: 837 [2019-01-12 14:36:35,175 INFO L226 Difference]: Without dead ends: 505 [2019-01-12 14:36:35,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-01-12 14:36:35,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2019-01-12 14:36:35,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 423. [2019-01-12 14:36:35,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2019-01-12 14:36:35,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 643 transitions. [2019-01-12 14:36:35,230 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 643 transitions. Word has length 49 [2019-01-12 14:36:35,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:35,230 INFO L480 AbstractCegarLoop]: Abstraction has 423 states and 643 transitions. [2019-01-12 14:36:35,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:36:35,230 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 643 transitions. [2019-01-12 14:36:35,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-01-12 14:36:35,232 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:35,233 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] [2019-01-12 14:36:35,233 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:35,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:35,233 INFO L82 PathProgramCache]: Analyzing trace with hash -352079530, now seen corresponding path program 1 times [2019-01-12 14:36:35,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:35,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:35,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:35,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:35,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:35,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:35,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:36:35,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:35,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:36:35,499 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:36:35,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:36:35,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:36:35,499 INFO L87 Difference]: Start difference. First operand 423 states and 643 transitions. Second operand 5 states. [2019-01-12 14:36:36,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:36,104 INFO L93 Difference]: Finished difference Result 843 states and 1250 transitions. [2019-01-12 14:36:36,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:36:36,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-01-12 14:36:36,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:36,108 INFO L225 Difference]: With dead ends: 843 [2019-01-12 14:36:36,108 INFO L226 Difference]: Without dead ends: 579 [2019-01-12 14:36:36,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:36:36,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2019-01-12 14:36:36,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 397. [2019-01-12 14:36:36,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 397 states. [2019-01-12 14:36:36,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 599 transitions. [2019-01-12 14:36:36,160 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 599 transitions. Word has length 49 [2019-01-12 14:36:36,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:36,161 INFO L480 AbstractCegarLoop]: Abstraction has 397 states and 599 transitions. [2019-01-12 14:36:36,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:36:36,161 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 599 transitions. [2019-01-12 14:36:36,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-12 14:36:36,162 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:36,162 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] [2019-01-12 14:36:36,162 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:36,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:36,163 INFO L82 PathProgramCache]: Analyzing trace with hash -372841469, now seen corresponding path program 1 times [2019-01-12 14:36:36,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:36,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:36,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:36,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:36,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:36,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:36,337 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:36:36,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:36,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-01-12 14:36:36,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 14:36:36,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 14:36:36,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-01-12 14:36:36,339 INFO L87 Difference]: Start difference. First operand 397 states and 599 transitions. Second operand 9 states. [2019-01-12 14:36:37,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:37,502 INFO L93 Difference]: Finished difference Result 1990 states and 2869 transitions. [2019-01-12 14:36:37,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-01-12 14:36:37,503 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2019-01-12 14:36:37,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:37,511 INFO L225 Difference]: With dead ends: 1990 [2019-01-12 14:36:37,511 INFO L226 Difference]: Without dead ends: 1681 [2019-01-12 14:36:37,513 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=260, Invalid=610, Unknown=0, NotChecked=0, Total=870 [2019-01-12 14:36:37,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1681 states. [2019-01-12 14:36:37,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1681 to 587. [2019-01-12 14:36:37,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-01-12 14:36:37,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 869 transitions. [2019-01-12 14:36:37,623 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 869 transitions. Word has length 50 [2019-01-12 14:36:37,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:37,623 INFO L480 AbstractCegarLoop]: Abstraction has 587 states and 869 transitions. [2019-01-12 14:36:37,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 14:36:37,624 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 869 transitions. [2019-01-12 14:36:37,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-12 14:36:37,626 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:37,626 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] [2019-01-12 14:36:37,627 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:37,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:37,628 INFO L82 PathProgramCache]: Analyzing trace with hash 426668348, now seen corresponding path program 1 times [2019-01-12 14:36:37,628 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:37,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:37,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:37,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:37,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:37,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:37,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:36:37,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:37,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:36:37,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:36:37,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:36:37,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:36:37,809 INFO L87 Difference]: Start difference. First operand 587 states and 869 transitions. Second operand 4 states. [2019-01-12 14:36:38,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:38,369 INFO L93 Difference]: Finished difference Result 951 states and 1381 transitions. [2019-01-12 14:36:38,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 14:36:38,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-01-12 14:36:38,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:38,373 INFO L225 Difference]: With dead ends: 951 [2019-01-12 14:36:38,373 INFO L226 Difference]: Without dead ends: 649 [2019-01-12 14:36:38,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:36:38,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-01-12 14:36:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 449. [2019-01-12 14:36:38,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-01-12 14:36:38,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 665 transitions. [2019-01-12 14:36:38,463 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 665 transitions. Word has length 51 [2019-01-12 14:36:38,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:38,465 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 665 transitions. [2019-01-12 14:36:38,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:36:38,465 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 665 transitions. [2019-01-12 14:36:38,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-01-12 14:36:38,466 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:38,466 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] [2019-01-12 14:36:38,466 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:38,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:38,466 INFO L82 PathProgramCache]: Analyzing trace with hash -758030884, now seen corresponding path program 1 times [2019-01-12 14:36:38,467 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:38,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:38,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:38,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:38,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:38,708 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:36:38,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:38,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 14:36:38,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 14:36:38,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 14:36:38,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:36:38,710 INFO L87 Difference]: Start difference. First operand 449 states and 665 transitions. Second operand 5 states. [2019-01-12 14:36:39,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:39,168 INFO L93 Difference]: Finished difference Result 964 states and 1382 transitions. [2019-01-12 14:36:39,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 14:36:39,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2019-01-12 14:36:39,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:39,171 INFO L225 Difference]: With dead ends: 964 [2019-01-12 14:36:39,171 INFO L226 Difference]: Without dead ends: 686 [2019-01-12 14:36:39,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:36:39,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-01-12 14:36:39,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 449. [2019-01-12 14:36:39,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-01-12 14:36:39,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 657 transitions. [2019-01-12 14:36:39,258 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 657 transitions. Word has length 52 [2019-01-12 14:36:39,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:39,259 INFO L480 AbstractCegarLoop]: Abstraction has 449 states and 657 transitions. [2019-01-12 14:36:39,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 14:36:39,260 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 657 transitions. [2019-01-12 14:36:39,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-01-12 14:36:39,262 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:39,262 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] [2019-01-12 14:36:39,262 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:39,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:39,262 INFO L82 PathProgramCache]: Analyzing trace with hash -515372532, now seen corresponding path program 1 times [2019-01-12 14:36:39,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:39,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:39,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:39,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:39,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:39,491 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:36:39,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:39,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:36:39,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:36:39,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:36:39,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:36:39,494 INFO L87 Difference]: Start difference. First operand 449 states and 657 transitions. Second operand 4 states. [2019-01-12 14:36:39,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:39,919 INFO L93 Difference]: Finished difference Result 1013 states and 1437 transitions. [2019-01-12 14:36:39,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 14:36:39,920 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-01-12 14:36:39,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:39,924 INFO L225 Difference]: With dead ends: 1013 [2019-01-12 14:36:39,925 INFO L226 Difference]: Without dead ends: 767 [2019-01-12 14:36:39,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:36:39,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2019-01-12 14:36:40,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 459. [2019-01-12 14:36:40,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2019-01-12 14:36:40,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 663 transitions. [2019-01-12 14:36:40,069 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 663 transitions. Word has length 53 [2019-01-12 14:36:40,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:40,072 INFO L480 AbstractCegarLoop]: Abstraction has 459 states and 663 transitions. [2019-01-12 14:36:40,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:36:40,072 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 663 transitions. [2019-01-12 14:36:40,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-12 14:36:40,074 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:40,074 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] [2019-01-12 14:36:40,074 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:40,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:40,077 INFO L82 PathProgramCache]: Analyzing trace with hash -350052377, now seen corresponding path program 1 times [2019-01-12 14:36:40,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:40,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:40,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:40,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:40,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:40,172 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:36:40,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:40,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:36:40,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:36:40,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:36:40,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:36:40,174 INFO L87 Difference]: Start difference. First operand 459 states and 663 transitions. Second operand 3 states. [2019-01-12 14:36:40,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:40,366 INFO L93 Difference]: Finished difference Result 1337 states and 1941 transitions. [2019-01-12 14:36:40,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:36:40,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-01-12 14:36:40,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:40,370 INFO L225 Difference]: With dead ends: 1337 [2019-01-12 14:36:40,370 INFO L226 Difference]: Without dead ends: 897 [2019-01-12 14:36:40,371 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:36:40,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-01-12 14:36:40,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 523. [2019-01-12 14:36:40,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2019-01-12 14:36:40,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 781 transitions. [2019-01-12 14:36:40,450 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 781 transitions. Word has length 57 [2019-01-12 14:36:40,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:40,450 INFO L480 AbstractCegarLoop]: Abstraction has 523 states and 781 transitions. [2019-01-12 14:36:40,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:36:40,451 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 781 transitions. [2019-01-12 14:36:40,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-12 14:36:40,452 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:40,453 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] [2019-01-12 14:36:40,453 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:40,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:40,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1274582038, now seen corresponding path program 1 times [2019-01-12 14:36:40,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:40,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:40,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:40,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:40,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:40,729 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:36:40,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:40,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 14:36:40,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 14:36:40,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 14:36:40,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:36:40,730 INFO L87 Difference]: Start difference. First operand 523 states and 781 transitions. Second operand 7 states. [2019-01-12 14:36:41,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:41,432 INFO L93 Difference]: Finished difference Result 1431 states and 2018 transitions. [2019-01-12 14:36:41,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-01-12 14:36:41,433 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-01-12 14:36:41,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:41,437 INFO L225 Difference]: With dead ends: 1431 [2019-01-12 14:36:41,437 INFO L226 Difference]: Without dead ends: 1133 [2019-01-12 14:36:41,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2019-01-12 14:36:41,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2019-01-12 14:36:41,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 573. [2019-01-12 14:36:41,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2019-01-12 14:36:41,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 844 transitions. [2019-01-12 14:36:41,549 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 844 transitions. Word has length 57 [2019-01-12 14:36:41,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:41,549 INFO L480 AbstractCegarLoop]: Abstraction has 573 states and 844 transitions. [2019-01-12 14:36:41,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 14:36:41,549 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 844 transitions. [2019-01-12 14:36:41,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-12 14:36:41,551 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:41,552 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, 1] [2019-01-12 14:36:41,552 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:41,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:41,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1281029819, now seen corresponding path program 1 times [2019-01-12 14:36:41,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:41,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:41,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:41,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:41,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:41,757 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:36:41,757 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:41,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 14:36:41,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 14:36:41,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 14:36:41,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-12 14:36:41,758 INFO L87 Difference]: Start difference. First operand 573 states and 844 transitions. Second operand 7 states. [2019-01-12 14:36:42,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:42,152 INFO L93 Difference]: Finished difference Result 1288 states and 1809 transitions. [2019-01-12 14:36:42,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-01-12 14:36:42,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 58 [2019-01-12 14:36:42,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:42,156 INFO L225 Difference]: With dead ends: 1288 [2019-01-12 14:36:42,156 INFO L226 Difference]: Without dead ends: 960 [2019-01-12 14:36:42,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2019-01-12 14:36:42,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2019-01-12 14:36:42,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 624. [2019-01-12 14:36:42,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 624 states. [2019-01-12 14:36:42,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 624 states and 902 transitions. [2019-01-12 14:36:42,264 INFO L78 Accepts]: Start accepts. Automaton has 624 states and 902 transitions. Word has length 58 [2019-01-12 14:36:42,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:42,264 INFO L480 AbstractCegarLoop]: Abstraction has 624 states and 902 transitions. [2019-01-12 14:36:42,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 14:36:42,264 INFO L276 IsEmpty]: Start isEmpty. Operand 624 states and 902 transitions. [2019-01-12 14:36:42,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-12 14:36:42,265 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:42,266 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, 1] [2019-01-12 14:36:42,266 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:42,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:42,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1734073799, now seen corresponding path program 1 times [2019-01-12 14:36:42,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:42,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:42,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:42,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:42,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:42,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:42,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:36:42,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:42,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 14:36:42,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 14:36:42,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 14:36:42,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:36:42,473 INFO L87 Difference]: Start difference. First operand 624 states and 902 transitions. Second operand 8 states. [2019-01-12 14:36:43,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:43,587 INFO L93 Difference]: Finished difference Result 1598 states and 2164 transitions. [2019-01-12 14:36:43,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-01-12 14:36:43,588 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-01-12 14:36:43,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:43,592 INFO L225 Difference]: With dead ends: 1598 [2019-01-12 14:36:43,592 INFO L226 Difference]: Without dead ends: 1358 [2019-01-12 14:36:43,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=239, Invalid=691, Unknown=0, NotChecked=0, Total=930 [2019-01-12 14:36:43,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2019-01-12 14:36:43,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 623. [2019-01-12 14:36:43,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2019-01-12 14:36:43,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 890 transitions. [2019-01-12 14:36:43,708 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 890 transitions. Word has length 58 [2019-01-12 14:36:43,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:43,708 INFO L480 AbstractCegarLoop]: Abstraction has 623 states and 890 transitions. [2019-01-12 14:36:43,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 14:36:43,708 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 890 transitions. [2019-01-12 14:36:43,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-12 14:36:43,709 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:43,709 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, 1] [2019-01-12 14:36:43,710 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:43,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:43,710 INFO L82 PathProgramCache]: Analyzing trace with hash -845239413, now seen corresponding path program 1 times [2019-01-12 14:36:43,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:43,710 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:43,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:43,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:43,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:43,794 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:36:43,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:43,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:36:43,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:36:43,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:36:43,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:36:43,795 INFO L87 Difference]: Start difference. First operand 623 states and 890 transitions. Second operand 3 states. [2019-01-12 14:36:44,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:44,104 INFO L93 Difference]: Finished difference Result 1811 states and 2590 transitions. [2019-01-12 14:36:44,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:36:44,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-01-12 14:36:44,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:44,108 INFO L225 Difference]: With dead ends: 1811 [2019-01-12 14:36:44,109 INFO L226 Difference]: Without dead ends: 1207 [2019-01-12 14:36:44,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:36:44,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2019-01-12 14:36:44,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 733. [2019-01-12 14:36:44,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2019-01-12 14:36:44,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 1092 transitions. [2019-01-12 14:36:44,233 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 1092 transitions. Word has length 58 [2019-01-12 14:36:44,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:44,234 INFO L480 AbstractCegarLoop]: Abstraction has 733 states and 1092 transitions. [2019-01-12 14:36:44,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:36:44,234 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 1092 transitions. [2019-01-12 14:36:44,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-12 14:36:44,235 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:44,236 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, 1, 1] [2019-01-12 14:36:44,236 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:44,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:44,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1160186982, now seen corresponding path program 1 times [2019-01-12 14:36:44,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:44,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:44,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:44,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:44,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:44,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:36:44,909 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:44,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-01-12 14:36:44,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 14:36:44,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 14:36:44,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-12 14:36:44,911 INFO L87 Difference]: Start difference. First operand 733 states and 1092 transitions. Second operand 8 states. [2019-01-12 14:36:46,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:46,429 INFO L93 Difference]: Finished difference Result 1722 states and 2378 transitions. [2019-01-12 14:36:46,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-01-12 14:36:46,429 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2019-01-12 14:36:46,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:46,434 INFO L225 Difference]: With dead ends: 1722 [2019-01-12 14:36:46,434 INFO L226 Difference]: Without dead ends: 1376 [2019-01-12 14:36:46,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=218, Invalid=594, Unknown=0, NotChecked=0, Total=812 [2019-01-12 14:36:46,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2019-01-12 14:36:46,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 748. [2019-01-12 14:36:46,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-01-12 14:36:46,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1103 transitions. [2019-01-12 14:36:46,562 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1103 transitions. Word has length 59 [2019-01-12 14:36:46,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:46,562 INFO L480 AbstractCegarLoop]: Abstraction has 748 states and 1103 transitions. [2019-01-12 14:36:46,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 14:36:46,562 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1103 transitions. [2019-01-12 14:36:46,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-12 14:36:46,563 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:46,564 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, 1, 1] [2019-01-12 14:36:46,564 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:46,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:46,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1746992996, now seen corresponding path program 1 times [2019-01-12 14:36:46,564 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:46,564 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:46,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:46,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:46,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:46,752 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:36:46,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:46,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 14:36:46,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 14:36:46,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 14:36:46,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-12 14:36:46,754 INFO L87 Difference]: Start difference. First operand 748 states and 1103 transitions. Second operand 6 states. [2019-01-12 14:36:47,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:47,104 INFO L93 Difference]: Finished difference Result 1313 states and 1844 transitions. [2019-01-12 14:36:47,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 14:36:47,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-01-12 14:36:47,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:47,108 INFO L225 Difference]: With dead ends: 1313 [2019-01-12 14:36:47,108 INFO L226 Difference]: Without dead ends: 937 [2019-01-12 14:36:47,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-01-12 14:36:47,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 937 states. [2019-01-12 14:36:47,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 937 to 713. [2019-01-12 14:36:47,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2019-01-12 14:36:47,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 1057 transitions. [2019-01-12 14:36:47,231 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 1057 transitions. Word has length 59 [2019-01-12 14:36:47,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:47,231 INFO L480 AbstractCegarLoop]: Abstraction has 713 states and 1057 transitions. [2019-01-12 14:36:47,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 14:36:47,231 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 1057 transitions. [2019-01-12 14:36:47,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-12 14:36:47,233 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:47,233 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, 1, 1] [2019-01-12 14:36:47,233 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:47,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:47,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1319274569, now seen corresponding path program 1 times [2019-01-12 14:36:47,234 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:47,234 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:47,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:47,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:47,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:47,314 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:36:47,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:47,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:36:47,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:36:47,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:36:47,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:36:47,316 INFO L87 Difference]: Start difference. First operand 713 states and 1057 transitions. Second operand 3 states. [2019-01-12 14:36:47,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:47,865 INFO L93 Difference]: Finished difference Result 2093 states and 3111 transitions. [2019-01-12 14:36:47,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:36:47,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-01-12 14:36:47,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:47,876 INFO L225 Difference]: With dead ends: 2093 [2019-01-12 14:36:47,876 INFO L226 Difference]: Without dead ends: 1399 [2019-01-12 14:36:47,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:36:47,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2019-01-12 14:36:48,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 945. [2019-01-12 14:36:48,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 945 states. [2019-01-12 14:36:48,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1477 transitions. [2019-01-12 14:36:48,156 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1477 transitions. Word has length 59 [2019-01-12 14:36:48,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:48,157 INFO L480 AbstractCegarLoop]: Abstraction has 945 states and 1477 transitions. [2019-01-12 14:36:48,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:36:48,157 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1477 transitions. [2019-01-12 14:36:48,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-01-12 14:36:48,162 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:48,162 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, 1, 1, 1] [2019-01-12 14:36:48,163 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:48,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:48,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1887492868, now seen corresponding path program 1 times [2019-01-12 14:36:48,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:48,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:48,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:48,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:48,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:48,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:36:48,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:48,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:36:48,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:36:48,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:36:48,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:36:48,250 INFO L87 Difference]: Start difference. First operand 945 states and 1477 transitions. Second operand 3 states. [2019-01-12 14:36:48,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:48,648 INFO L93 Difference]: Finished difference Result 2781 states and 4355 transitions. [2019-01-12 14:36:48,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:36:48,649 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-01-12 14:36:48,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:48,655 INFO L225 Difference]: With dead ends: 2781 [2019-01-12 14:36:48,655 INFO L226 Difference]: Without dead ends: 1855 [2019-01-12 14:36:48,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:36:48,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2019-01-12 14:36:48,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1401. [2019-01-12 14:36:48,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1401 states. [2019-01-12 14:36:48,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 2293 transitions. [2019-01-12 14:36:48,812 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 2293 transitions. Word has length 60 [2019-01-12 14:36:48,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:48,812 INFO L480 AbstractCegarLoop]: Abstraction has 1401 states and 2293 transitions. [2019-01-12 14:36:48,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:36:48,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 2293 transitions. [2019-01-12 14:36:48,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-01-12 14:36:48,814 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:48,815 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, 1, 1, 1, 1] [2019-01-12 14:36:48,817 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:48,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:48,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1583078645, now seen corresponding path program 1 times [2019-01-12 14:36:48,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:48,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:48,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:48,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:48,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:48,888 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 14:36:48,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:48,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 14:36:48,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 14:36:48,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 14:36:48,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:36:48,889 INFO L87 Difference]: Start difference. First operand 1401 states and 2293 transitions. Second operand 3 states. [2019-01-12 14:36:49,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:49,325 INFO L93 Difference]: Finished difference Result 4133 states and 6771 transitions. [2019-01-12 14:36:49,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 14:36:49,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-01-12 14:36:49,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:49,335 INFO L225 Difference]: With dead ends: 4133 [2019-01-12 14:36:49,335 INFO L226 Difference]: Without dead ends: 2751 [2019-01-12 14:36:49,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 14:36:49,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2751 states. [2019-01-12 14:36:49,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2751 to 2297. [2019-01-12 14:36:49,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2297 states. [2019-01-12 14:36:49,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2297 states to 2297 states and 3877 transitions. [2019-01-12 14:36:49,515 INFO L78 Accepts]: Start accepts. Automaton has 2297 states and 3877 transitions. Word has length 61 [2019-01-12 14:36:49,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:49,516 INFO L480 AbstractCegarLoop]: Abstraction has 2297 states and 3877 transitions. [2019-01-12 14:36:49,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 14:36:49,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2297 states and 3877 transitions. [2019-01-12 14:36:49,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-12 14:36:49,520 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 14:36:49,520 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, 1, 1, 1, 1, 1] [2019-01-12 14:36:49,520 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 14:36:49,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 14:36:49,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1787678266, now seen corresponding path program 1 times [2019-01-12 14:36:49,521 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 14:36:49,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 14:36:49,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:49,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 14:36:49,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 14:36:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 14:36:49,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-12 14:36:49,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 14:36:49,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 14:36:49,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 14:36:49,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 14:36:49,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 14:36:49,672 INFO L87 Difference]: Start difference. First operand 2297 states and 3877 transitions. Second operand 4 states. [2019-01-12 14:36:49,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 14:36:49,915 INFO L93 Difference]: Finished difference Result 2462 states and 4098 transitions. [2019-01-12 14:36:49,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 14:36:49,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-01-12 14:36:49,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 14:36:49,916 INFO L225 Difference]: With dead ends: 2462 [2019-01-12 14:36:49,916 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 14:36:49,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 14:36:49,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 14:36:49,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 14:36:49,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 14:36:49,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 14:36:49,920 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2019-01-12 14:36:49,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 14:36:49,920 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 14:36:49,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 14:36:49,920 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 14:36:49,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 14:36:49,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 14:36:49,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:49,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:50,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:50,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:50,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:50,038 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:50,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:50,061 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:50,068 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:50,141 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 111 [2019-01-12 14:36:50,179 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:50,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:50,190 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:50,192 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:50,195 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:50,200 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:50,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:50,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:50,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:50,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:50,302 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:50,636 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:50,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:50,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:50,872 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:50,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:50,890 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:50,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:50,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:51,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:51,276 WARN L181 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 371 DAG size of output: 270 [2019-01-12 14:36:51,289 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:51,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:51,426 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:51,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:51,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:51,434 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:51,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:51,603 WARN L181 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 172 [2019-01-12 14:36:52,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:52,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:52,021 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:52,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:52,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:52,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:52,031 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:52,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:52,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:52,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:52,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:53,066 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:54,477 WARN L181 SmtUtils]: Spent 2.87 s on a formula simplification. DAG size of input: 657 DAG size of output: 561 [2019-01-12 14:36:54,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:54,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:54,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:55,020 WARN L181 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 356 DAG size of output: 309 [2019-01-12 14:36:55,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:55,155 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:55,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:55,273 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:55,336 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:55,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:55,463 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:55,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:56,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:56,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:56,097 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:56,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:56,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:56,101 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:56,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:56,105 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:56,106 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:56,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:56,209 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:56,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:57,477 WARN L181 SmtUtils]: Spent 2.45 s on a formula simplification. DAG size of input: 740 DAG size of output: 624 [2019-01-12 14:36:57,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:57,499 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:57,500 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:57,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:57,502 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:57,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:57,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:57,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:57,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:57,547 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:57,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:57,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:57,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:57,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:57,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:57,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:57,793 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:57,799 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:57,800 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:57,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,067 WARN L181 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 371 DAG size of output: 270 [2019-01-12 14:36:58,174 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,220 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,223 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,234 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,292 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 159 [2019-01-12 14:36:58,300 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,304 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,471 WARN L181 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 196 [2019-01-12 14:36:58,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,493 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,494 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,507 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,535 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,621 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 160 [2019-01-12 14:36:58,635 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,714 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,715 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,731 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,732 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,789 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 168 [2019-01-12 14:36:58,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,822 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,929 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,960 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:58,972 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:59,068 WARN L181 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 217 [2019-01-12 14:36:59,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:59,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:59,099 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:59,145 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:59,149 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:59,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:59,355 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:59,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:59,403 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:59,407 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:59,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:59,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:59,466 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:59,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:59,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:59,512 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:59,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:59,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:59,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:59,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:36:59,892 WARN L181 SmtUtils]: Spent 766.00 ms on a formula simplification. DAG size of input: 415 DAG size of output: 336 [2019-01-12 14:36:59,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:00,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:00,201 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:00,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:00,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:00,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:00,483 WARN L181 SmtUtils]: Spent 582.00 ms on a formula simplification. DAG size of input: 349 DAG size of output: 283 [2019-01-12 14:37:00,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:00,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:00,689 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:00,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:00,986 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:00,990 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,521 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:01,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:02,033 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:03,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:04,584 WARN L181 SmtUtils]: Spent 4.10 s on a formula simplification. DAG size of input: 776 DAG size of output: 685 [2019-01-12 14:37:04,594 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:04,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:04,598 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:04,629 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:04,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:04,674 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:04,695 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:04,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:04,818 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:04,937 WARN L181 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 302 DAG size of output: 237 [2019-01-12 14:37:04,945 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,026 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,028 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,129 WARN L181 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 172 [2019-01-12 14:37:05,238 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,398 WARN L181 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 174 [2019-01-12 14:37:05,405 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,418 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,419 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,431 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,435 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,442 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,451 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,454 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,501 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,577 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,582 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,584 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,686 WARN L181 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 245 DAG size of output: 172 [2019-01-12 14:37:05,740 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,794 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,798 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,812 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,816 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,872 WARN L181 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 194 DAG size of output: 156 [2019-01-12 14:37:05,905 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,917 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,919 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,930 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:05,935 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:06,015 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:06,020 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:06,187 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:06,283 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:06,307 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:06,309 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:06,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:06,318 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:06,324 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:06,326 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:06,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:06,554 WARN L181 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 371 DAG size of output: 270 [2019-01-12 14:37:06,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:06,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:06,615 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:06,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:06,807 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:06,811 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:06,915 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:07,825 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:07,888 WARN L181 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 555 DAG size of output: 494 [2019-01-12 14:37:07,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:07,894 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:07,940 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:07,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:07,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:07,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:07,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,011 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 168 [2019-01-12 14:37:08,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,025 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,045 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,046 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,048 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,049 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,053 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,056 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,060 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,064 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,070 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,073 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,084 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,095 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,098 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,130 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,177 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,216 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,232 WARN L181 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 144 [2019-01-12 14:37:08,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,254 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,255 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,256 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,257 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,260 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,263 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,303 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,306 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,519 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,543 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,553 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,651 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,790 WARN L181 SmtUtils]: Spent 557.00 ms on a formula simplification. DAG size of input: 371 DAG size of output: 270 [2019-01-12 14:37:08,823 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,834 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,839 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,843 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,951 WARN L181 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 199 DAG size of output: 175 [2019-01-12 14:37:08,956 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:08,958 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:09,006 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:09,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:09,022 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:09,023 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:09,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:09,079 WARN L181 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 168 [2019-01-12 14:37:09,104 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:09,108 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:09,112 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:09,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:09,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:10,652 WARN L181 SmtUtils]: Spent 1.57 s on a formula simplification. DAG size of input: 488 DAG size of output: 433 [2019-01-12 14:37:10,664 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:10,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:10,711 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:10,712 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:10,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:10,728 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:10,729 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 14:37:10,784 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 166 [2019-01-12 14:37:10,887 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 11 [2019-01-12 14:37:11,976 WARN L181 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 102 DAG size of output: 41 [2019-01-12 14:37:14,135 WARN L181 SmtUtils]: Spent 2.16 s on a formula simplification. DAG size of input: 261 DAG size of output: 55 [2019-01-12 14:37:15,141 WARN L181 SmtUtils]: Spent 1.00 s on a formula simplification. DAG size of input: 164 DAG size of output: 57 [2019-01-12 14:37:22,914 WARN L181 SmtUtils]: Spent 7.75 s on a formula simplification. DAG size of input: 547 DAG size of output: 82 [2019-01-12 14:37:25,220 WARN L181 SmtUtils]: Spent 2.28 s on a formula simplification. DAG size of input: 304 DAG size of output: 47 [2019-01-12 14:37:33,649 WARN L181 SmtUtils]: Spent 8.42 s on a formula simplification. DAG size of input: 595 DAG size of output: 73 [2019-01-12 14:37:35,697 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 261 DAG size of output: 55 [2019-01-12 14:37:36,502 WARN L181 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 26 [2019-01-12 14:37:38,206 WARN L181 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 191 DAG size of output: 77 [2019-01-12 14:37:38,426 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 23 [2019-01-12 14:37:39,213 WARN L181 SmtUtils]: Spent 785.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 53 [2019-01-12 14:37:39,527 WARN L181 SmtUtils]: Spent 297.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 25 [2019-01-12 14:37:40,442 WARN L181 SmtUtils]: Spent 912.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 59 [2019-01-12 14:37:41,936 WARN L181 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 205 DAG size of output: 77 [2019-01-12 14:37:42,093 WARN L181 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 21 [2019-01-12 14:37:42,230 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 26 [2019-01-12 14:37:45,195 WARN L181 SmtUtils]: Spent 2.93 s on a formula simplification. DAG size of input: 331 DAG size of output: 45 [2019-01-12 14:37:47,716 WARN L181 SmtUtils]: Spent 2.51 s on a formula simplification. DAG size of input: 277 DAG size of output: 49 [2019-01-12 14:37:59,830 WARN L181 SmtUtils]: Spent 12.11 s on a formula simplification. DAG size of input: 680 DAG size of output: 77 [2019-01-12 14:38:01,705 WARN L181 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 227 DAG size of output: 62 [2019-01-12 14:38:02,706 WARN L181 SmtUtils]: Spent 997.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 57 [2019-01-12 14:38:04,037 WARN L181 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 173 DAG size of output: 34 [2019-01-12 14:38:04,664 WARN L181 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 51 [2019-01-12 14:38:05,739 WARN L181 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 164 DAG size of output: 57 [2019-01-12 14:38:06,522 WARN L181 SmtUtils]: Spent 779.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 29 [2019-01-12 14:38:08,484 WARN L181 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 261 DAG size of output: 55 [2019-01-12 14:38:14,325 WARN L181 SmtUtils]: Spent 5.84 s on a formula simplification. DAG size of input: 489 DAG size of output: 85 [2019-01-12 14:38:15,169 WARN L181 SmtUtils]: Spent 841.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 59 [2019-01-12 14:38:16,365 WARN L181 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 128 DAG size of output: 57 [2019-01-12 14:38:18,328 WARN L181 SmtUtils]: Spent 1.96 s on a formula simplification. DAG size of input: 261 DAG size of output: 55 [2019-01-12 14:38:19,517 WARN L181 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 168 DAG size of output: 71 [2019-01-12 14:38:20,362 WARN L181 SmtUtils]: Spent 842.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 59 [2019-01-12 14:38:25,511 WARN L181 SmtUtils]: Spent 5.14 s on a formula simplification. DAG size of input: 429 DAG size of output: 70 [2019-01-12 14:38:26,430 WARN L181 SmtUtils]: Spent 904.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 57 [2019-01-12 14:38:26,434 INFO L448 ceAbstractionStarter]: For program point L762(lines 762 770) no Hoare annotation was computed. [2019-01-12 14:38:26,434 INFO L444 ceAbstractionStarter]: At program point L2514(lines 2497 2520) the Hoare annotation is: (let ((.cse4 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse5 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse6 (= ULTIMATE.start_setClientId_~handle 3)) (.cse7 (= 2 ~rjh~0)) (.cse9 (= 2 ULTIMATE.start_createEmail_~to)) (.cse8 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse10 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse11 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse2 (not (= ULTIMATE.start_mail_~msg 2))) (.cse0 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse1 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse3 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client))) (or (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse0 .cse1 .cse2 .cse3 (and .cse4 (and (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~tmp~6 0)) .cse5 .cse6 .cse7 (not (= ULTIMATE.start_setEmailFrom_~handle 2)) .cse8 (= ULTIMATE.start_setEmailTo_~handle 1) .cse9 .cse10 .cse11) (not (= ULTIMATE.start_getEmailFrom_~handle 2)))) (and (and (and .cse4 (and (and .cse5 .cse6 .cse7 (= 2 ~__ste_email_to0~0) .cse9 .cse8 .cse10) .cse11)) (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse2 (not (= ULTIMATE.start_outgoing_~msg 2))) .cse0 .cse1 .cse3))) [2019-01-12 14:38:26,434 INFO L444 ceAbstractionStarter]: At program point L2514-1(lines 2497 2520) the Hoare annotation is: (let ((.cse0 (and (= ULTIMATE.start_setClientId_~handle 3) (not (= ULTIMATE.start_createEmail_~to 1)) (not (= ~rjh~0 1)) (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)))) (or (and .cse0 (= 0 |ULTIMATE.start_getClientForwardReceiver_#res|)) (and (and (= 2 ~rjh~0) (= 2 ULTIMATE.start_createEmail_~to) (and (= 1 |ULTIMATE.start_createEmail_#res|) .cse0 (= 1 ULTIMATE.start_createEmail_~msg~0))) (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client) (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client)))) [2019-01-12 14:38:26,435 INFO L448 ceAbstractionStarter]: For program point L599(lines 599 606) no Hoare annotation was computed. [2019-01-12 14:38:26,435 INFO L444 ceAbstractionStarter]: At program point L599-1(lines 1 2587) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse9 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse10 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client)) (.cse1 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse5 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse3 (= ULTIMATE.start_setClientId_~handle 3)) (.cse7 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse4 (= 2 ~rjh~0)) (.cse6 (= 2 ULTIMATE.start_createEmail_~to)) (.cse8 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse2 (not (= ULTIMATE.start_mail_~msg 2)))) (or (and .cse0 (and .cse1 .cse2 (and .cse3 .cse4 (= 2 ~__ste_email_to0~0) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) .cse5 .cse6 .cse7 .cse8)) .cse9 .cse10) (and .cse0 .cse9 .cse10 (let ((.cse11 (and .cse1 (and (and (and .cse5 (and .cse3 .cse7)) .cse4 .cse6) .cse8) .cse2)) (.cse12 (not (= ULTIMATE.start_outgoing_~msg 2)))) (or (and .cse11 (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse12) (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse11 .cse12)))))) [2019-01-12 14:38:26,435 INFO L448 ceAbstractionStarter]: For program point L2548(lines 2548 2564) no Hoare annotation was computed. [2019-01-12 14:38:26,435 INFO L448 ceAbstractionStarter]: For program point L599-2(lines 599 606) no Hoare annotation was computed. [2019-01-12 14:38:26,435 INFO L448 ceAbstractionStarter]: For program point L2548-1(lines 2548 2564) no Hoare annotation was computed. [2019-01-12 14:38:26,435 INFO L448 ceAbstractionStarter]: For program point L1425(lines 1425 1429) no Hoare annotation was computed. [2019-01-12 14:38:26,435 INFO L448 ceAbstractionStarter]: For program point L1392(lines 1392 1396) no Hoare annotation was computed. [2019-01-12 14:38:26,436 INFO L444 ceAbstractionStarter]: At program point L1425-1(lines 1297 1443) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:38:26,436 INFO L448 ceAbstractionStarter]: For program point L963(lines 963 974) no Hoare annotation was computed. [2019-01-12 14:38:26,436 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 936) no Hoare annotation was computed. [2019-01-12 14:38:26,436 INFO L448 ceAbstractionStarter]: For program point L963-1(lines 963 974) no Hoare annotation was computed. [2019-01-12 14:38:26,436 INFO L448 ceAbstractionStarter]: For program point L930-1(lines 930 936) no Hoare annotation was computed. [2019-01-12 14:38:26,436 INFO L448 ceAbstractionStarter]: For program point L963-2(lines 963 974) no Hoare annotation was computed. [2019-01-12 14:38:26,437 INFO L448 ceAbstractionStarter]: For program point L930-2(lines 930 936) no Hoare annotation was computed. [2019-01-12 14:38:26,437 INFO L448 ceAbstractionStarter]: For program point L963-3(lines 963 974) no Hoare annotation was computed. [2019-01-12 14:38:26,437 INFO L448 ceAbstractionStarter]: For program point L930-3(lines 930 936) no Hoare annotation was computed. [2019-01-12 14:38:26,437 INFO L444 ceAbstractionStarter]: At program point L898(lines 885 903) the Hoare annotation is: (let ((.cse0 (= 1 |ULTIMATE.start_isReadable_#res|)) (.cse1 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~0 1)) (.cse12 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse13 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse2 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse3 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse4 (= ULTIMATE.start_setClientId_~handle 3)) (.cse5 (= 2 ~rjh~0)) (.cse7 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse8 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse9 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse10 (not (= ULTIMATE.start_mail_~msg 2))) (.cse11 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse14 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client))) (or (and .cse0 .cse1 (and (and .cse2 (and .cse3 .cse4 .cse5 (= 2 ~__ste_email_to0~0) .cse6 .cse7 .cse8 .cse9) .cse10 .cse11) .cse12 .cse13 .cse14)) (and .cse0 .cse1 (and .cse12 .cse13 (let ((.cse15 (and .cse2 (and .cse3 .cse4 .cse5 .cse7 .cse6 .cse8 .cse9) .cse10 .cse11))) (or (and (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse15) (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse15))) .cse14)))) [2019-01-12 14:38:26,437 INFO L451 ceAbstractionStarter]: At program point L898-1(lines 885 903) the Hoare annotation is: true [2019-01-12 14:38:26,438 INFO L444 ceAbstractionStarter]: At program point L1362(lines 1352 1438) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:38:26,438 INFO L444 ceAbstractionStarter]: At program point L1329(lines 1316 1441) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:38:26,438 INFO L448 ceAbstractionStarter]: For program point L2552(lines 2552 2563) no Hoare annotation was computed. [2019-01-12 14:38:26,438 INFO L448 ceAbstractionStarter]: For program point L2552-1(lines 2552 2563) no Hoare annotation was computed. [2019-01-12 14:38:26,438 INFO L448 ceAbstractionStarter]: For program point L2090(lines 2090 2102) no Hoare annotation was computed. [2019-01-12 14:38:26,438 INFO L448 ceAbstractionStarter]: For program point L967(lines 967 973) no Hoare annotation was computed. [2019-01-12 14:38:26,438 INFO L448 ceAbstractionStarter]: For program point L967-1(lines 967 973) no Hoare annotation was computed. [2019-01-12 14:38:26,439 INFO L448 ceAbstractionStarter]: For program point L967-2(lines 967 973) no Hoare annotation was computed. [2019-01-12 14:38:26,439 INFO L448 ceAbstractionStarter]: For program point L967-3(lines 967 973) no Hoare annotation was computed. [2019-01-12 14:38:26,439 INFO L448 ceAbstractionStarter]: For program point L1298(lines 1297 1443) no Hoare annotation was computed. [2019-01-12 14:38:26,439 INFO L444 ceAbstractionStarter]: At program point L935(lines 922 940) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse13 (not (= ULTIMATE.start_autoRespond_~msg 2))) (.cse15 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse6 (not (= ULTIMATE.start_mail_~msg 2))) (.cse1 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse9 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~tmp~6 0))) (.cse10 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= 2 ~rjh~0)) (.cse3 (= 2 ~__ste_email_to0~0)) (.cse11 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse5 (= 2 ULTIMATE.start_setEmailTo_~value)) (.cse14 (= ULTIMATE.start_setEmailTo_~handle 1)) (.cse7 (= 2 ULTIMATE.start_createEmail_~to)) (.cse8 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse16 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse12 (not (= ULTIMATE.start_getEmailFrom_~handle 2))) (.cse4 (not (= ULTIMATE.start_outgoing_~msg 2)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ULTIMATE.start_outgoing_~msg 1)) .cse6 .cse7 (not (= ULTIMATE.start_mail_~msg 1)) .cse8 (= 0 ULTIMATE.start_incoming__wrappee__AutoResponder_~client) .cse9 (not (= ULTIMATE.start_autoRespond_~msg 1)) .cse10 (= 0 |ULTIMATE.start_getEmailTo_#res|) .cse11 (not (= |ULTIMATE.start_getClientAutoResponse_#res| 0)) .cse12 (not (= ULTIMATE.start_getEmailFrom_~handle 1)) .cse13 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 1)) .cse14 .cse15 (= 0 ULTIMATE.start_getClientAutoResponse_~handle) .cse16) (and .cse0 .cse13 .cse15 .cse6 (and .cse1 .cse9 .cse10 .cse2 (= 2 ULTIMATE.start_incoming_~client) .cse3 .cse11 .cse5 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse14 .cse7 .cse8 .cse16) (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client) .cse12 .cse4))) [2019-01-12 14:38:26,439 INFO L444 ceAbstractionStarter]: At program point L935-1(lines 922 940) the Hoare annotation is: (let ((.cse0 (= 1 |ULTIMATE.start_isReadable_#res|)) (.cse1 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~0 1)) (.cse12 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse13 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse2 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse3 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse4 (= ULTIMATE.start_setClientId_~handle 3)) (.cse5 (= 2 ~rjh~0)) (.cse7 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse8 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse9 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse10 (not (= ULTIMATE.start_mail_~msg 2))) (.cse11 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse14 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client))) (or (and .cse0 .cse1 (and (and .cse2 (and .cse3 .cse4 .cse5 (= 2 ~__ste_email_to0~0) .cse6 .cse7 .cse8 .cse9) .cse10 .cse11) .cse12 .cse13 .cse14)) (and .cse0 .cse1 (and .cse12 .cse13 (let ((.cse15 (and .cse2 (and .cse3 .cse4 .cse5 .cse7 .cse6 .cse8 .cse9) .cse10 .cse11))) (or (and (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse15) (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse15))) .cse14)))) [2019-01-12 14:38:26,439 INFO L444 ceAbstractionStarter]: At program point L935-2(lines 922 940) the Hoare annotation is: (let ((.cse7 (= 2 ~rjh~0)) (.cse8 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle))) (.cse5 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse6 (= 1 ULTIMATE.start_createEmail_~msg~0))) (let ((.cse1 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse2 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse3 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client)) (.cse0 (and (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~tmp~6 0)) (and (and .cse7 .cse8 (and .cse4 .cse5)) .cse6)))) (or (and (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2)) (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse0 .cse1 .cse2 (not (= ULTIMATE.start_mail_~msg 2)) .cse3 (not (= ULTIMATE.start_outgoing_~msg 2))) (and .cse1 .cse2 .cse3 (and (not (= ULTIMATE.start_autoRespond_~msg 1)) (not (= ULTIMATE.start_outgoing_~msg 1)) (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 1)) .cse0 (not (= ULTIMATE.start_mail_~msg 1)))) (and (and (not (= ULTIMATE.start_getEmailTo_~handle 2)) (and (and (= 0 ~__ste_client_forwardReceiver1~0) .cse4) .cse5 .cse6)) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse7 (= 2 ULTIMATE.start_incoming_~client) (= 2 ~__ste_email_to0~0) .cse8)))) [2019-01-12 14:38:26,440 INFO L451 ceAbstractionStarter]: At program point L935-3(lines 922 940) the Hoare annotation is: true [2019-01-12 14:38:26,440 INFO L444 ceAbstractionStarter]: At program point L671(lines 666 674) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse9 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse10 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client)) (.cse1 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse5 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse3 (= ULTIMATE.start_setClientId_~handle 3)) (.cse7 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse4 (= 2 ~rjh~0)) (.cse6 (= 2 ULTIMATE.start_createEmail_~to)) (.cse8 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse2 (not (= ULTIMATE.start_mail_~msg 2)))) (or (and .cse0 (and .cse1 .cse2 (and .cse3 .cse4 (= 2 ~__ste_email_to0~0) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) .cse5 .cse6 .cse7 .cse8)) .cse9 .cse10) (and .cse0 .cse9 .cse10 (let ((.cse11 (and .cse1 (and (and (and .cse5 (and .cse3 .cse7)) .cse4 .cse6) .cse8) .cse2)) (.cse12 (not (= ULTIMATE.start_outgoing_~msg 2)))) (or (and .cse11 (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse12) (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse11 .cse12)))))) [2019-01-12 14:38:26,440 INFO L444 ceAbstractionStarter]: At program point L1398(lines 1388 1435) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:38:26,440 INFO L448 ceAbstractionStarter]: For program point L1299(lines 1299 1303) no Hoare annotation was computed. [2019-01-12 14:38:26,440 INFO L448 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-01-12 14:38:26,440 INFO L448 ceAbstractionStarter]: For program point L110-1(line 110) no Hoare annotation was computed. [2019-01-12 14:38:26,440 INFO L444 ceAbstractionStarter]: At program point L111(lines 117 134) the Hoare annotation is: (let ((.cse0 (= 1 |ULTIMATE.start_isReadable_#res|)) (.cse1 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~0 1)) (.cse12 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse13 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse2 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse3 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse4 (= ULTIMATE.start_setClientId_~handle 3)) (.cse5 (= 2 ~rjh~0)) (.cse7 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse8 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse9 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse10 (not (= ULTIMATE.start_mail_~msg 2))) (.cse11 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse14 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client))) (or (and .cse0 .cse1 (and (and .cse2 (and .cse3 .cse4 .cse5 (= 2 ~__ste_email_to0~0) .cse6 .cse7 .cse8 .cse9) .cse10 .cse11) .cse12 .cse13 .cse14)) (and .cse0 .cse1 (and .cse12 .cse13 (let ((.cse15 (and .cse2 (and .cse3 .cse4 .cse5 .cse7 .cse6 .cse8 .cse9) .cse10 .cse11))) (or (and (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse15) (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse15))) .cse14)))) [2019-01-12 14:38:26,440 INFO L451 ceAbstractionStarter]: At program point L111-1(lines 117 134) the Hoare annotation is: true [2019-01-12 14:38:26,441 INFO L448 ceAbstractionStarter]: For program point L2093(lines 2093 2101) no Hoare annotation was computed. [2019-01-12 14:38:26,441 INFO L444 ceAbstractionStarter]: At program point L805(lines 785 807) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 0 ~__ste_client_forwardReceiver1~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:38:26,441 INFO L448 ceAbstractionStarter]: For program point L2556(lines 2556 2562) no Hoare annotation was computed. [2019-01-12 14:38:26,441 INFO L448 ceAbstractionStarter]: For program point L2556-1(lines 2556 2562) no Hoare annotation was computed. [2019-01-12 14:38:26,441 INFO L448 ceAbstractionStarter]: For program point L1367(lines 1367 1374) no Hoare annotation was computed. [2019-01-12 14:38:26,441 INFO L448 ceAbstractionStarter]: For program point L1334(lines 1334 1338) no Hoare annotation was computed. [2019-01-12 14:38:26,441 INFO L444 ceAbstractionStarter]: At program point L972(lines 959 977) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse1 (= ULTIMATE.start_setClientId_~handle 3)) (.cse2 (= 2 ~rjh~0)) (.cse3 (= 2 ~__ste_email_to0~0)) (.cse4 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse5 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse6 (= 2 ULTIMATE.start_setEmailTo_~value)) (.cse7 (= ULTIMATE.start_setEmailTo_~handle 1)) (.cse8 (not (= ULTIMATE.start_mail_~msg 2))) (.cse9 (= 2 ULTIMATE.start_createEmail_~to)) (.cse10 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse11 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 .cse1 .cse2 (= 0 |ULTIMATE.start_getEmailTo_#res|) .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_outgoing_~msg 1)) .cse7 .cse8 .cse9 (not (= ULTIMATE.start_mail_~msg 1)) .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse7 .cse8 .cse9 .cse10 .cse11))) [2019-01-12 14:38:26,441 INFO L444 ceAbstractionStarter]: At program point L972-1(lines 959 977) the Hoare annotation is: (let ((.cse0 (= 1 |ULTIMATE.start_isReadable_#res|)) (.cse1 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~0 1)) (.cse2 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse3 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse14 (not (= ULTIMATE.start_mail_~msg 2))) (.cse7 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse8 (= ULTIMATE.start_setClientId_~handle 3)) (.cse9 (= 2 ~rjh~0)) (.cse10 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse11 (= 2 ULTIMATE.start_createEmail_~to)) (.cse12 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse13 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse6 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse4 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4 (let ((.cse5 (and .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14))) (or (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse5 .cse6) (and (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse5 .cse6))))) (and .cse0 .cse1 (and .cse2 .cse3 (and .cse14 (and .cse7 (and .cse8 .cse9 (= 2 ~__ste_email_to0~0) .cse10 .cse11 .cse12 .cse13)) .cse6) .cse4)))) [2019-01-12 14:38:26,442 INFO L444 ceAbstractionStarter]: At program point L972-2(lines 959 977) the Hoare annotation is: (let ((.cse3 (= 2 ~rjh~0)) (.cse8 (= 2 ULTIMATE.start_createEmail_~to)) (.cse5 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse9 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse16 (= ULTIMATE.start_setClientId_~handle 3)) (.cse17 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle))) (let ((.cse2 (= 2 |ULTIMATE.start_getEmailTo_#res|)) (.cse4 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse6 (and .cse16 (not (= ~rjh~0 1)) (not (= |ULTIMATE.start_getEmailTo_#res| 1)) .cse17)) (.cse7 (= 2 ~__ste_email_to0~0)) (.cse0 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse14 (and (and .cse3 .cse8 (and .cse5 (and .cse16 .cse17))) .cse9)) (.cse1 (not (= ULTIMATE.start_mail_~msg 2))) (.cse10 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse11 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse12 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse13 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client))) (or (and (and (and .cse0 .cse1 (and (and .cse2 .cse3 (and .cse4 (and .cse5 .cse6)) .cse7 .cse8) .cse9)) .cse10) .cse11 .cse12 .cse13) (and .cse11 (and (not (= ULTIMATE.start_mail_~msg 1)) (and .cse0 (and (not (= ULTIMATE.start_outgoing_~msg 1)) .cse14))) .cse12 .cse13) (and .cse2 .cse3 (and .cse4 (and (and .cse6 (= 0 ~__ste_client_forwardReceiver1~0)) .cse5 .cse9)) .cse7 .cse8) (and (let ((.cse15 (and .cse0 .cse14 .cse1 .cse10))) (or (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse15) (and .cse15 (not (= ULTIMATE.start_setEmailTo_~handle 2))))) .cse11 .cse12 .cse13)))) [2019-01-12 14:38:26,442 INFO L451 ceAbstractionStarter]: At program point L972-3(lines 959 977) the Hoare annotation is: true [2019-01-12 14:38:26,442 INFO L448 ceAbstractionStarter]: For program point L2525(lines 2525 2537) no Hoare annotation was computed. [2019-01-12 14:38:26,442 INFO L448 ceAbstractionStarter]: For program point L2096(lines 2096 2100) no Hoare annotation was computed. [2019-01-12 14:38:26,442 INFO L444 ceAbstractionStarter]: At program point L2096-2(lines 1 2587) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= ULTIMATE.start_test_~op2~0 0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:38:26,442 INFO L448 ceAbstractionStarter]: For program point L1403(lines 1403 1407) no Hoare annotation was computed. [2019-01-12 14:38:26,442 INFO L448 ceAbstractionStarter]: For program point L1305(lines 1305 1442) no Hoare annotation was computed. [2019-01-12 14:38:26,442 INFO L448 ceAbstractionStarter]: For program point L579(lines 579 585) no Hoare annotation was computed. [2019-01-12 14:38:26,443 INFO L444 ceAbstractionStarter]: At program point L579-1(lines 571 588) the Hoare annotation is: (let ((.cse16 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client)) (.cse8 (= 2 ULTIMATE.start_incoming_~client)) (.cse10 (= 2 |ULTIMATE.start_getEmailTo_#res|)) (.cse1 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse4 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse7 (= 2 ~rjh~0)) (.cse18 (= 2 ~__ste_email_to0~0)) (.cse17 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse2 (not (= ULTIMATE.start_mail_~msg 2))) (.cse12 (= 2 ULTIMATE.start_createEmail_~to)) (.cse14 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse5 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~tmp~6 0))) (.cse6 (= ULTIMATE.start_setClientId_~handle 3)) (.cse9 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse3 (not (= ULTIMATE.start_getEmailFrom_~handle 2))) (.cse0 (not (= ULTIMATE.start_autoRespond_~msg 2))) (.cse11 (= ULTIMATE.start_setEmailTo_~handle 1)) (.cse19 (not (= ULTIMATE.start_setEmailTo_~handle 2))) (.cse15 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse13 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 (and .cse1 .cse2 .cse3 (and .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14)) .cse15 .cse16 .cse17) (and .cse15 .cse16 (and (and .cse1 (and .cse4 .cse6 .cse7 .cse8 .cse18 .cse9 .cse10 .cse12 .cse14 .cse13)) .cse19 .cse2 .cse17)) (and .cse1 .cse4 .cse7 .cse18 .cse17 (not (= ULTIMATE.start_outgoing_~msg 1)) .cse2 .cse12 (not (= ULTIMATE.start_mail_~msg 1)) .cse14 (= 0 ULTIMATE.start_incoming__wrappee__AutoResponder_~client) .cse5 (not (= ULTIMATE.start_autoRespond_~msg 1)) .cse6 (= 0 |ULTIMATE.start_getEmailTo_#res|) .cse9 (not (= |ULTIMATE.start_getClientAutoResponse_#res| 0)) .cse3 (not (= ULTIMATE.start_getEmailFrom_~handle 1)) .cse0 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 1)) (not .cse11) .cse19 .cse15 (= 0 ULTIMATE.start_getClientAutoResponse_~handle) .cse13))) [2019-01-12 14:38:26,443 INFO L448 ceAbstractionStarter]: For program point L2528(lines 2528 2536) no Hoare annotation was computed. [2019-01-12 14:38:26,443 INFO L444 ceAbstractionStarter]: At program point L2561-1(lines 2544 2567) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse10 (not (= ULTIMATE.start_mail_~msg 2))) (.cse3 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse8 (= ULTIMATE.start_setClientId_~handle 3)) (.cse4 (= 2 ~rjh~0)) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse6 (not (= ULTIMATE.start_setEmailFrom_~handle 2))) (.cse7 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse9 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse1 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse2 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client))) (or (and .cse0 .cse1 .cse2 (and .cse3 (and .cse4 (= 2 ~__ste_email_to0~0) .cse5 .cse6 .cse7 .cse8 .cse9) .cse10)) (and .cse0 (let ((.cse11 (and .cse3 (and (and .cse8 .cse4 .cse5 .cse6 .cse7) .cse9)))) (or (and .cse11 (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse10) (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse11 .cse10))) .cse1 .cse2))) [2019-01-12 14:38:26,443 INFO L448 ceAbstractionStarter]: For program point L579-2(lines 579 585) no Hoare annotation was computed. [2019-01-12 14:38:26,443 INFO L444 ceAbstractionStarter]: At program point L2561(lines 2544 2567) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ~__ste_email_to0~0) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_createEmail_~to) (not (= ULTIMATE.start_outgoing_~msg 2)) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:38:26,443 INFO L444 ceAbstractionStarter]: At program point L579-3(lines 571 588) the Hoare annotation is: (let ((.cse3 (= 2 ~rjh~0)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse0 (= ULTIMATE.start_setClientId_~handle 3)) (.cse1 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse2 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (and (not (= ULTIMATE.start_getEmailTo_~handle 2)) (and (and (= 0 ~__ste_client_forwardReceiver1~0) (and .cse0 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle))) .cse1 .cse2)) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse3 (= 2 ULTIMATE.start_incoming_~client) .cse4) (and (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3)) (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client) (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client) (and (and (and .cse3 .cse4 (and .cse0 .cse1)) .cse2) (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg))))) [2019-01-12 14:38:26,444 INFO L448 ceAbstractionStarter]: For program point L2066(lines 2066 2082) no Hoare annotation was computed. [2019-01-12 14:38:26,444 INFO L448 ceAbstractionStarter]: For program point L2066-1(lines 2066 2082) no Hoare annotation was computed. [2019-01-12 14:38:26,444 INFO L444 ceAbstractionStarter]: At program point L1340(lines 1330 1440) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:38:26,444 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 14:38:26,444 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2019-01-12 14:38:26,444 INFO L448 ceAbstractionStarter]: For program point L945(lines 945 953) no Hoare annotation was computed. [2019-01-12 14:38:26,444 INFO L448 ceAbstractionStarter]: For program point L945-2(lines 945 953) no Hoare annotation was computed. [2019-01-12 14:38:26,444 INFO L448 ceAbstractionStarter]: For program point L945-4(lines 945 953) no Hoare annotation was computed. [2019-01-12 14:38:26,444 INFO L448 ceAbstractionStarter]: For program point L2531(lines 2531 2535) no Hoare annotation was computed. [2019-01-12 14:38:26,445 INFO L444 ceAbstractionStarter]: At program point L2531-2(lines 1 2587) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:38:26,445 INFO L448 ceAbstractionStarter]: For program point L1309(lines 1309 1313) no Hoare annotation was computed. [2019-01-12 14:38:26,445 INFO L444 ceAbstractionStarter]: At program point L1409(lines 1399 1434) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:38:26,445 INFO L444 ceAbstractionStarter]: At program point L1376(lines 1363 1437) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:38:26,445 INFO L448 ceAbstractionStarter]: For program point L2070(lines 2070 2081) no Hoare annotation was computed. [2019-01-12 14:38:26,445 INFO L448 ceAbstractionStarter]: For program point L2070-1(lines 2070 2081) no Hoare annotation was computed. [2019-01-12 14:38:26,445 INFO L448 ceAbstractionStarter]: For program point L948(lines 948 952) no Hoare annotation was computed. [2019-01-12 14:38:26,445 INFO L444 ceAbstractionStarter]: At program point L948-2(lines 941 956) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 2 ULTIMATE.start_createEmail_~to) (not (= ~__ste_email_to0~0 1)) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:38:26,445 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2019-01-12 14:38:26,445 INFO L448 ceAbstractionStarter]: For program point L948-3(lines 948 952) no Hoare annotation was computed. [2019-01-12 14:38:26,446 INFO L444 ceAbstractionStarter]: At program point L948-5(lines 941 956) the Hoare annotation is: (and (= 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) (not (= ULTIMATE.start_outgoing_~msg 2)) (= 2 ULTIMATE.start_setEmailTo_~value) (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:38:26,446 INFO L448 ceAbstractionStarter]: For program point L948-6(lines 948 952) no Hoare annotation was computed. [2019-01-12 14:38:26,446 INFO L444 ceAbstractionStarter]: At program point L948-8(lines 941 956) the Hoare annotation is: (let ((.cse4 (= ULTIMATE.start_setClientId_~handle 3)) (.cse6 (= 1 |ULTIMATE.start_createEmail_#res|))) (let ((.cse1 (= 2 ~__ste_email_to0~0)) (.cse12 (and .cse4 .cse6)) (.cse13 (= ULTIMATE.start_setEmailFrom_~handle ULTIMATE.start_outgoing_~msg)) (.cse8 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse9 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse17 (not (= ULTIMATE.start_setEmailTo_~handle 2))) (.cse15 (not (= ULTIMATE.start_autoRespond_~msg 2))) (.cse14 (not (= ULTIMATE.start_mail_~msg 2))) (.cse11 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse3 (= 1 ULTIMATE.start_outgoing_~msg)) (.cse5 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse0 (= 2 ~rjh~0)) (.cse2 (= 2 ULTIMATE.start_createEmail_~to)) (.cse7 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse10 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client))) (or (and .cse0 .cse1 .cse2 (and (and .cse3 .cse4 (= 0 ~__ste_client_forwardReceiver1~0) .cse5) .cse6 .cse7)) (and .cse8 .cse9 .cse10 (and (and .cse11 (and (and .cse12 .cse0 .cse1 .cse2) .cse7)) .cse13 .cse14)) (and .cse8 .cse9 .cse10 (let ((.cse16 (and .cse11 (and (and (and .cse0 (and .cse12 .cse13) .cse2) .cse7) (not (= ULTIMATE.start_outgoing_~msg 1))) .cse14))) (or (and .cse15 .cse16) (and .cse17 .cse16)))) (and .cse8 .cse9 (let ((.cse18 (and .cse11 (and (and (and (and .cse3 .cse4 .cse5) .cse6) .cse0 .cse2) .cse7)))) (or (and .cse17 .cse14 .cse18) (and .cse15 .cse14 .cse18))) .cse10)))) [2019-01-12 14:38:26,446 INFO L448 ceAbstractionStarter]: For program point L2501-1(lines 2501 2517) no Hoare annotation was computed. [2019-01-12 14:38:26,446 INFO L444 ceAbstractionStarter]: At program point L1444(lines 1296 1445) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:38:26,446 INFO L448 ceAbstractionStarter]: For program point L2501(lines 2501 2517) no Hoare annotation was computed. [2019-01-12 14:38:26,446 INFO L448 ceAbstractionStarter]: For program point L1345(lines 1345 1349) no Hoare annotation was computed. [2019-01-12 14:38:26,446 INFO L448 ceAbstractionStarter]: For program point L982(lines 982 990) no Hoare annotation was computed. [2019-01-12 14:38:26,447 INFO L448 ceAbstractionStarter]: For program point L982-2(lines 982 990) no Hoare annotation was computed. [2019-01-12 14:38:26,447 INFO L448 ceAbstractionStarter]: For program point L982-4(lines 982 990) no Hoare annotation was computed. [2019-01-12 14:38:26,447 INFO L448 ceAbstractionStarter]: For program point L982-6(lines 982 990) no Hoare annotation was computed. [2019-01-12 14:38:26,447 INFO L448 ceAbstractionStarter]: For program point L982-8(lines 982 990) no Hoare annotation was computed. [2019-01-12 14:38:26,447 INFO L444 ceAbstractionStarter]: At program point L1511(lines 1500 1514) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ~__ste_email_to0~0) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_createEmail_~to) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:38:26,447 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 14:38:26,447 INFO L448 ceAbstractionStarter]: For program point L818(lines 818 825) no Hoare annotation was computed. [2019-01-12 14:38:26,447 INFO L451 ceAbstractionStarter]: At program point L818-1(lines 818 825) the Hoare annotation is: true [2019-01-12 14:38:26,447 INFO L444 ceAbstractionStarter]: At program point L653(lines 648 656) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse9 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse10 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client)) (.cse1 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse5 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse3 (= ULTIMATE.start_setClientId_~handle 3)) (.cse7 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse4 (= 2 ~rjh~0)) (.cse6 (= 2 ULTIMATE.start_createEmail_~to)) (.cse8 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse2 (not (= ULTIMATE.start_mail_~msg 2)))) (or (and .cse0 (and .cse1 .cse2 (and .cse3 .cse4 (= 2 ~__ste_email_to0~0) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) .cse5 .cse6 .cse7 .cse8)) .cse9 .cse10) (and .cse0 .cse9 .cse10 (let ((.cse11 (and .cse1 (and (and (and .cse5 (and .cse3 .cse7)) .cse4 .cse6) .cse8) .cse2)) (.cse12 (not (= ULTIMATE.start_outgoing_~msg 2)))) (or (and .cse11 (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse12) (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse11 .cse12)))))) [2019-01-12 14:38:26,448 INFO L444 ceAbstractionStarter]: At program point L1479(lines 1454 1481) the Hoare annotation is: (let ((.cse0 (= 1 |ULTIMATE.start_isReadable_#res|)) (.cse1 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~0 1)) (.cse2 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse3 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse14 (not (= ULTIMATE.start_mail_~msg 2))) (.cse7 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse8 (= ULTIMATE.start_setClientId_~handle 3)) (.cse9 (= 2 ~rjh~0)) (.cse10 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse11 (= 2 ULTIMATE.start_createEmail_~to)) (.cse12 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse13 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse6 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse4 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4 (let ((.cse5 (and .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14))) (or (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse5 .cse6) (and (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse5 .cse6))))) (and .cse0 .cse1 (and .cse2 .cse3 (and .cse14 (and .cse7 (and .cse8 .cse9 (= 2 ~__ste_email_to0~0) .cse10 .cse11 .cse12 .cse13)) .cse6) .cse4)))) [2019-01-12 14:38:26,448 INFO L451 ceAbstractionStarter]: At program point L1479-1(lines 1454 1481) the Hoare annotation is: true [2019-01-12 14:38:26,448 INFO L448 ceAbstractionStarter]: For program point L125(lines 125 131) no Hoare annotation was computed. [2019-01-12 14:38:26,448 INFO L448 ceAbstractionStarter]: For program point L125-2(lines 125 131) no Hoare annotation was computed. [2019-01-12 14:38:26,448 INFO L448 ceAbstractionStarter]: For program point L2074(lines 2074 2080) no Hoare annotation was computed. [2019-01-12 14:38:26,448 INFO L448 ceAbstractionStarter]: For program point L2074-1(lines 2074 2080) no Hoare annotation was computed. [2019-01-12 14:38:26,448 INFO L448 ceAbstractionStarter]: For program point L1414(lines 1414 1418) no Hoare annotation was computed. [2019-01-12 14:38:26,448 INFO L448 ceAbstractionStarter]: For program point L1381(lines 1381 1385) no Hoare annotation was computed. [2019-01-12 14:38:26,448 INFO L444 ceAbstractionStarter]: At program point L1315(lines 1305 1442) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:38:26,448 INFO L444 ceAbstractionStarter]: At program point L93(lines 1 2587) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= 0 ~__ste_client_forwardReceiver1~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:38:26,449 INFO L448 ceAbstractionStarter]: For program point L985(lines 985 989) no Hoare annotation was computed. [2019-01-12 14:38:26,449 INFO L444 ceAbstractionStarter]: At program point L985-2(lines 978 993) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= ULTIMATE.start_setEmailTo_~handle 1) (= 2 ~__ste_email_to0~0) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) (= 2 ULTIMATE.start_createEmail_~to) (= 2 ULTIMATE.start_setEmailTo_~value) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:38:26,449 INFO L448 ceAbstractionStarter]: For program point L985-3(lines 985 989) no Hoare annotation was computed. [2019-01-12 14:38:26,449 INFO L444 ceAbstractionStarter]: At program point L985-5(lines 978 993) the Hoare annotation is: (let ((.cse1 (not (= ULTIMATE.start_setEmailTo_~handle 2))) (.cse6 (= 2 ~__ste_email_to0~0)) (.cse0 (not (= ULTIMATE.start_autoRespond_~msg 2))) (.cse3 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse2 (not (= ULTIMATE.start_mail_~msg 2))) (.cse12 (not (= ULTIMATE.start_getEmailFrom_~handle 2))) (.cse4 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse9 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~tmp~6 0))) (.cse10 (= ULTIMATE.start_setClientId_~handle 3)) (.cse5 (= 2 ~rjh~0)) (.cse18 (= 2 ULTIMATE.start_incoming_~client)) (.cse11 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse19 (= 2 |ULTIMATE.start_getEmailTo_#res|)) (.cse13 (= ULTIMATE.start_setEmailTo_~handle 1)) (.cse7 (= 2 ULTIMATE.start_createEmail_~to)) (.cse14 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse8 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse17 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse15 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client)) (.cse16 (not (= ULTIMATE.start_outgoing_~msg 2)))) (or (and .cse0 .cse1 .cse2 (and .cse3 .cse4 .cse5 .cse6 (not (= ULTIMATE.start_outgoing_~msg 1)) (not (= ULTIMATE.start_mail_~msg 1)) .cse7 .cse8 (= 0 ULTIMATE.start_incoming__wrappee__AutoResponder_~client) .cse9 (not (= ULTIMATE.start_autoRespond_~msg 1)) .cse10 (= 0 |ULTIMATE.start_getEmailTo_#res|) .cse11 (not (= |ULTIMATE.start_getClientAutoResponse_#res| 0)) .cse12 (not (= ULTIMATE.start_getEmailFrom_~handle 1)) (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 1)) (not .cse13) (= 0 ULTIMATE.start_getClientAutoResponse_~handle) .cse14) .cse15 .cse16) (and .cse0 .cse1 .cse17 .cse2 (and .cse3 .cse12 (and .cse4 .cse9 .cse10 .cse5 .cse18 .cse6 .cse11 .cse19 .cse7 .cse8 .cse14)) .cse15 .cse16) (and .cse0 (and .cse3 .cse2 .cse12 (and .cse4 .cse9 .cse10 .cse5 .cse18 .cse11 .cse19 .cse13 .cse7 .cse14 .cse8)) .cse17 .cse15 .cse16))) [2019-01-12 14:38:26,449 INFO L448 ceAbstractionStarter]: For program point L985-6(lines 985 989) no Hoare annotation was computed. [2019-01-12 14:38:26,449 INFO L444 ceAbstractionStarter]: At program point L985-8(lines 978 993) the Hoare annotation is: (let ((.cse10 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse11 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse0 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse1 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse2 (= ULTIMATE.start_setClientId_~handle 3)) (.cse3 (= 2 ~rjh~0)) (.cse5 (= 2 ULTIMATE.start_createEmail_~to)) (.cse4 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse6 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse7 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse8 (not (= ULTIMATE.start_mail_~msg 2))) (.cse9 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse12 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client))) (or (and (and .cse0 (and .cse1 .cse2 .cse3 (= 2 ~__ste_email_to0~0) .cse4 .cse5 .cse6 .cse7) .cse8 .cse9) .cse10 .cse11 .cse12) (and .cse10 .cse11 (let ((.cse13 (and .cse0 (and .cse1 .cse2 .cse3 .cse5 .cse4 .cse6 .cse7) .cse8 .cse9))) (or (and (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse13) (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse13))) .cse12))) [2019-01-12 14:38:26,449 INFO L448 ceAbstractionStarter]: For program point L985-9(lines 985 989) no Hoare annotation was computed. [2019-01-12 14:38:26,450 INFO L444 ceAbstractionStarter]: At program point L985-11(lines 978 993) the Hoare annotation is: (let ((.cse2 (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle))) (.cse0 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse3 (= 2 ~rjh~0)) (.cse4 (= 2 ULTIMATE.start_createEmail_~to)) (.cse1 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and (and (not (= ULTIMATE.start_getEmailTo_~handle 2)) (and .cse0 .cse1 (and .cse2 (= 0 ~__ste_client_forwardReceiver1~0)))) (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse3 (= 2 ULTIMATE.start_incoming_~client) .cse4) (and (and (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~tmp~6 0)) (and (and (and .cse2 .cse0) .cse3 .cse4) .cse1)) (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3)) (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client) (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client)))) [2019-01-12 14:38:26,450 INFO L448 ceAbstractionStarter]: For program point L985-12(lines 985 989) no Hoare annotation was computed. [2019-01-12 14:38:26,450 INFO L444 ceAbstractionStarter]: At program point L985-14(lines 978 993) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client) (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:38:26,450 INFO L448 ceAbstractionStarter]: For program point L2505-1(lines 2505 2516) no Hoare annotation was computed. [2019-01-12 14:38:26,450 INFO L448 ceAbstractionStarter]: For program point L2505(lines 2505 2516) no Hoare annotation was computed. [2019-01-12 14:38:26,450 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 14:38:26,450 INFO L448 ceAbstractionStarter]: For program point L2572(lines 2572 2584) no Hoare annotation was computed. [2019-01-12 14:38:26,450 INFO L448 ceAbstractionStarter]: For program point L2572-2(lines 2572 2584) no Hoare annotation was computed. [2019-01-12 14:38:26,450 INFO L448 ceAbstractionStarter]: For program point L2572-4(lines 2572 2584) no Hoare annotation was computed. [2019-01-12 14:38:26,451 INFO L444 ceAbstractionStarter]: At program point L558(lines 1 2587) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse1 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse2 (= 2 ~rjh~0)) (.cse3 (= 2 ~__ste_email_to0~0)) (.cse4 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse5 (= 2 ULTIMATE.start_setEmailTo_~value)) (.cse6 (not (= ULTIMATE.start_mail_~msg 2))) (.cse7 (= 2 ULTIMATE.start_createEmail_~to)) (.cse8 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse9 (= ULTIMATE.start_setClientId_~handle 3)) (.cse10 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse11 (= ULTIMATE.start_setEmailTo_~handle 1)) (.cse12 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse13 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= 2 ULTIMATE.start_incoming_~client) .cse10 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse11 .cse12 .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ULTIMATE.start_outgoing_~msg 1)) .cse6 .cse7 (not (= ULTIMATE.start_mail_~msg 1)) .cse8 (= 0 ULTIMATE.start_incoming__wrappee__AutoResponder_~client) .cse9 (= 0 |ULTIMATE.start_getEmailTo_#res|) .cse10 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 1)) .cse11 .cse12 .cse13))) [2019-01-12 14:38:26,451 INFO L444 ceAbstractionStarter]: At program point L558-1(lines 1 2587) the Hoare annotation is: (let ((.cse16 (= ULTIMATE.start_setClientId_~handle 3)) (.cse17 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse12 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse8 (= 2 ~rjh~0)) (.cse15 (= 2 ULTIMATE.start_createEmail_~to)) (.cse13 (= 1 ULTIMATE.start_createEmail_~msg~0))) (let ((.cse6 (and (and (and (and .cse16 .cse17) .cse12) .cse8 .cse15) .cse13)) (.cse0 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse1 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse5 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse3 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse10 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse11 (and .cse16 (not (= ~rjh~0 1)) (not (= |ULTIMATE.start_getEmailTo_#res| 1)) (not (= ULTIMATE.start_incoming_~client 1)) .cse17 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~client 1)))) (.cse7 (= 2 |ULTIMATE.start_getEmailTo_#res|)) (.cse9 (= 2 ULTIMATE.start_incoming_~client)) (.cse14 (= 2 ~__ste_email_to0~0)) (.cse4 (not (= ULTIMATE.start_mail_~msg 2)))) (or (and .cse0 .cse1 (let ((.cse2 (and .cse3 .cse4 .cse5 .cse6))) (or (and (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse2) (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse2)))) (and (and (and .cse6 (not (= ULTIMATE.start_outgoing_~msg 1)) (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 1))) (not (= ULTIMATE.start_mail_~msg 1))) .cse0 .cse1) (and .cse7 .cse8 .cse9 (and .cse10 (and (and .cse11 (= 0 ~__ste_client_forwardReceiver1~0)) .cse12 .cse13)) .cse14 .cse15) (and .cse0 .cse1 .cse5 (and .cse3 (and (and (and .cse10 (and .cse11 .cse12)) .cse7 .cse8 .cse9 .cse14 .cse15) .cse13) .cse4))))) [2019-01-12 14:38:26,451 INFO L444 ceAbstractionStarter]: At program point L1351(lines 1341 1439) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:38:26,451 INFO L448 ceAbstractionStarter]: For program point L889(lines 889 900) no Hoare annotation was computed. [2019-01-12 14:38:26,451 INFO L448 ceAbstractionStarter]: For program point L889-1(lines 889 900) no Hoare annotation was computed. [2019-01-12 14:38:26,451 INFO L444 ceAbstractionStarter]: At program point L2079(lines 2062 2085) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse1 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse2 (= 2 ~rjh~0)) (.cse3 (= 2 ~__ste_email_to0~0)) (.cse4 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse5 (= 2 ULTIMATE.start_setEmailTo_~value)) (.cse6 (not (= ULTIMATE.start_mail_~msg 2))) (.cse7 (= 2 ULTIMATE.start_createEmail_~to)) (.cse8 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse9 (= ULTIMATE.start_setClientId_~handle 3)) (.cse10 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse11 (= ULTIMATE.start_setEmailTo_~handle 1)) (.cse12 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse13 (= 1 ULTIMATE.start_createEmail_~msg~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (not (= ULTIMATE.start_outgoing_~msg 1)) .cse6 .cse7 (not (= ULTIMATE.start_mail_~msg 1)) .cse8 (= 0 ULTIMATE.start_incoming__wrappee__AutoResponder_~client) .cse9 (= 0 |ULTIMATE.start_getEmailTo_#res|) .cse10 (not (= |ULTIMATE.start_getClientAutoResponse_#res| 0)) (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 1)) .cse11 .cse12 (= 0 ULTIMATE.start_getClientAutoResponse_~handle) .cse13) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client) .cse8 .cse9 (= 2 ULTIMATE.start_incoming_~client) .cse10 (= 2 |ULTIMATE.start_getEmailTo_#res|) .cse11 .cse12 .cse13))) [2019-01-12 14:38:26,452 INFO L444 ceAbstractionStarter]: At program point L2079-1(lines 2062 2085) the Hoare annotation is: (let ((.cse5 (and (= ULTIMATE.start_setClientId_~handle 3) (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle))) (.cse6 (= 1 |ULTIMATE.start_createEmail_#res|))) (let ((.cse17 (and .cse5 .cse6)) (.cse9 (= 2 ~rjh~0)) (.cse12 (= 2 ULTIMATE.start_createEmail_~to)) (.cse7 (= 1 ULTIMATE.start_createEmail_~msg~0))) (let ((.cse3 (and (and .cse17 .cse9 .cse12) .cse7)) (.cse16 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse4 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse8 (= 2 |ULTIMATE.start_getEmailTo_#res|)) (.cse10 (= 2 ULTIMATE.start_incoming_~client)) (.cse11 (= 2 ~__ste_email_to0~0)) (.cse13 (not (= ULTIMATE.start_mail_~msg 2))) (.cse14 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse0 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse1 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse2 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client))) (or (and .cse0 .cse1 .cse2 (and (not (= ULTIMATE.start_outgoing_~msg 1)) (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 1)) (not (= ULTIMATE.start_mail_~msg 1)) .cse3)) (and (and .cse4 (and (and (= 0 ~__ste_client_forwardReceiver1~0) .cse5) .cse6 .cse7)) .cse8 .cse9 .cse10 .cse11 .cse12) (and .cse0 .cse1 (let ((.cse15 (and .cse16 .cse3))) (or (and (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse13 .cse14 .cse15) (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse13 .cse14 .cse15))) .cse2) (and (and (and .cse16 (and (and (and .cse4 .cse17) .cse8 .cse9 .cse10 .cse11 .cse12) .cse7)) .cse13 .cse14) .cse0 .cse1 .cse2))))) [2019-01-12 14:38:26,452 INFO L448 ceAbstractionStarter]: For program point L2575(lines 2575 2583) no Hoare annotation was computed. [2019-01-12 14:38:26,452 INFO L448 ceAbstractionStarter]: For program point L2509-1(lines 2509 2515) no Hoare annotation was computed. [2019-01-12 14:38:26,452 INFO L448 ceAbstractionStarter]: For program point L2575-2(lines 2575 2583) no Hoare annotation was computed. [2019-01-12 14:38:26,452 INFO L448 ceAbstractionStarter]: For program point L2509(lines 2509 2515) no Hoare annotation was computed. [2019-01-12 14:38:26,452 INFO L448 ceAbstractionStarter]: For program point L2575-4(lines 2575 2583) no Hoare annotation was computed. [2019-01-12 14:38:26,452 INFO L448 ceAbstractionStarter]: For program point L1320(lines 1320 1327) no Hoare annotation was computed. [2019-01-12 14:38:26,452 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 14:38:26,452 INFO L444 ceAbstractionStarter]: At program point L1420(lines 1410 1433) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:38:26,453 INFO L444 ceAbstractionStarter]: At program point L1387(lines 1377 1436) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:38:26,453 INFO L451 ceAbstractionStarter]: At program point L826(lines 808 828) the Hoare annotation is: true [2019-01-12 14:38:26,453 INFO L444 ceAbstractionStarter]: At program point L1487(lines 1482 1490) the Hoare annotation is: (let ((.cse0 (= 1 |ULTIMATE.start_isReadable_#res|)) (.cse4 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse5 (not (= ULTIMATE.start_getEmailTo_~handle 2))) (.cse6 (= ULTIMATE.start_setClientId_~handle 3)) (.cse7 (= 2 ~rjh~0)) (.cse9 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse8 (= 2 ULTIMATE.start_createEmail_~to)) (.cse10 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse11 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse12 (not (= ULTIMATE.start_mail_~msg 2))) (.cse13 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse1 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse2 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse14 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client))) (or (and .cse0 (and .cse1 .cse2 (let ((.cse3 (and .cse4 (and .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11) .cse12 .cse13))) (or (and (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse3) (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse3))) .cse14)) (and .cse0 (and (and .cse4 (and .cse5 .cse6 .cse7 (= 2 ~__ste_email_to0~0) .cse9 .cse8 .cse10 .cse11) .cse12 .cse13) .cse1 .cse2 .cse14)))) [2019-01-12 14:38:26,453 INFO L444 ceAbstractionStarter]: At program point L1487-1(lines 1482 1490) the Hoare annotation is: (let ((.cse0 (= 1 |ULTIMATE.start_isReadable_#res|)) (.cse1 (= ULTIMATE.start___utac_acc__DecryptForward_spec__1_~tmp~0 1)) (.cse2 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse3 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse14 (not (= ULTIMATE.start_mail_~msg 2))) (.cse7 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse8 (= ULTIMATE.start_setClientId_~handle 3)) (.cse9 (= 2 ~rjh~0)) (.cse10 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse11 (= 2 ULTIMATE.start_createEmail_~to)) (.cse12 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse13 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse6 (not (= ULTIMATE.start_outgoing_~msg 2))) (.cse4 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client))) (or (and .cse0 .cse1 (and .cse2 .cse3 .cse4 (let ((.cse5 (and .cse7 (and .cse8 .cse9 .cse10 .cse11 .cse12 .cse13) .cse14))) (or (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse5 .cse6) (and (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse5 .cse6))))) (and .cse0 .cse1 (and .cse2 .cse3 (and .cse14 (and .cse7 (and .cse8 .cse9 (= 2 ~__ste_email_to0~0) .cse10 .cse11 .cse12 .cse13)) .cse6) .cse4)))) [2019-01-12 14:38:26,453 INFO L444 ceAbstractionStarter]: At program point L1487-2(lines 1482 1490) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 1 |ULTIMATE.start_isReadable_#res|) (= 2 ~rjh~0) (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client) (= 1 |ULTIMATE.start_createEmail_#res|) (= 2 ULTIMATE.start_createEmail_~to) (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client) (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle) (= 1 ULTIMATE.start_createEmail_~msg~0)) [2019-01-12 14:38:26,453 INFO L451 ceAbstractionStarter]: At program point L1487-3(lines 1482 1490) the Hoare annotation is: true [2019-01-12 14:38:26,453 INFO L448 ceAbstractionStarter]: For program point L926(lines 926 937) no Hoare annotation was computed. [2019-01-12 14:38:26,453 INFO L448 ceAbstractionStarter]: For program point L893(lines 893 899) no Hoare annotation was computed. [2019-01-12 14:38:26,454 INFO L448 ceAbstractionStarter]: For program point L926-1(lines 926 937) no Hoare annotation was computed. [2019-01-12 14:38:26,454 INFO L448 ceAbstractionStarter]: For program point L926-2(lines 926 937) no Hoare annotation was computed. [2019-01-12 14:38:26,454 INFO L448 ceAbstractionStarter]: For program point L893-1(lines 893 899) no Hoare annotation was computed. [2019-01-12 14:38:26,454 INFO L448 ceAbstractionStarter]: For program point L926-3(lines 926 937) no Hoare annotation was computed. [2019-01-12 14:38:26,454 INFO L444 ceAbstractionStarter]: At program point L662(lines 657 665) the Hoare annotation is: (let ((.cse0 (not (= ULTIMATE.start_getClientForwardReceiver_~handle 3))) (.cse9 (= ULTIMATE.start_incoming_~client ULTIMATE.start_incoming__wrappee__AutoResponder_~client)) (.cse10 (= ULTIMATE.start_getClientAutoResponse_~handle ULTIMATE.start_incoming_~client)) (.cse1 (not (= ULTIMATE.start_incoming__wrappee__AutoResponder_~msg 2))) (.cse5 (= 1 |ULTIMATE.start_createEmail_#res|)) (.cse3 (= ULTIMATE.start_setClientId_~handle 3)) (.cse7 (= ULTIMATE.start_outgoing_~msg ULTIMATE.start_setEmailFrom_~handle)) (.cse4 (= 2 ~rjh~0)) (.cse6 (= 2 ULTIMATE.start_createEmail_~to)) (.cse8 (= 1 ULTIMATE.start_createEmail_~msg~0)) (.cse2 (not (= ULTIMATE.start_mail_~msg 2)))) (or (and .cse0 (and .cse1 .cse2 (and .cse3 .cse4 (= 2 ~__ste_email_to0~0) (not (= ULTIMATE.start_setEmailFrom_~handle 2)) .cse5 .cse6 .cse7 .cse8)) .cse9 .cse10) (and .cse0 .cse9 .cse10 (let ((.cse11 (and .cse1 (and (and (and .cse5 (and .cse3 .cse7)) .cse4 .cse6) .cse8) .cse2)) (.cse12 (not (= ULTIMATE.start_outgoing_~msg 2)))) (or (and .cse11 (not (= ULTIMATE.start_setEmailTo_~handle 2)) .cse12) (and (not (= ULTIMATE.start_autoRespond_~msg 2)) .cse11 .cse12)))))) [2019-01-12 14:38:26,454 INFO L448 ceAbstractionStarter]: For program point L2578(lines 2578 2582) no Hoare annotation was computed. [2019-01-12 14:38:26,454 INFO L444 ceAbstractionStarter]: At program point L2578-2(lines 1 2587) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= 0 ~__ste_client_forwardReceiver1~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:38:26,454 INFO L448 ceAbstractionStarter]: For program point L2578-3(lines 2578 2582) no Hoare annotation was computed. [2019-01-12 14:38:26,454 INFO L448 ceAbstractionStarter]: For program point L2578-6(lines 2578 2582) no Hoare annotation was computed. [2019-01-12 14:38:26,455 INFO L444 ceAbstractionStarter]: At program point L2578-5(lines 1 2587) 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))) [2019-01-12 14:38:26,455 INFO L448 ceAbstractionStarter]: For program point L1356(lines 1356 1360) no Hoare annotation was computed. [2019-01-12 14:38:26,455 INFO L444 ceAbstractionStarter]: At program point L2578-8(lines 1 2587) the Hoare annotation is: (and (= ULTIMATE.start_setClientId_~handle 3) (= 2 ~rjh~0) (= 0 ~__ste_client_forwardReceiver1~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:38:26,455 INFO L444 ceAbstractionStarter]: At program point L101(lines 96 104) the Hoare annotation is: (and (not (= ~rjh~0 1)) (= 0 ~__ste_client_forwardReceiver1~0) (not (= ~__ste_email_to0~0 1))) [2019-01-12 14:38:26,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 02:38:26 BoogieIcfgContainer [2019-01-12 14:38:26,574 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 14:38:26,574 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 14:38:26,575 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 14:38:26,575 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 14:38:26,575 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 02:36:26" (3/4) ... [2019-01-12 14:38:26,584 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 14:38:26,624 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 82 nodes and edges [2019-01-12 14:38:26,626 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 45 nodes and edges [2019-01-12 14:38:26,629 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-01-12 14:38:26,631 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 14:38:26,672 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((handle == 3 && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && !(handle == 2)) && 1 == \result) && 2 == to) && 2 == value) && 1 == msg [2019-01-12 14:38:26,672 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == 3 && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && !(handle == 2)) && 1 == \result) && 2 == to) && !(msg == 2)) && 2 == value) && 1 == msg [2019-01-12 14:38:26,673 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((handle == 3 && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && !(msg == 2)) && 2 == value) && msg == handle) && 1 == msg [2019-01-12 14:38:26,673 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(handle == 2) && handle == 3) && 2 == rjh) && 0 == \result) && 2 == __ste_email_to0) && 1 == \result) && !(msg == 2)) && 2 == value) && !(msg == 1)) && handle == 1) && !(msg == 2)) && 2 == to) && !(msg == 1)) && msg == handle) && 1 == msg) || ((((((((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && !(msg == 2)) && 2 == value) && 2 == \result) && handle == 1) && !(msg == 2)) && 2 == to) && msg == handle) && 1 == msg) [2019-01-12 14:38:26,673 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((!(msg == 2) && !(handle == 2)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 2)) && 2 == value) && !(msg == 2)) && 2 == to) && msg == handle) && handle == 3) && 2 == client) && 1 == \result) && 2 == \result) && handle == 1) && client == client) && 1 == msg) || ((((((((((((((((((!(msg == 2) && !(handle == 2)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 2)) && 2 == value) && !(msg == 1)) && !(msg == 2)) && 2 == to) && !(msg == 1)) && msg == handle) && 0 == client) && handle == 3) && 0 == \result) && 1 == \result) && !(msg == 1)) && handle == 1) && client == client) && 1 == msg) [2019-01-12 14:38:26,674 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((!(msg == 2) && !(handle == 2)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 2)) && 2 == value) && !(msg == 1)) && !(msg == 2)) && 2 == to) && !(msg == 1)) && msg == handle) && 0 == client) && handle == 3) && 0 == \result) && 1 == \result) && !(\result == 0)) && !(msg == 1)) && handle == 1) && client == client) && 0 == handle) && 1 == msg) || ((((((((((((((((!(msg == 2) && !(handle == 2)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 2)) && 2 == value) && !(msg == 2)) && 2 == to) && handle == client) && msg == handle) && handle == 3) && 2 == client) && 1 == \result) && 2 == \result) && handle == 1) && client == client) && 1 == msg) [2019-01-12 14:38:26,674 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(msg == 2) && ((!(msg == 2) && !(msg == 2)) && !(handle == 2)) && (((((((((!(handle == 2) && !(tmp == 0)) && handle == 3) && 2 == rjh) && 2 == client) && 1 == \result) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) && msg == handle) && client == client) && handle == client) && !(msg == 2)) || ((client == client && handle == client) && (((!(msg == 2) && ((((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 2 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(handle == 2)) && !(msg == 2)) && !(msg == 2))) || (((((((((((((((((((((((((!(msg == 2) && !(handle == 2)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 2)) && !(msg == 1)) && !(msg == 2)) && 2 == to) && !(msg == 1)) && msg == handle) && 0 == client) && !(tmp == 0)) && !(msg == 1)) && handle == 3) && 0 == \result) && 1 == \result) && !(\result == 0)) && !(handle == 2)) && !(handle == 1)) && !(msg == 2)) && !(msg == 1)) && !(handle == 1)) && !(handle == 2)) && client == client) && 0 == handle) && 1 == msg) [2019-01-12 14:38:26,674 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(msg == 2) && !(handle == 3)) && client == client) && !(msg == 2)) && handle == client) && (!(msg == 2) && ((((((((!(tmp == 0) && !(handle == 2)) && handle == 3) && 2 == rjh) && !(handle == 2)) && 1 == \result) && handle == 1) && 2 == to) && msg == handle) && 1 == msg) && !(handle == 2)) || (((((((!(msg == 2) && ((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(handle == 2)) && !(msg == 2)) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) [2019-01-12 14:38:26,680 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(handle == 3) && (!(msg == 2) && !(msg == 2)) && ((((((handle == 3 && 2 == rjh) && 2 == __ste_email_to0) && !(handle == 2)) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && client == client) && handle == client) || (((!(handle == 3) && client == client) && handle == client) && (((((!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(handle == 2)) && !(msg == 2)) || ((!(msg == 2) && (!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) [2019-01-12 14:38:26,681 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((!(msg == 2) && !(handle == 2)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 2)) && 2 == value) && !(msg == 1)) && !(msg == 2)) && 2 == to) && !(msg == 1)) && msg == handle) && 0 == client) && !(tmp == 0)) && !(msg == 1)) && handle == 3) && 0 == \result) && 1 == \result) && !(\result == 0)) && !(handle == 2)) && !(handle == 1)) && !(msg == 2)) && !(msg == 1)) && handle == 1) && client == client) && 0 == handle) && 1 == msg) || (((((((!(msg == 2) && !(msg == 2)) && client == client) && !(msg == 2)) && (((((((((((!(handle == 2) && !(tmp == 0)) && handle == 3) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 2 == value) && 2 == \result) && handle == 1) && 2 == to) && msg == handle) && 1 == msg) && handle == client) && !(handle == 2)) && !(msg == 2)) [2019-01-12 14:38:26,681 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(msg == 2) && ((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) || (((!(handle == 3) && client == client) && ((!(handle == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || (!(msg == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) && handle == client) [2019-01-12 14:38:26,681 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(handle == 3) && (!(msg == 2) && !(msg == 2)) && ((((((handle == 3 && 2 == rjh) && 2 == __ste_email_to0) && !(handle == 2)) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && client == client) && handle == client) || (((!(handle == 3) && client == client) && handle == client) && (((((!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(handle == 2)) && !(msg == 2)) || ((!(msg == 2) && (!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) [2019-01-12 14:38:26,681 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(msg == 2) && !(handle == 2)) && !(msg == 2)) && (((((((((((((((((((!(msg == 2) && !(handle == 2)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 1)) && !(msg == 1)) && 2 == to) && msg == handle) && 0 == client) && !(tmp == 0)) && !(msg == 1)) && handle == 3) && 0 == \result) && 1 == \result) && !(\result == 0)) && !(handle == 2)) && !(handle == 1)) && !(msg == 1)) && !(handle == 1)) && 0 == handle) && 1 == msg) && handle == client) && !(msg == 2)) || ((((((!(msg == 2) && !(handle == 2)) && client == client) && !(msg == 2)) && (!(msg == 2) && !(handle == 2)) && (((((((((!(handle == 2) && !(tmp == 0)) && handle == 3) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 2 == \result) && 2 == to) && msg == handle) && 1 == msg) && handle == client) && !(msg == 2))) || ((((!(msg == 2) && ((!(msg == 2) && !(msg == 2)) && !(handle == 2)) && (((((((((!(handle == 2) && !(tmp == 0)) && handle == 3) && 2 == rjh) && 2 == client) && 1 == \result) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) && msg == handle) && client == client) && handle == client) && !(msg == 2)) [2019-01-12 14:38:26,682 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(handle == 3) && (!(msg == 2) && !(msg == 2)) && ((((((handle == 3 && 2 == rjh) && 2 == __ste_email_to0) && !(handle == 2)) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && client == client) && handle == client) || (((!(handle == 3) && client == client) && handle == client) && (((((!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(handle == 2)) && !(msg == 2)) || ((!(msg == 2) && (!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) [2019-01-12 14:38:26,682 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1 == \result && ((!(handle == 3) && client == client) && ((!(handle == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || (!(msg == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) && handle == client) || (1 == \result && (((((!(msg == 2) && ((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) [2019-01-12 14:38:26,682 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(handle == 3) && (!(msg == 2) && !(msg == 2)) && ((((((handle == 3 && 2 == rjh) && 2 == __ste_email_to0) && !(handle == 2)) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && client == client) && handle == client) || (((!(handle == 3) && client == client) && handle == client) && (((((!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(handle == 2)) && !(msg == 2)) || ((!(msg == 2) && (!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) [2019-01-12 14:38:26,682 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == \result && tmp == 1) && (((((!(msg == 2) && ((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) || ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && ((!(handle == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || (!(msg == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) && handle == client) [2019-01-12 14:38:26,683 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!(handle == 3) && client == client) && handle == client) && (!(msg == 2) && (((((2 == rjh && 2 == __ste_email_to0) && 2 == to) && !(handle == 2)) && 1 == \result) && handle == 3) && 1 == msg) && !(msg == 2)) || (((!(handle == 3) && ((((!(msg == 2) && ((((handle == 3 && 2 == rjh) && 2 == to) && !(handle == 2)) && 1 == \result) && 1 == msg) && !(handle == 2)) && !(msg == 2)) || ((!(msg == 2) && !(msg == 2) && ((((handle == 3 && 2 == rjh) && 2 == to) && !(handle == 2)) && 1 == \result) && 1 == msg) && !(msg == 2)))) && client == client) && handle == client) [2019-01-12 14:38:26,683 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == \result && tmp == 1) && (((((!(msg == 2) && ((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) || ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && ((!(handle == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || (!(msg == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) && handle == client) [2019-01-12 14:38:26,683 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((2 == rjh && 2 == __ste_email_to0) && 2 == to) && ((((1 == msg && handle == 3) && 0 == __ste_client_forwardReceiver1) && msg == handle) && 1 == \result) && 1 == msg) || (((!(handle == 3) && client == client) && handle == client) && ((!(msg == 2) && ((((handle == 3 && 1 == \result) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) && handle == msg) && !(msg == 2))) || (((!(handle == 3) && client == client) && handle == client) && ((!(msg == 2) && (!(msg == 2) && (((2 == rjh && (handle == 3 && 1 == \result) && handle == msg) && 2 == to) && 1 == msg) && !(msg == 1)) && !(msg == 2)) || (!(handle == 2) && (!(msg == 2) && (((2 == rjh && (handle == 3 && 1 == \result) && handle == msg) && 2 == to) && 1 == msg) && !(msg == 1)) && !(msg == 2))))) || (((!(handle == 3) && client == client) && (((!(handle == 2) && !(msg == 2)) && !(msg == 2) && (((((1 == msg && handle == 3) && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) || ((!(msg == 2) && !(msg == 2)) && !(msg == 2) && (((((1 == msg && handle == 3) && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg))) && handle == client) [2019-01-12 14:38:26,684 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == \result && tmp == 1) && (((((!(msg == 2) && ((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) || ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && ((!(handle == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || (!(msg == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) && handle == client) [2019-01-12 14:38:26,684 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(msg == 2) && !(msg == 2)) && ((((2 == \result && 2 == rjh) && !(handle == 2) && 1 == \result && ((handle == 3 && !(rjh == 1)) && !(\result == 1)) && msg == handle) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) || (((!(handle == 3) && !(msg == 1) && !(msg == 2) && !(msg == 1) && ((2 == rjh && 2 == to) && 1 == \result && handle == 3 && msg == handle) && 1 == msg) && client == client) && handle == client)) || ((((2 == \result && 2 == rjh) && !(handle == 2) && (((((handle == 3 && !(rjh == 1)) && !(\result == 1)) && msg == handle) && 0 == __ste_client_forwardReceiver1) && 1 == \result) && 1 == msg) && 2 == __ste_email_to0) && 2 == to)) || (((((!(msg == 2) && ((!(msg == 2) && ((2 == rjh && 2 == to) && 1 == \result && handle == 3 && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || ((((!(msg == 2) && ((2 == rjh && 2 == to) && 1 == \result && handle == 3 && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) && !(handle == 2))) && !(handle == 3)) && client == client) && handle == client) [2019-01-12 14:38:26,684 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && handle == client) && (((!(msg == 2) && (!(msg == 2) && ((((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || ((!(handle == 2) && (!(msg == 2) && ((((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) || ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && (!(msg == 2) && !(msg == 2) && (((((handle == 3 && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && handle == client) [2019-01-12 14:38:26,685 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(handle == 3) && client == client) && ((!(handle == 2) && ((!(msg == 2) && !(msg == 2)) && !(msg == 2)) && ((((handle == 3 && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) || (!(msg == 2) && ((!(msg == 2) && !(msg == 2)) && !(msg == 2)) && ((((handle == 3 && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg))) || ((((((((((handle == 3 && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 1)) && !(msg == 1)) && !(msg == 1)) && !(handle == 3)) && client == client)) || (((((2 == \result && 2 == rjh) && 2 == client) && !(handle == 2) && (((((((handle == 3 && !(rjh == 1)) && !(\result == 1)) && !(client == 1)) && msg == handle) && !(client == 1)) && 0 == __ste_client_forwardReceiver1) && 1 == \result) && 1 == msg) && 2 == __ste_email_to0) && 2 == to)) || (((!(handle == 3) && client == client) && !(msg == 2)) && (!(msg == 2) && ((((((!(handle == 2) && (((((handle == 3 && !(rjh == 1)) && !(\result == 1)) && !(client == 1)) && msg == handle) && !(client == 1)) && 1 == \result) && 2 == \result) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) && !(msg == 2)) [2019-01-12 14:38:26,685 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && handle == client) && (((!(msg == 2) && (!(msg == 2) && ((((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || ((!(handle == 2) && (!(msg == 2) && ((((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) || ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && (!(msg == 2) && !(msg == 2) && (((((handle == 3 && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && handle == client) [2019-01-12 14:38:26,685 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(handle == 3) && client == client) && handle == client) && ((!(msg == 1) && !(msg == 1)) && !(msg == 1)) && ((((handle == 3 && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) || ((((((!(handle == 2) && ((0 == __ste_client_forwardReceiver1 && handle == 3 && msg == handle) && 1 == \result) && 1 == msg) && 2 == \result) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to)) || (((!(handle == 3) && client == client) && ((((!(handle == 2) && !(msg == 2)) && !(msg == 2)) && !(msg == 2) && ((((handle == 3 && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) || (((!(msg == 2) && !(msg == 2)) && !(msg == 2)) && !(msg == 2) && ((((handle == 3 && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg))) && handle == client)) || ((((((!(msg == 2) && ((((((!(handle == 2) && (handle == 3 && msg == handle) && 1 == \result) && 2 == \result) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) && !(msg == 2)) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) [2019-01-12 14:38:26,685 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && handle == client) && (((!(msg == 2) && (!(msg == 2) && ((((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || ((!(handle == 2) && (!(msg == 2) && ((((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) || ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && (!(msg == 2) && !(msg == 2) && (((((handle == 3 && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && handle == client) [2019-01-12 14:38:26,685 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(handle == 2) && ((0 == __ste_client_forwardReceiver1 && handle == 3 && msg == handle) && 1 == \result) && 1 == msg) && 2 == \result) && 2 == rjh) && 2 == client) && 2 == to) || (((!(handle == 3) && client == client) && handle == client) && (((2 == rjh && 2 == to) && handle == 3 && 1 == \result) && 1 == msg) && handle == msg) [2019-01-12 14:38:26,688 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((handle == 3 && !(to == 1)) && !(rjh == 1)) && msg == handle) && 0 == \result) || ((((2 == rjh && 2 == to) && (1 == \result && ((handle == 3 && !(to == 1)) && !(rjh == 1)) && msg == handle) && 1 == msg) && client == client) && handle == client) [2019-01-12 14:38:26,690 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(msg == 2) && !(msg == 2)) && !(tmp == 0) && ((2 == rjh && 2 == to) && (handle == 3 && msg == handle) && 1 == \result) && 1 == msg) && !(handle == 3)) && client == client) && !(msg == 2)) && handle == client) && !(msg == 2)) || (((!(handle == 3) && client == client) && handle == client) && (((!(msg == 1) && !(msg == 1)) && !(msg == 1)) && !(tmp == 0) && ((2 == rjh && 2 == to) && (handle == 3 && msg == handle) && 1 == \result) && 1 == msg) && !(msg == 1))) || ((((((!(handle == 2) && ((0 == __ste_client_forwardReceiver1 && handle == 3 && msg == handle) && 1 == \result) && 1 == msg) && 2 == \result) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to) [2019-01-12 14:38:26,690 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((handle == 3 && 2 == rjh) && client == client) && 1 == \result) && 2 == to) && handle == client) && msg == handle) && 1 == msg [2019-01-12 14:38:26,690 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!(handle == 2) && (1 == \result && 1 == msg) && (handle == 3 && msg == handle) && 0 == __ste_client_forwardReceiver1) && 2 == \result) && 2 == rjh) && 2 == client) && 2 == to) || ((((!(tmp == 0) && ((((handle == 3 && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) && !(handle == 3)) && client == client) && handle == client) [2019-01-12 14:38:26,690 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((handle == 3 && 1 == \result) && 2 == rjh) && client == client) && 1 == \result) && 2 == to) && handle == client) && msg == handle) && 1 == msg [2019-01-12 14:38:26,832 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 14:38:26,833 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 14:38:26,833 INFO L168 Benchmark]: Toolchain (without parser) took 123710.20 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 941.9 MB in the beginning and 872.0 MB in the end (delta: 69.9 MB). Peak memory consumption was 1.8 GB. Max. memory is 11.5 GB. [2019-01-12 14:38:26,836 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:38:26,836 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1047.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 44.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:38:26,836 INFO L168 Benchmark]: Boogie Procedure Inliner took 113.21 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-01-12 14:38:26,837 INFO L168 Benchmark]: Boogie Preprocessor took 92.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 14:38:26,837 INFO L168 Benchmark]: RCFGBuilder took 2035.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 997.8 MB in the end (delta: 111.9 MB). Peak memory consumption was 111.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:38:26,837 INFO L168 Benchmark]: TraceAbstraction took 120158.28 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 997.8 MB in the beginning and 909.9 MB in the end (delta: 87.9 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-01-12 14:38:26,841 INFO L168 Benchmark]: Witness Printer took 258.24 ms. Allocated memory is still 2.7 GB. Free memory was 909.9 MB in the beginning and 872.0 MB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2019-01-12 14:38:26,845 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1047.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 941.9 MB in the beginning and 1.1 GB in the end (delta: -174.5 MB). Peak memory consumption was 44.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 113.21 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.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 92.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2035.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 997.8 MB in the end (delta: 111.9 MB). Peak memory consumption was 111.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 120158.28 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 997.8 MB in the beginning and 909.9 MB in the end (delta: 87.9 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 258.24 ms. Allocated memory is still 2.7 GB. Free memory was 909.9 MB in the beginning and 872.0 MB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 110]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 110]: 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: 1296]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__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: 959]: Loop Invariant Derived loop invariant: ((((((((((((((!(handle == 2) && handle == 3) && 2 == rjh) && 0 == \result) && 2 == __ste_email_to0) && 1 == \result) && !(msg == 2)) && 2 == value) && !(msg == 1)) && handle == 1) && !(msg == 2)) && 2 == to) && !(msg == 1)) && msg == handle) && 1 == msg) || ((((((((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && !(msg == 2)) && 2 == value) && 2 == \result) && handle == 1) && !(msg == 2)) && 2 == to) && msg == handle) && 1 == msg) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((!(handle == 3) && (!(msg == 2) && !(msg == 2)) && ((((((handle == 3 && 2 == rjh) && 2 == __ste_email_to0) && !(handle == 2)) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && client == client) && handle == client) || (((!(handle == 3) && client == client) && handle == client) && (((((!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(handle == 2)) && !(msg == 2)) || ((!(msg == 2) && (!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) - InvariantResult [Line: 959]: Loop Invariant Derived loop invariant: ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && handle == client) && (((!(msg == 2) && (!(msg == 2) && ((((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || ((!(handle == 2) && (!(msg == 2) && ((((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) || ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && (!(msg == 2) && !(msg == 2) && (((((handle == 3 && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && handle == client) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((handle == 3 && 2 == rjh) && 0 == __ste_client_forwardReceiver1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 959]: Loop Invariant Derived loop invariant: ((((((((!(msg == 2) && !(msg == 2)) && ((((2 == \result && 2 == rjh) && !(handle == 2) && 1 == \result && ((handle == 3 && !(rjh == 1)) && !(\result == 1)) && msg == handle) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) || (((!(handle == 3) && !(msg == 1) && !(msg == 2) && !(msg == 1) && ((2 == rjh && 2 == to) && 1 == \result && handle == 3 && msg == handle) && 1 == msg) && client == client) && handle == client)) || ((((2 == \result && 2 == rjh) && !(handle == 2) && (((((handle == 3 && !(rjh == 1)) && !(\result == 1)) && msg == handle) && 0 == __ste_client_forwardReceiver1) && 1 == \result) && 1 == msg) && 2 == __ste_email_to0) && 2 == to)) || (((((!(msg == 2) && ((!(msg == 2) && ((2 == rjh && 2 == to) && 1 == \result && handle == 3 && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || ((((!(msg == 2) && ((2 == rjh && 2 == to) && 1 == \result && handle == 3 && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) && !(handle == 2))) && !(handle == 3)) && client == client) && handle == client) - InvariantResult [Line: 808]: 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: 1]: Loop Invariant Derived loop invariant: ((handle == 3 && 2 == rjh) && op2 == 0) && !(__ste_email_to0 == 1) - InvariantResult [Line: 978]: Loop Invariant Derived loop invariant: (((((!(handle == 2) && (1 == \result && 1 == msg) && (handle == 3 && msg == handle) && 0 == __ste_client_forwardReceiver1) && 2 == \result) && 2 == rjh) && 2 == client) && 2 == to) || ((((!(tmp == 0) && ((((handle == 3 && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) && !(handle == 3)) && client == client) && handle == client) - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: (((((2 == rjh && 2 == __ste_email_to0) && 2 == to) && ((((1 == msg && handle == 3) && 0 == __ste_client_forwardReceiver1) && msg == handle) && 1 == \result) && 1 == msg) || (((!(handle == 3) && client == client) && handle == client) && ((!(msg == 2) && ((((handle == 3 && 1 == \result) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) && handle == msg) && !(msg == 2))) || (((!(handle == 3) && client == client) && handle == client) && ((!(msg == 2) && (!(msg == 2) && (((2 == rjh && (handle == 3 && 1 == \result) && handle == msg) && 2 == to) && 1 == msg) && !(msg == 1)) && !(msg == 2)) || (!(handle == 2) && (!(msg == 2) && (((2 == rjh && (handle == 3 && 1 == \result) && handle == msg) && 2 == to) && 1 == msg) && !(msg == 1)) && !(msg == 2))))) || (((!(handle == 3) && client == client) && (((!(handle == 2) && !(msg == 2)) && !(msg == 2) && (((((1 == msg && handle == 3) && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) || ((!(msg == 2) && !(msg == 2)) && !(msg == 2) && (((((1 == msg && handle == 3) && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg))) && handle == client) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 657]: Loop Invariant Derived loop invariant: (((!(handle == 3) && (!(msg == 2) && !(msg == 2)) && ((((((handle == 3 && 2 == rjh) && 2 == __ste_email_to0) && !(handle == 2)) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && client == client) && handle == client) || (((!(handle == 3) && client == client) && handle == client) && (((((!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(handle == 2)) && !(msg == 2)) || ((!(msg == 2) && (!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) - InvariantResult [Line: 978]: Loop Invariant Derived loop invariant: ((((((handle == 3 && 2 == rjh) && client == client) && 1 == \result) && 2 == to) && handle == client) && msg == handle) && 1 == msg - InvariantResult [Line: 978]: Loop Invariant Derived loop invariant: ((((((!(msg == 2) && !(handle == 2)) && !(msg == 2)) && (((((((((((((((((((!(msg == 2) && !(handle == 2)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 1)) && !(msg == 1)) && 2 == to) && msg == handle) && 0 == client) && !(tmp == 0)) && !(msg == 1)) && handle == 3) && 0 == \result) && 1 == \result) && !(\result == 0)) && !(handle == 2)) && !(handle == 1)) && !(msg == 1)) && !(handle == 1)) && 0 == handle) && 1 == msg) && handle == client) && !(msg == 2)) || ((((((!(msg == 2) && !(handle == 2)) && client == client) && !(msg == 2)) && (!(msg == 2) && !(handle == 2)) && (((((((((!(handle == 2) && !(tmp == 0)) && handle == 3) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 2 == \result) && 2 == to) && msg == handle) && 1 == msg) && handle == client) && !(msg == 2))) || ((((!(msg == 2) && ((!(msg == 2) && !(msg == 2)) && !(handle == 2)) && (((((((((!(handle == 2) && !(tmp == 0)) && handle == 3) && 2 == rjh) && 2 == client) && 1 == \result) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) && msg == handle) && client == client) && handle == client) && !(msg == 2)) - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: ((((handle == 3 && 2 == rjh) && !(handle == 2)) && 2 == to) && !(__ste_email_to0 == 1)) && 1 == msg - InvariantResult [Line: 1500]: Loop Invariant Derived loop invariant: (((((((handle == 3 && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && !(handle == 2)) && 1 == \result) && 2 == to) && 2 == value) && 1 == msg - InvariantResult [Line: 978]: Loop Invariant Derived loop invariant: ((((((!(msg == 2) && ((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) || (((!(handle == 3) && client == client) && ((!(handle == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || (!(msg == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) && handle == client) - InvariantResult [Line: 785]: Loop Invariant Derived loop invariant: ((handle == 3 && 2 == rjh) && 0 == __ste_client_forwardReceiver1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 941]: Loop Invariant Derived loop invariant: ((((((((handle == 3 && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && !(msg == 2)) && 2 == value) && msg == handle) && 1 == msg - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((1 == \result && tmp == 1) && (((((!(msg == 2) && ((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) || ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && ((!(handle == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || (!(msg == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) && handle == client) - InvariantResult [Line: 571]: Loop Invariant Derived loop invariant: (((((!(msg == 2) && ((!(msg == 2) && !(msg == 2)) && !(handle == 2)) && (((((((((!(handle == 2) && !(tmp == 0)) && handle == 3) && 2 == rjh) && 2 == client) && 1 == \result) && 2 == \result) && handle == 1) && 2 == to) && 1 == msg) && msg == handle) && client == client) && handle == client) && !(msg == 2)) || ((client == client && handle == client) && (((!(msg == 2) && ((((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 2 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(handle == 2)) && !(msg == 2)) && !(msg == 2))) || (((((((((((((((((((((((((!(msg == 2) && !(handle == 2)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 2)) && !(msg == 1)) && !(msg == 2)) && 2 == to) && !(msg == 1)) && msg == handle) && 0 == client) && !(tmp == 0)) && !(msg == 1)) && handle == 3) && 0 == \result) && 1 == \result) && !(\result == 0)) && !(handle == 2)) && !(handle == 1)) && !(msg == 2)) && !(msg == 1)) && !(handle == 1)) && !(handle == 2)) && client == client) && 0 == handle) && 1 == msg) - InvariantResult [Line: 978]: Loop Invariant Derived loop invariant: ((((((handle == 3 && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && !(handle == 2)) && 2 == to) && 2 == value) && 1 == msg - InvariantResult [Line: 1399]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1410]: 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: 2544]: Loop Invariant Derived loop invariant: ((((((((handle == 3 && 2 == rjh) && handle == 1) && 2 == __ste_email_to0) && !(handle == 2)) && 1 == \result) && 2 == to) && !(msg == 2)) && 2 == value) && 1 == msg - InvariantResult [Line: 1377]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1388]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 571]: Loop Invariant Derived loop invariant: (((((!(handle == 2) && ((0 == __ste_client_forwardReceiver1 && handle == 3 && msg == handle) && 1 == \result) && 1 == msg) && 2 == \result) && 2 == rjh) && 2 == client) && 2 == to) || (((!(handle == 3) && client == client) && handle == client) && (((2 == rjh && 2 == to) && handle == 3 && 1 == \result) && 1 == msg) && handle == msg) - InvariantResult [Line: 1363]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2544]: Loop Invariant Derived loop invariant: (((!(handle == 3) && client == client) && handle == client) && (!(msg == 2) && (((((2 == rjh && 2 == __ste_email_to0) && 2 == to) && !(handle == 2)) && 1 == \result) && handle == 3) && 1 == msg) && !(msg == 2)) || (((!(handle == 3) && ((((!(msg == 2) && ((((handle == 3 && 2 == rjh) && 2 == to) && !(handle == 2)) && 1 == \result) && 1 == msg) && !(handle == 2)) && !(msg == 2)) || ((!(msg == 2) && !(msg == 2) && ((((handle == 3 && 2 == rjh) && 2 == to) && !(handle == 2)) && 1 == \result) && 1 == msg) && !(msg == 2)))) && client == client) && handle == client) - InvariantResult [Line: 2062]: Loop Invariant Derived loop invariant: (((((!(handle == 3) && client == client) && handle == client) && ((!(msg == 1) && !(msg == 1)) && !(msg == 1)) && ((((handle == 3 && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) || ((((((!(handle == 2) && ((0 == __ste_client_forwardReceiver1 && handle == 3 && msg == handle) && 1 == \result) && 1 == msg) && 2 == \result) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to)) || (((!(handle == 3) && client == client) && ((((!(handle == 2) && !(msg == 2)) && !(msg == 2)) && !(msg == 2) && ((((handle == 3 && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) || (((!(msg == 2) && !(msg == 2)) && !(msg == 2)) && !(msg == 2) && ((((handle == 3 && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg))) && handle == client)) || ((((((!(msg == 2) && ((((((!(handle == 2) && (handle == 3 && msg == handle) && 1 == \result) && 2 == \result) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) && !(msg == 2)) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: (((((!(msg == 2) && !(handle == 3)) && client == client) && !(msg == 2)) && handle == client) && (!(msg == 2) && ((((((((!(tmp == 0) && !(handle == 2)) && handle == 3) && 2 == rjh) && !(handle == 2)) && 1 == \result) && handle == 1) && 2 == to) && msg == handle) && 1 == msg) && !(handle == 2)) || (((((((!(msg == 2) && ((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(handle == 2)) && !(msg == 2)) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) - InvariantResult [Line: 1341]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1454]: Loop Invariant Derived loop invariant: ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && handle == client) && (((!(msg == 2) && (!(msg == 2) && ((((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || ((!(handle == 2) && (!(msg == 2) && ((((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) || ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && (!(msg == 2) && !(msg == 2) && (((((handle == 3 && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && handle == client) - InvariantResult [Line: 1352]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1316]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1330]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 2497]: Loop Invariant Derived loop invariant: ((((handle == 3 && !(to == 1)) && !(rjh == 1)) && msg == handle) && 0 == \result) || ((((2 == rjh && 2 == to) && (1 == \result && ((handle == 3 && !(to == 1)) && !(rjh == 1)) && msg == handle) && 1 == msg) && client == client) && handle == client) - InvariantResult [Line: 1454]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 922]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: (!(rjh == 1) && 0 == __ste_client_forwardReceiver1) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1305]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((((((!(msg == 2) && !(handle == 2)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 2)) && 2 == value) && !(msg == 2)) && 2 == to) && msg == handle) && handle == 3) && 2 == client) && 1 == \result) && 2 == \result) && handle == 1) && client == client) && 1 == msg) || ((((((((((((((((((!(msg == 2) && !(handle == 2)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 2)) && 2 == value) && !(msg == 1)) && !(msg == 2)) && 2 == to) && !(msg == 1)) && msg == handle) && 0 == client) && handle == 3) && 0 == \result) && 1 == \result) && !(msg == 1)) && handle == 1) && client == client) && 1 == msg) - InvariantResult [Line: 1482]: Loop Invariant Derived loop invariant: ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && handle == client) && (((!(msg == 2) && (!(msg == 2) && ((((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || ((!(handle == 2) && (!(msg == 2) && ((((handle == 3 && 2 == rjh) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) || ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && (!(msg == 2) && !(msg == 2) && (((((handle == 3 && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && handle == client) - InvariantResult [Line: 1482]: Loop Invariant Derived loop invariant: (((((((handle == 3 && 1 == \result) && 2 == rjh) && client == client) && 1 == \result) && 2 == to) && handle == client) && msg == handle) && 1 == msg - InvariantResult [Line: 648]: Loop Invariant Derived loop invariant: (((!(handle == 3) && (!(msg == 2) && !(msg == 2)) && ((((((handle == 3 && 2 == rjh) && 2 == __ste_email_to0) && !(handle == 2)) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && client == client) && handle == client) || (((!(handle == 3) && client == client) && handle == client) && (((((!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(handle == 2)) && !(msg == 2)) || ((!(msg == 2) && (!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((!(handle == 3) && client == client) && ((!(handle == 2) && ((!(msg == 2) && !(msg == 2)) && !(msg == 2)) && ((((handle == 3 && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) || (!(msg == 2) && ((!(msg == 2) && !(msg == 2)) && !(msg == 2)) && ((((handle == 3 && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg))) || ((((((((((handle == 3 && msg == handle) && 1 == \result) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 1)) && !(msg == 1)) && !(msg == 1)) && !(handle == 3)) && client == client)) || (((((2 == \result && 2 == rjh) && 2 == client) && !(handle == 2) && (((((((handle == 3 && !(rjh == 1)) && !(\result == 1)) && !(client == 1)) && msg == handle) && !(client == 1)) && 0 == __ste_client_forwardReceiver1) && 1 == \result) && 1 == msg) && 2 == __ste_email_to0) && 2 == to)) || (((!(handle == 3) && client == client) && !(msg == 2)) && (!(msg == 2) && ((((((!(handle == 2) && (((((handle == 3 && !(rjh == 1)) && !(\result == 1)) && !(client == 1)) && msg == handle) && !(client == 1)) && 1 == \result) && 2 == \result) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to) && 1 == msg) && !(msg == 2)) - InvariantResult [Line: 885]: Loop Invariant Derived loop invariant: ((1 == \result && tmp == 1) && (((((!(msg == 2) && ((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) || ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && ((!(handle == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || (!(msg == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) && handle == client) - InvariantResult [Line: 885]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1482]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 2062]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(msg == 2) && !(handle == 2)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 2)) && 2 == value) && !(msg == 1)) && !(msg == 2)) && 2 == to) && !(msg == 1)) && msg == handle) && 0 == client) && handle == 3) && 0 == \result) && 1 == \result) && !(\result == 0)) && !(msg == 1)) && handle == 1) && client == client) && 0 == handle) && 1 == msg) || ((((((((((((((((!(msg == 2) && !(handle == 2)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 2)) && 2 == value) && !(msg == 2)) && 2 == to) && handle == client) && msg == handle) && handle == 3) && 2 == client) && 1 == \result) && 2 == \result) && handle == 1) && client == client) && 1 == msg) - InvariantResult [Line: 666]: Loop Invariant Derived loop invariant: (((!(handle == 3) && (!(msg == 2) && !(msg == 2)) && ((((((handle == 3 && 2 == rjh) && 2 == __ste_email_to0) && !(handle == 2)) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && client == client) && handle == client) || (((!(handle == 3) && client == client) && handle == client) && (((((!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(handle == 2)) && !(msg == 2)) || ((!(msg == 2) && (!(msg == 2) && (((1 == \result && handle == 3 && msg == handle) && 2 == rjh) && 2 == to) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) - InvariantResult [Line: 959]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 922]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((!(msg == 2) && !(handle == 2)) && 2 == rjh) && 2 == __ste_email_to0) && !(msg == 2)) && 2 == value) && !(msg == 1)) && !(msg == 2)) && 2 == to) && !(msg == 1)) && msg == handle) && 0 == client) && !(tmp == 0)) && !(msg == 1)) && handle == 3) && 0 == \result) && 1 == \result) && !(\result == 0)) && !(handle == 2)) && !(handle == 1)) && !(msg == 2)) && !(msg == 1)) && handle == 1) && client == client) && 0 == handle) && 1 == msg) || (((((((!(msg == 2) && !(msg == 2)) && client == client) && !(msg == 2)) && (((((((((((!(handle == 2) && !(tmp == 0)) && handle == 3) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 1 == \result) && 2 == value) && 2 == \result) && handle == 1) && 2 == to) && msg == handle) && 1 == msg) && handle == client) && !(handle == 2)) && !(msg == 2)) - InvariantResult [Line: 818]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 922]: Loop Invariant Derived loop invariant: ((1 == \result && tmp == 1) && (((((!(msg == 2) && ((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) || ((1 == \result && tmp == 1) && ((!(handle == 3) && client == client) && ((!(handle == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || (!(msg == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) && handle == client) - InvariantResult [Line: 922]: Loop Invariant Derived loop invariant: ((((((((!(msg == 2) && !(msg == 2)) && !(tmp == 0) && ((2 == rjh && 2 == to) && (handle == 3 && msg == handle) && 1 == \result) && 1 == msg) && !(handle == 3)) && client == client) && !(msg == 2)) && handle == client) && !(msg == 2)) || (((!(handle == 3) && client == client) && handle == client) && (((!(msg == 1) && !(msg == 1)) && !(msg == 1)) && !(tmp == 0) && ((2 == rjh && 2 == to) && (handle == 3 && msg == handle) && 1 == \result) && 1 == msg) && !(msg == 1))) || ((((((!(handle == 2) && ((0 == __ste_client_forwardReceiver1 && handle == 3 && msg == handle) && 1 == \result) && 1 == msg) && 2 == \result) && 2 == rjh) && 2 == client) && 2 == __ste_email_to0) && 2 == to) - InvariantResult [Line: 1297]: Loop Invariant Derived loop invariant: (handle == 3 && 2 == rjh) && !(__ste_email_to0 == 1) - InvariantResult [Line: 1482]: Loop Invariant Derived loop invariant: (1 == \result && ((!(handle == 3) && client == client) && ((!(handle == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) || (!(msg == 2) && ((!(msg == 2) && (((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == to) && 1 == \result) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)))) && handle == client) || (1 == \result && (((((!(msg == 2) && ((((((!(handle == 2) && handle == 3) && 2 == rjh) && 2 == __ste_email_to0) && 1 == \result) && 2 == to) && msg == handle) && 1 == msg) && !(msg == 2)) && !(msg == 2)) && !(handle == 3)) && client == client) && handle == client) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 162 locations, 2 error locations. SAFE Result, 119.9s OverallTime, 25 OverallIterations, 2 TraceHistogramMax, 15.2s AutomataDifference, 0.0s DeadEndRemovalTime, 96.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 6762 SDtfs, 14330 SDslu, 16221 SDs, 0 SdLazy, 1684 SolverSat, 327 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 290 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 239 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1135 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2297occurred in iteration=24, 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: 2.2s AutomataMinimizationTime, 25 MinimizatonAttempts, 8378 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 63 LocationsWithAnnotation, 63 PreInvPairs, 1169 NumberOfFragments, 4777 HoareAnnotationTreeSize, 63 FomulaSimplifications, 6457476240584 FormulaSimplificationTreeSizeReduction, 20.8s HoareSimplificationTime, 63 FomulaSimplificationsInter, 24604585247 FormulaSimplificationTreeSizeReductionInter, 75.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 1303 NumberOfCodeBlocks, 1303 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1278 ConstructedInterpolants, 0 QuantifiedInterpolants, 103546 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 42/42 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...